Fast Meldable Priority Queues (1995)

by Gerth Stølting Brodal , Gerth Stlting Brodal
Citations:11 - 2 self

Documents Related by Co-Citation

73 Relaxed heaps: An alternative to Fibonacci heaps with applications to parallel computation – James R Driscoll, Harold N Gabow, Ruth Shrairman, Robert E Tarjan - 1988
31 Worst-Case Efficient Priority Queues – Gerth Stølting Brodal, Gerth St��lting Brodal - 1996
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
21 T.: Min-max heaps and generalized priority queues – Sack Atkinson, J R Santoro, N Strothotte - 1986
86 A data structure for manipulating priority queues – J Vuillemin - 1978
48 The pairing heap: A new form of self-adjusting heap – M L Fredman, R Sedgewick, D D Sleator, R E Tarjan - 1986
29 P.V.: An implicit binomial queue with constant insertion time – S Carlsson, J I Munro, Poblete - 1988
3 C.P.: Symmetric min-max heap: A simpler data structure for double-ended priority queue – A Arvind, Rangan - 1999
9 Double-Ended Binomial Queues – C M Khoong, H W Leong - 1993
46 Self adjusting heaps – D D Sleator, R E Tarjan - 1986
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
18 Meldable heaps and Boolean union-find – H Kaplan, N Shafrir, R E Tarjan - 2002
3 The deap - A double ended heap to implement double ended priority queues – S Carlsson - 1987
139 Randomized Search Trees – Raimund Seidel, Cecilia R. Aragon - 1996
12 Three priority queue applications revisited – A M Liao - 1992
23 Linear lists and priority queues as balanced binary trees – C A Crane - 1972
34 Funnel heap - a cache oblivious priority queue – Gerth Stølting Brodal, Rolf Fagerberg - 2002
3 A Note on Worst Case Efficient Meldable Priority Queues – Rolf Fagerberg - 1996
11 The DEAP–a double-ended heap to implement double-ended priorify queues – S Carlsson - 1987