Meldable heaps and boolean union-find

DOI10.1145/509907.509990MaRDI QIDQ3579246zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Nira Shafrir, Robert E. Tarjan

Publication date 5 August 2010

Published in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cited in

(9)

• A priority queue with the time-finger property
• Regular numeral systems for data structures
• P-tree structures and event horizon: efficient event-set implementations
• A survey on priority queues
• Worst-case optimal priority queues via extended regular counters
• Hollow Heaps
• Bipartite binomial heaps
• Strict Fibonacci heaps
• Two-tier relaxed heaps

This page was built for publication: Meldable heaps and boolean union-find

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579246)