On the efficiency of pairing heaps and related data structures

DOI10.1145/320211.320214zbMath1065.68519OpenAlexW1989031126WikidataQ29303178 ScholiaQ29303178MaRDI QIDQ3158546

Michael L. Fredman

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/320211.320214

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (8)

A Linear Potential Function for Pairing Heaps ⋮ Unnamed Item ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Two-tier relaxed heaps ⋮ Pairing heaps: the forward variant. ⋮ The number of tests required to search an unordered table ⋮ THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP ⋮ A Survey on Priority Queues

This page was built for publication: On the efficiency of pairing heaps and related data structures