Meldable heaps and boolean union-find

DOI10.1145/509907.509990zbMATH Open1192.68181OpenAlexW2037658490MaRDI QIDQ3579246FDOQ3579246

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 (8)

• Two-tier relaxed heaps
• Regular numeral systems for data structures
• Bipartite binomial heaps
• Worst-case optimal priority queues via extended regular counters
• A priority queue with the time-finger property
• P-tree structures and event horizon: efficient event-set implementations
• A survey on priority queues
• Hollow 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)