A framework for speeding up priorityqueue operations (2004)

Cached

Download Links

by Amr Elmasry , Claus Jensen , Jyrki Katajainen
Citations:8 - 8 self

Documents Related by Co-Citation

11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
321 Introduction to Algorithms (2nd Edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
18 Meldable heaps and Boolean union-find – H Kaplan, N Shafrir, R E Tarjan - 2002
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
5 Two new methods for transforming priority queues into double-ended priority queues – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
12 New heap data structures – H Kaplan, R Tarjan - 1999
31 Worst-Case Efficient Priority Queues – Gerth Stølting Brodal, Gerth St��lting Brodal - 1996
10 Experiences with the design and implementation of space-efficient deques – Jyrki Katajainen, Bjarke Buur Mortensen - 2001
60 Data Structures and Algorithms in Java – M T GOODRICH, R TAMASSIA - 1998
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
21 Worst-case optimal insertion and deletion methods for decomposable searching problems – Mark H Overmars, Jan van Leeuwen - 1981
86 A data structure for manipulating priority queues – J Vuillemin - 1978
150 Algorithm 232: Heapsort – J W J Williams - 1964
4 Relaxed weak queues: an alternative to run-relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2005
2 Project proposal: A meldable, iterator-valid priority queue, CPH – Jyrki Katajainen - 2005
3 Putting your data structure on a diet, CPH – H Brönnimann, J Katajainen, P Morin - 2007
2 The cost of iterator validity – N Esbensen - 2006
2 Generic algorithm for 0/1-sorting, CPH – G Franceschini, J Katajainen - 2006
6 Layered heaps – Amr Elmasry - 2004