A Linear Potential Function for Pairing Heaps

DOI10.1007/978-3-319-48749-6_36zbMath1483.68096arXiv1606.06389OpenAlexW2963965629MaRDI QIDQ2958341

Mark Yagnatinsky, John Iacono

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1606.06389

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ A Linear Potential Function for Pairing Heaps ⋮ Pairing heaps: the forward variant.

Cites Work

• The pairing heap: A new form of self-adjusting heap
• A Linear Potential Function for Pairing Heaps
• On the efficiency of pairing heaps and related data structures
• Pairing Heaps with Costless Meld
• Self-adjusting binary search trees
• A data structure for manipulating priority queues
• On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
• Rank-Pairing Heaps