Worst-case efficient priority queues

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129447, Issue , 1996, Pages 52-58

  Brodai, Gerth Stølting ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

PRIORITY QUEUES; SPACE REQUIREMENTS; WORST-CASE PERFORMANCE;

ALGORITHMS;

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

References (17)

1. Gerth Stølting Brodai. Fast meldable priority queues. In Proc. 4th Workshop on Algorithms and Data Structures (WADS), Volume 955 of Lecture Notes in Computer Science, pages 282-290. Springer Verlag, Berlin, 1995.
2. Svante Carlsson, Patricio V. Poblete, and J. Ian Munro. An implicit binomial queue with constant insertion time. In Proc. 1st Scandinavian Workshop on Algorithm Theory (SWAT), Volume 318 of Lecture Notes in Computer Science, pages 1-13. Springer Verlag, Berlin, 1988.
3. James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert E. Tarjan. Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation. Communications of the ACM, 31(11): 1343-1354, 1988.
4. Rolf Fagerberg. A generalization of binomial queues. Technical Report IMADA-94-35, Odense University, 1994. To appear in Information Processing Letters.
5. Robert W. Floyd. Algorithm 245: Treesort3. Communications of the ACM, 7(12):701, 1964.
6. Michael L. Fredman, Robert Sedgewick, Daniel D. Sleator, and Robert E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1:111-129, 1986.
7. Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. In Proc. 25rd Ann. Symp. on Foundations of Computer Science (FOCS), pages 338-346, 1984.
8. Leo J. Guibas, Edward M. McCreight, Michael F. Plass, and Janet R. Roberts. A new representation for linear lists. In Proc. 9th Ann. ACM Symp. on Theory of Computing (STOC), pages 49-60, 1977.
9. Haim Kaplan and Robert Tarjan. Persistent lists with catenation via recursive slow-down. In Proc. 27th Ann. ACM Symp. on Theory of Computing (STOC), pages 93-102, 1995.
10. Donald E. Knuth. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
11. Kurt Mehlhorn and Athanasios K. Tsakalidis. Data structures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. MIT Press/Elsevier, 1990.
12. Jorg-R. Sack and Thomas Strothotte. An algorithm for merging heaps. ACTA Informatica, 22:171-186, 1985.
13. Robert Endre Tarjan. Data Structures and Network Algortihms. Society for Industrial and Applied Matehmatics, Philadelphia, Pennsylvania, 1983.
14. Robert Endre Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6:306-318, 1985.
15. Jan van Leeuwen. The composition of fast priority queues. Technical Report RUU-CS-78-5, Department of Computer Science, University of Utrecht, 1978.
16. Jean Vuillemin. A data structure for manipulating priority queues. Communications of the ACM, 21(4):309-315, 1978.
17. J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7(6):347-348, 1964.