A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion.

Corwin Sinnamon Robert E. Tarjan

Published in: CoRR (2022)

Keyphrases

worst case
data sets
theorem prover
search tree
real time
theorem proving
block size
proof theory
web services
case study
multi agent systems
lower bound
probabilistic model
upper bound
running times
automated theorem proving