A Linear Potential Function for Pairing Heaps

Conference paper

DOI: 10.1007/978-3-319-48749-6_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 10043)
Cite this paper as:
Iacono J., Yagnatinsky M. (2016) A Linear Potential Function for Pairing Heaps. In: Chan TH., Li M., Wang L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science, vol 10043. Springer, Cham

Abstract

We present the first potential function for pairing heaps with linear range. This implies that the runtime of a short sequence of operations is faster than previously known. It is also simpler than the only other potential function known to give constant amortized time for insertion.

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  1. 1.NYU Tandon School of EngineeringBrooklynUSA

Personalised recommendations