A Generalization of Binomial Queues (1996)

Cached

Download Links

by Rolf Fagerberg
Venue:Information Processing Letters
Citations:2 - 0 self

Documents Related by Co-Citation

3 The relaxed min-max heap – Yuzheng Ding, Mark Allen Weiss - 1993
21 T.: Min-max heaps and generalized priority queues – Sack Atkinson, J R Santoro, N Strothotte - 1986
3 Data-structural Bootstrapping and Catenable Deques – A L Buchsbaum - 1993
3 A Note on Worst Case Efficient Meldable Priority Queues – Rolf Fagerberg - 1996
12 Multidimensional binary search in database applications – J L Bentley - 1979
9 Double-Ended Binomial Queues – C M Khoong, H W Leong - 1993
11 The DEAP–a double-ended heap to implement double-ended priorify queues – S Carlsson - 1987
19 Algorithm 232 – J W J Williams - 1964
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
10 Theory of 2-3 Heaps – Tadao Takaoka - 1999
6 Theory of trinomial heaps – T Takaoka - 2000
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
86 A data structure for manipulating priority queues – J Vuillemin - 1978
145 Data Structures and Algorithms 1: Sorting and Searching – K Mehlhorn - 1984
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
31 Worst-Case Efficient Priority Queues – Gerth Stølting Brodal, Gerth St��lting Brodal - 1996
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995
3 C.P.: Symmetric min-max heap: A simpler data structure for double-ended priority queue – A Arvind, Rangan - 1999
1 Robert Endre Tarjan. Fully persistent lists with catenation – James R Driscoll, Daniel D K Sleator - 1991