Melding priority queues

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3111, Issue , 2004, Pages 223-235

  Mendelson, Ran ^a   Tarjan, Robert E ^b,c   Thorup, Mikkel ^d   Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b Princeton University   (United States)

^c HEWLETT PACKARD COMPANY   (United States)

^d AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

ACKERMANN FUNCTIONS; AMORTIZED TIME; ASYMPTOTIC COST; FUNCTIONAL INVERSE; PRIORITY QUEUES; UNION-FIND DATA STRUCTURES;

QUEUEING THEORY;

EID: 33746062908     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27810-8_20     Document Type: Article

References (23)

1. S. Alstrup, T. Husfeldt, and T. Rauhe. Marked ancestor problems. Technical Report DIKU 98-8, Dept. Comput. Sc., Univ. Copenhagen, 1998. (The result needed from here is not included in the FOCS'98 extended abstract.)
2. G.S. Brodal. Worst-case efficient priority queues. In Proc. of 7th SODA, pages 52-58, 1996.
3. E.W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269-271, 1959.
4. J. Edmonds. Optimum branchings. J. Res. Nat. Bur. Standards, 71B:233-240, 1967.
5. M.L. Fredman and R.E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34:596-615, 1987.
6. M.L. Fredman and D.E. Willard. Surpassing the information-theoretic bound with fusion trees. Journal of Computer and System Sciences, 47(3):424-436, 1993.
7. M.L. Fredman and D.E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48:533-551, 1994.
8. H.N. Gabow, Z. Galil, T.H. Spencer, and R.E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6:109-122, 1986.
9. Y. Han. Deterministic sorting in O(n log log n) time and linear space. In Proc. of 34th STOC, pages 602-608, 2002.
10. Y. Han and M. Thorup. Integer sorting in O(n√log log n) expected time and linear space. In Proc. of 43rd FOCS, pages 135-144, 2002.
11. H. Kaplan, N. Shafrir, and R.E. Tarjan. Meldable heaps and boolean union-find. Proc. of 34th STOC, pages 573-582, 2002.
12. H. Kaplan, N. Shafrir, and R.E. Tarjan. Union-find with deletions. In Proc. of 13th SODA, pages 19-28, 2002.
13. K. Mehlhorn and S. Näher. Bounded ordered dictionaries in O(log log N) time and O(n) space. Information Processing Letters, 35(4):183-189, 1990.
14. R. Mendelson, M. Thorup, and U. Zwick. Meldable RAM priority queues and minimum directed spanning trees. In Proc. of 15th SODA, pages 40-48, 2004.
15. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
16. R.E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22:215-225, 1975.
17. R.E. Tarjan. Amortized computational complexity. SIAM Journal on Algenraic and Discrete Methods, 6:306-318, 1985.
18. M. Thorup. On RAM priority queues. SIAM Journal on Computing, 30(1):86-109, 2000.
19. M. Thorup. Equivalence between priority queues and sorting. In Proc. of 43rd FOCS, pages 125-134, 2002.
20. M. Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. In Proc. of 35th STOC, pages 149-158, 2003.
21. 0 implementations of fusion trees and atomic heaps. In Proc. of 14th SODA, pages 699-707, 2003.
22. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6(3):80-82, 1977.
23. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10:99-127, 1977.