Worst-Case Efficient Priority Queues (1996)

Cached

Download Links

by Gerth Stølting Brodal , Gerth St��lting Brodal
Venue:In Proc. 7th ACM-SIAM Symposium on Discrete Algorithms
Citations:31 - 3 self

Documents Related by Co-Citation

75 Tarjan, “Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation – J R Driscoll, H N Gabow, R Shrairman, R E - 1988
577 Fibonacci heaps and their uses in improved network optimization problems – M L Fredman, R E Tarjan - 1987
18 Meldable heaps and Boolean union-find – H Kaplan, N Shafrir, R E Tarjan - 2002
1444 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
86 A data structure for manipulating priority queues – J Vuillemin - 1978
319 Introduction to Algorithms, 2 nd edition – T H Cormen, C E Leiserson, R L Rivest - 2001
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995
29 P.V.: An implicit binomial queue with constant insertion time – S Carlsson, J I Munro, Poblete - 1988
12 New heap data structures – H Kaplan, R Tarjan - 1999
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
16 A programming and problem-solving seminar – M J Clancy, D E Knuth - 1977
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
4 Relaxed weak queues: an alternative to run-relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2005
70 On RAM priority queues – Mikkel Thorup - 1996
142 Shortest Paths Algorithms: Theory And Experimental Evaluation – Boris Cherkassky, Andrew V. Goldberg, Tomasz Radzik - 1993
103 Faster algorithms for the shortest path problem – Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin, Robert E. Tarjan - 1990
200 E.: Design and implementation of an efficient priority queue – van Emde Boas, P Kaas, R Zijlstra - 1977
603 Data Structures and Networks Algorithms – R E Tarjan - 1983
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996