Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Flow sampling under hard resource constraints
Proceedings of the joint international conference on Measurement and modeling of computer systems
Journal of Computer and System Sciences - Special issue: STOC 2003
Black box for constant-time insertion in priority queues (note)
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Proceedings of the twenty-fourth annual symposium on Computational geometry
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Recursive design of hardware priority queues
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We present a general deterministic linear space reduction from priority queues to sorting implying that if we can sort up to n keys in S(n) time per key, then there is a priority queue supporting delete and insert in S(n)+O(1) time and find - min in constant time. Conversely, a priority queue can trivially be used for sorting: first insert all keys to be sorted, then extract them in sorted order by repeatedly deleting the minimum. Hence, asymptotically this settles the complexity of priority queues in terms of that of sorting.Besides nailing down the complexity of priority queues to that of sorting, and vice versa, we translate known sorting results into new results on priority queues for integers and strings in different computational models.