Equivalence between priority queues and sorting

Journal of the ACM

Volumn 54, Issue 6, 2007, Pages

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Priority queues; Sorting

Indexed keywords

MONOTONE PRIORITY QUEUES; PRIORITY QUEUES;

ASYMPTOTIC ANALYSIS; RANDOM PROCESSES; SORTING;

ALGORITHMS;

EID: 37049010096     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1314690.1314692     Document Type: Article

References (27)

1. ALSTRUP, S., HUSFELDT, T., RAUHE, T., AND THORUP, M. 2005. Black box for constant-time insertion in priority queues (note). ACM Trans. Algor. 1, 1, 102-106.
2. 0 instructions only. Theor. Comput. Sc. 215, 1-2, 337-344.
3. ANDERSSON, A., AND THORUP, M. 2007. Dynamic ordered sets with exponential search trees. J. ACM 54, 3, Article 13. (Combines results announed at FOCS'96, STOC'00, and SODA'01.)
4. BEAME, P., AND FICH, F. 2002. Optimal bounds for the predecessor problem and related problems. J. Comput. Syst. Sci. 65, 1, 38-72. (Announced at STOC'99.)
5. COMRIE, L. J. 1929-30. The hollerith and powers tabulating machines. Trans. Office Mach. Users' Assoc., Ltd, 25-37.
6. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L., AND STEIN, C. 2001. Introduction to Algorithms, Second ed. The MIT Press, Cambridge, MA.
7. DIJKSTRA, E. W. 1959. A note on two problems in connection with graphs. Numer. Math. 1, 269-271.
8. DUMEY, A. I. 1956. Indexing for rapid random access memory systems. Comput. Automat. 5, 12, 6-9.
9. FORD, L. R., AND JOHNSON, S. M. 1959. A tournament problem. Amer. Math. Month. 66, 5, 387-389.
10. FREDMAN, M. L., AND SAKS, M. E. 1989. The cell probe complexity of dynamic data structures. In Proceedings of the 21st Symposium on Theory of Computing (STOC). ACM, New York, 345-354.
11. FREDMAN, M. L., AND WILLARD, D. E. 1993. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci. 47, 424-436. (Announced at STOC'90.)
12. FREDMAN, M. L., AND WILLARD, D. E. 1994. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci. 48, 533-551.
13. HAN, Y. 2001. Improved fast integer sorting in linear space. Inf. Comput. 170, 8, 81-94. (Announced at STACS'00 and SODA'01.)
14. HAN, Y. 2004. Deterministic sorting in O(n log log n) time and linear space. J. Algorithms 50, 1, 95-105. (Announced at STOC'02.)
15. HAN, Y., AND THORUP, M. 2002. Integer sorting in O(n√log log n) expected time and linear space. In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los, Alamitos, CA, 135-144.
16. KERNIGHAN, B., AND RITCHIE, D. 1988. The C Programming Language, Second ed. Prentice-Hall, Englewood Cliffs, NJ.
17. MENDELSON, R., TARJAN, R., THORUP, M., AND ZWICK, U. 2006. Melding priority queues. ACM Trans. Algor. 2, 4, 535-557. (Announced at SODA'03 and SWAT'04.)
18. PRIM, R. C. 1957. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36, 1389-1401.
19. TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2, 215-225.
20. THORUP, M. 1998. Faster deterministic sorting and priority queues in linear space. In Proceedings of the 9th Symposium on Discrete Algorithms (SODA). ACM, New York, 550-555.
21. THORUP, M. 2000. On RAM priority queues. SIAM J. Comput. 30, 1, 86-109. (Announced at SODA'96.)
22. THORUP, M. 2002. Randomized sorting in O (n log log n) time and linear space using addition, shift, and bit-wise boolean operations. J. Algor. 42, 2, 205-230. (Announced at SODA'97.)
23. THORUP, M. 2003a. Combinatorial power in multimedia processors. ACM SIGARCH Comput. Architect. News 31, 5, 5-11.
24. 0 implementations of fusion trees and atomic heaps. In Proceedings of the 14th Symposium on Discrete Algorithms (SODA). ACM, New York, 699-707.
25. THORUP, M. 2004. Integer priority queues with decrease key in constant time and the single source shortest paths problem.. J. Comput. Syst. Sci. 69, 3, 330-353. (Announced at STOC'03.)
26. WILLARD, D. E. 2000. Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree. SIAM J. Comput. 29, 3, 1030-1049. (Announced at SODA'92.)
27. WILLARD, D. E., AND LUEKER, G. S. 1985. Adding range restriction capability to dynamic data structures. J. ACM 32, 3, 597-617.