Meldable heaps and boolean union-find

DOI10.1145/509907.509990zbMath1192.68181OpenAlexW2037658490MaRDI QIDQ3579246

Nira Shafrir, Haim Kaplan, Robert Endre 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

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

Related Items (8)

Hollow Heaps ⋮ Regular numeral systems for data structures ⋮ Worst-Case Optimal Priority Queues via Extended Regular Counters ⋮ A priority queue with the time-finger property ⋮ Two-tier relaxed heaps ⋮ Bipartite binomial heaps ⋮ P-tree structures and event horizon: efficient event-set implementations ⋮ A Survey on Priority Queues

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