R. Fagerberg. A generalization of binomial queues. Information Processing Letters, 57:109-114, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bootstrapping One-sided Flexible Arrays - Hinze (2002) (Correct)
....(the offsprings of the nodes on the right spine form a sequence of complete leaf trees) A detailed comparison of these tree structures can be found in [9] Number systems serve admirably as templates for data structures. Various examples of this cross fertilization can be found in the literature [21, 6, 16, 8]. To the best of the author s knowledge the use of mixed radix number systems is original. Radically different implementations are available for rigid arrays that cannot grow or shrink. Version tree arrays [10, 1] are a blend of association lists and real arrays: the initial version is ....
R. Fagerberg. A generalization of binomial queues. Information Processing Letters, 57(2):109--114, 1996.
Worst Case Efficient Data Structures - Brodal (1997) (Correct)
....we give in Chapter 5 and 6 are no exception. The most prominent implementations are binomial queues [24, 108] heap ordered (2; 3) trees [1] self adjusting heaps [99] pairing heaps [52] Fibonacci heaps [53] and relaxed heaps [43] Further priority queue implementations can be found in [27, 46, 47, 63, 71, 97, 107]. The best amortized performance achieved by the data structures mentioned above is achieved by binomial queues and Fibonacci heaps. Binomial queues support all operations except Delete, DeleteMin and DecreaseKey in amortized constant time, and Delete, DeleteMin and DecreaseKey in amortized time ....
....are achieved by relaxed heaps. Relaxed heaps achieve worst case constant time for all operations except for Delete, DeleteMin and Meld which require worst case time O(log n) The first nontrivial priority queue implementation supporting Meld in worst case time o(log n) was presented by Fagerberg [46]. The cost of achieving this sublogarithmic melding is that the time required for DeleteMin increases to (log n) In Chapters 5 and 6 we present the first priority queue implementations that simultaneously support Meld in worst case constant time and DeleteMin in worst case time O(log n) This ....
[Article contains additional citation context not shown here]
Rolf Fagerberg. A generalization of binomial queues. Information Processing Letters, 57:109-- 114, 1996.
Reflected Min-Max Heaps - Christos Makris Athanasios (Correct)
No context found.
R. Fagerberg. A generalization of binomial queues. Information Processing Letters, 57:109-114, 1996.
Priority Queues on Parallel Machines - Brodal (1996) (Correct)
No context found.
Rolf Fagerberg. A generalization of binomial queues. Information Processing Letters, 57:109-114, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC