Rolf Fagerberg Department of Mathematics and Computer Science Odense...  Home/Search
Context Related
| imada.sdu.dk/pub/papers/pp1...35.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: leekillough.com/heaps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a generalization of binomial queues, the definition of which involves a freely chosen sequence (m k ) k=0;1;2;::: of integers greater than one. Different sequences lead to different worst case bounds for the priority queue operations, allowing the user to adapt the data structure to the needs of a specific application. Examples include the first priority queue to combine a sub-logarithmic worst case bound for Meld with a sub-linear worst case bound for Delete min. (Update)
Similar documents based on text: More All
0.6: A Generalization of Binomial Queues - Fagerberg (1996) (Correct)
0.4: B-Trees with Relaxed Balance - Larsen, Fagerberg (1993) (Correct)
0.3: Cover Page - Methodology For Diagnostic (Correct)
BibTeX entry: (Update)
Rolf Fagerberg. A generalization of binomial queues. Information Processing Letters, 57:109-- 114, 1996. http://citeseer.ist.psu.edu/fagerberg94generalization.html More
@article{ fagerberg96generalization,
author = "Rolf Fagerberg",
title = "A Generalization of Binomial Queues",
journal = "Information Processing Letters",
volume = "57",
number = "2",
pages = "109-114",
year = "1996",
url = "citeseer.ist.psu.edu/fagerberg94generalization.html" }
Citations (may not include all citations):353 Fibonacci heaps and their uses in improved network optimizat.. (context) - Fredman, Tarjan - 1984
328 Real and Complex Analysis (context) - Rudin - 1987
105 volume 1 of The Art of Computer Programming (context) - Knuth - 1973
97 Shortest paths algorithms: Theory and experimental evaluatio.. - Cherkassky, Goldberg et al. - 1994
71 A data structure for manipulating priority queues (context) - Vuillemin - 1978
62 An empirical comparison of priority-queue and event-set impl.. (context) - Jones - 1986
53 Relaxed heaps: An alternative to Fibonacci heaps with applic.. (context) - Driscoll, Gabow et al. - 1988
49 The pairing heap: A new form of self-adjusting heap (context) - Fredman, Sedgewick et al. - 1986
42 Algorithm 232: Heapsort (context) - Williams - 1964
27 Implementation and analysis of binomial queue algorithms (context) - Brown - 1978
18 An implicit binomial queue with constant insertion time (context) - Carlsson, Munro et al. - 1988
15 Three priority queue applications revisited (context) - Liao - 1992
10 A general technique for implementation of efficient priority.. - Hyer - 1994
9 An empirical analysis of algorithms for constructing a minim.. - Moret, Shapiro - 1991
9 Double-ended binomial queues (context) - Khoong, Leong - 1993
[Article contains additional citations not shown here]
Documents on the same site (http://www.leekillough.com/heaps/): More
A Survey on Parallel Algorithms for Priority Queue Operations - Yu (Correct)
Data Structural Bootstrapping, Linear Path Compression.. - Buchsbaum, Sundar.. (1992) (Correct)
Chromatic Priority Queues - Boyar, Fagerberg, Larsen (1994) (Correct)
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