Equivalence between priority queues and sorting

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 125-134

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; C (PROGRAMMING LANGUAGE); COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STRUCTURES; DIGITAL ARITHMETIC; FUNCTION EVALUATION; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE; SORTING; THEOREM PROVING;

BUFFER SYSTEM; COMPUTATIONAL MODELS; PRIORITY QUEUES;

EQUIVALENCE CLASSES;

EID: 0036954494     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems. In Proc. 39th FOCS, pages 534-544, 1998.
2. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in linear time? J. Comp. Syst. Sc., 57:74-93, 1998. Announced at STOC'95.
3. A. Andersson and M. Thorup. Tight(er) worst-case bounds on dynamic searching and priority queues. In Proc. 32nd STOC, pages 335-342, 2000.
4. P. Beame and F. Fich. Optimal bounds for the predecessor problem. In Proc. 31st STOC, pages 295-304, 1999. To appear in J. Comput. Syst. Sc.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. The MIT Press, Cambridge, MA, second edition, 2001.
6. E. W. Dijkstra. A note on two problems in connection with graphs. Numer. Math., 1:269-271, 1959.
7. M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st STOC, pages 345-354, 1989.
8. M. L. Fredman and D. E. Willard. Surpassing the information theoretic bound with fusion trees. J. Comput. Syst. Sci., 47:424-436, 1993, Announced at STOC'90.
9. M. L. Fredman and D. E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci., 48:533-551, 1994.
10. Y. Han. Improved fast integer sorting in linear space. Inf. Comput., 170(8):81-94, 2001. Announced at STACS'00 and SODA'01.
11. Y. Han. Deterministic sorting in O(n log log n) time and linear space. In Proc. 34th STOC, pages 602-608, 2002.
12. Y. Han and M. Thorup. Integer sorting in O(n √log log n) expected time and linear space. In Proc. 43rd FOCS, 2002.
13. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
14. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22(2):215-225, 1975.
15. M. Thorup. Faster deterministic sorting and priority queues in linear space. In Proc. 9th SODA, pages 550-555, 1998.
16. M. Thorup. On RAM priority queues. SIAM J. Comp., 30(1):86-109, 2000, Announced at SODA'96.
17. M. Thorup. 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, 2002. Announced at SODA'97.
18. D. E. Willard. Examining computational geometry, van Emde Boas trees, and hashing from the perspective of the fusion tree. SIAM J. Comput., 29(3):1030-1049, 2000. Announced at SODA'92.