A General Technique for Implementation of Efficient Priority Queues (1994)

Cached

Download Links

by Peter Høyer
Venue:In Proc. 3rd Israel Symposium on Theory of Computing and Systems
Citations:9 - 0 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
86 A data structure for manipulating priority queues – J Vuillemin - 1978
31 Worst-Case Efficient Priority Queues – Gerth Stølting Brodal, Gerth St��lting Brodal - 1996
10 Theory of 2-3 Heaps – Tadao Takaoka - 1999
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
12 New heap data structures – H Kaplan, R Tarjan - 1999
14 On the efficiency of pairing heaps and related data structures – M L Fredman - 1999
12 A balanced tree scheme for meldable heaps with updates – G L PETERSON - 1987
10 Towards a Final Analysis of Pairing Heaps – Seth Pettie - 2005
21 T.: Min-max heaps and generalized priority queues – Sack Atkinson, J R Santoro, N Strothotte - 1986
1444 A Note on Two Problems in Connexion with Graphs – E. W. Dijkstra - 1959
29 P.V.: An implicit binomial queue with constant insertion time – S Carlsson, J I Munro, Poblete - 1988
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995
5 Pairing heaps with O(log log n) decrease cost – Amr Elmasry - 2009
35 FREDMAN AND ROBERT ENDRE TARJAN: Fibonacci heaps and their uses in improved network optimization algorithms – L MICHAEL - 1987
31 Pairing heaps: Experiments and analysis – J T Stasko, Jeffrey S Vitter - 1987
6 Theory of trinomial heaps – T Takaoka - 2000
48 The pairing heap: A new form of self-adjusting heap – M L Fredman, R Sedgewick, D D Sleator, R E Tarjan - 1986