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

571 Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms – M L Fredman, R E - 1987
73 Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation – J R Driscoll, H N Gabow, R Shrairman, R E Tarjan - 1988
18 Meldable heaps and Boolean union-find – H Kaplan, N Shafrir, R E Tarjan - 2002
1421 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
318 Introduction to Algorithms (2nd edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
86 A data structure for manipulating priority queues – J Vuillemin - 1978
29 P.V.: An implicit binomial queue with constant insertion time – S Carlsson, J I Munro, Poblete - 1988
16 A programming and problem-solving seminar – M J Clancy, D E Knuth - 1977
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
12 New heap data structures – H Kaplan, R Tarjan - 1999
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995
150 Algorithm 232 (Heap Sort – J Williams - 1964
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
18 Optimal Purely Functional Priority Queues – Gerth Stølting Brodal, Chris Okasaki - 1996
199 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977