Melding priority queues

ACM Transactions on Algorithms

Volumn 2, Issue 4, 2006, Pages 535-556

  Mendelson, Ran ^a   Tarjan, Robert E ^b,c,e   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)

^e Princeton University   (United States)

Author keywords

Disjoint set union; Heaps; Minimum directed spanning trees; Optimum branchings; Priority queues; Union find; Word RAM model

Indexed keywords

DISJOINT SET UNION; MINIMUM DIRECTED SPANNING TREES; OPTIMUM BRANCHINGS; PRIORITY QUEUES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; QUEUEING THEORY; RANDOM ACCESS STORAGE; SET THEORY; TREES (MATHEMATICS);

DATA STRUCTURES;

EID: 33846583487     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1198513.1198517     Document Type: Conference Paper

References (34)

1. ALSTRUP, S., GØRTZ, I., RAUHE, T., THORUP, M., AND ZWICK, U. 2005. Union-find with constant time deletions. In Proceedings of the 32th International Colloquium on Automata, Languages and Programming (ICALP). 78-89.
2. ALSTRUP, S., HUSFELDT, T., RAUHE, T., AND THORUP, M. 2005. Black box for constant-time insertion in priority queues (note). ACM Trans. Algorithms. 1, 1, 102-106.
3. BOCK, F. 1971. An algorithm to construct a minimum directed spanning tree in a directed network. In Developments in Operations Research. Gordon and Breach, New York, 29-44.
4. BRIGHT, J. 1993. Range-restricted mergeable priority queues. Inform. Process. Lett. 47, 3, 159-164.
5. AMERINI, P., FRATTA, L., AND MAFFIOLI, F. 1979. A note on finding optimum branchings. Networks 9, 309-312.
6. HAZELLE, B. 2000. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47, 6, 1028-1047.
7. HU, Y., AND LIU, T. 1965. On the shortest arborescence of a directed graph. Sci. Sinica 14, 1396-1400.
8. OMRIE, L. 1929. The Hollerith and Powers tabulating machines. Office Machinary Users' Association, Ltd. 25-37.
9. ORMEN, T., LEISERSON, C., RIVEST, R., AND STEIN, C. 2001. Introduction to Algorithm 2nd Ed. MIT Press, Cambridge, MA.
10. IJKSTRA, E. 1959. A note on two problems in connexion with graphs. Numerische Mathematik I, 269-271.
11. UMEY, A. 1956. Indexing for rapid random access memory systems. Comput. Automation 5, 12, 6-9.
12. EDMONDS, J. 1967. Optimum branchings. J. Res. Nat. Bur. Stand. 71B, 233-240.
13. FREDMAN, M., AND TARJAN, R. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
14. FREDMAN, M., AND WILLARD, D. 1993. Surpassing the information-theoretic bound with fusion trees. J. Comput. Syst. Sci. 47, 3, 424-436.
15. FREDMAN, M., AND WILLARD, D. 1994. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Compu. Syst. Sci. 48, 533-551.
16. GABOW, H., GALIL, Z., SPENCER, T., AND TARJAN, R. 1986. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica 6, 109-122.
17. HAN, Y. 2002. Deterministic sorting in O(n log log n) time and linear space. In Proceedings of the 34th Symposium on Theory of Computing (STOC). 602-608.
18. 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 the Foundations of Computer Science (FOCS). 135-144.
19. KAPLAN, H., SHAFRIR, N., AND TARJAN, R. 2002. Meldable heaps and boolean union-find. In Proceedings of the 34th Symposium on Theory of Computing (STOC). 573-582.
20. KAPLAN, H., SHAFRIR, N., AND TARJAN, R. 2002b. Union-find with deletions. In Proceedings of 13th Symposium on Discrete Algorithm (SODA). 19-28.
21. KARGER, D., KLEIN, P., AND TARJAN, R. 1995. A randomized linear-time algorithm to find minimum spanning trees. J. ACM 42, 321-328.
22. KARP, R. 1971. A simple derivation of Edmonds' algorithm for optimum branchings. Networks 1, 265-272.
23. ENDELSON, R., TARJAN, R., THORUP, M., AND ZWICK, U. 2004a. Melding priority queues. In Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). 223-235.
24. ENDELSON, R., THORUP, M., AND ZWICK, U. 2004. Meldable RAM priority queues and minimum directed spanning trees. In Proceedings of 15th Symposium on Discrete Algorithm (SODA). 40-48.
25. PETTIE, S., AND RAMACHANDRAN, V. 2002. An optimal minimum spanning tree algorithm. J. ACM 49, 1, 16-34.
26. TARJAN, R. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 215-225.
27. TARJAN, R. 1977. Finding optimum branchings. Networks 7, 25-35.
28. TARJAN, R. 1983. Data Structures and Network Algorithms. SIAM.
29. TARJAN, R. 1985. Amortized computational complexity. SIAM J. Algebraic Discrete Meth. 6, 306-318.
30. TARJAN, R., AND VAN LEEUWEN, J. 1984. Worst-case analysis of set union algorithms. J. ACM 31, 245-281.
31. THORUP, M. 2002a. Equivalence between priority queues and sorting. In Proceedings of 43rd Symposium on the Foundations of Computer Science (FOCS). 125-134.
32. THORUP, M. 2002b. Randomized sorting in O(n log log n) time and linear space using addition, shift, and bit-wise boolean operations. J. Algorithms 42, 2, 205-230.
33. 0 implementations of fusion trees and atomic heaps. In Proceedings of 14th Symposium on the Foundations of Computer Science (SODA). 699-707.
34. VAN EMDE BOAS, P., KAAS, R., AND ZIJLSTRA, E. 1977. Design and implementation of an efficient priority queue. Mathemat. Syst. Theo. 10, 99-127.