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

Active Bibliography

2 A Generalization of Binomial Queues – Rolf Fagerberg - 1996
7 Amortization Results for Chromatic Search Trees, with an Application to Priority Queues – Joan Boyar, Rolf Fagerberg, Kim S. Larsen - 1997
Strict Fibonacci Heaps – Gerth Stølting Brodal, George Lagogiannis, Robert E. Tarjan
2 Thin Heaps, Thick Heaps – Haim Kaplan, Robert E. Tarjan - 2006
5 Dynamic Optimality for Skip Lists and B-Trees – Prosenjit Bose, Karim Douïeb, Stefan Langerman - 2008
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
Rank-Pairing Heaps – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995
2 Discrete-Event Simulation on the Bulk-Synchronous Parallel Model – Mauricio Marin, St Cross College, Supervisor Prof, W. F. Mccoll - 1998
4 An Empirical Comparison of Priority Queue Algorithms – Mauricio Marín
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
3 On the Pending Event Set and Binary Tournaments – Mauricio Marín
13 B-Trees with Relaxed Balance – Kim S. Larsen, Rolf Fagerberg - 1993
1 Computational Biology – Rune B. Lyngsø, Rune B. Lyngs, Rune Bang Lyngs - 2000
26 Finding maximal pairs with bounded gap – Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye - 1999
Deletion Without Rebalancing in Multiway Search Trees – unknown authors
2 Relaxed Multi-Way Trees with Group Updates – Kim S. Larsen - 2000
5 Rank-Balanced Trees – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
5 Chromatic Priority Queues – Joan Boyar, Rolf Fagerberg, Kim S. Larsen - 1994