Equivalence between priority queues and sorting
DOI10.1145/1314690.1314692zbMATH Open1326.68113OpenAlexW2624301084WikidataQ56059667 ScholiaQ56059667MaRDI QIDQ3546352FDOQ3546352
Authors: 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
Recommendations
- Equivalence between priority queues and sorting in external memory
- Priority Queues and Permutations
- scientific article; zbMATH DE number 2086621
- Priority queues
- Ordered priority queues
- Priority queues and multisets
- Priority queues with binary priorities
- Rank order filters and priority queues
- Priority queue sorting and labeled trees
- The permutational power of a priority queue
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (11)
- Dynamic coresets
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Forward-Backward Single-Source Shortest Paths Algorithm
- A Survey on Priority Queues
- RAM-Efficient External Memory Sorting
- A simple reduction from maximum weight matching to maximum cardinality matching
- Linear-Time Approximation for Maximum Weight Matching
- Rank order filters and priority queues
- Optimizing binary heaps
- Algorithms and Computation
This page was built for publication: Equivalence between priority queues and sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546352)
