Equivalence between priority queues and sorting

DOI10.1145/1314690.1314692zbMath1326.68113OpenAlexW2624301084WikidataQ56059667 ScholiaQ56059667MaRDI QIDQ3546352

Mikkel Thorup

Publication date: 21 December 2008

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (9)

Dynamic coresets ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ Optimizing binary heaps ⋮ A simple reduction from maximum weight matching to maximum cardinality matching ⋮ Unnamed Item ⋮ A Survey on Priority Queues ⋮ A Forward-Backward Single-Source Shortest Paths Algorithm ⋮ Unnamed Item ⋮ RAM-Efficient External Memory Sorting

This page was built for publication: Equivalence between priority queues and sorting