Relaxed weak queues: an alternative to run-relaxed heaps (2005)

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

Documents Related by Co-Citation

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 – J R Driscoll, H N Gabow, R Shrairman, R E Tarjan - 1988
31 Worst-Case Efficient Priority Queues – Gerth Stølting Brodal, Gerth St��lting Brodal - 1996
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
8 A framework for speeding up priorityqueue operations – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2004
318 Introduction to Algorithms (2nd edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
3 Sorting and Searching, The Art of Computer Programming 3, 2nd Edition – D E Knuth - 1998
11 Fast Meldable Priority Queues – Gerth Stølting Brodal, Gerth Stlting Brodal - 1995
12 New heap data structures – H Kaplan, R Tarjan - 1999
5 The relaxed min-max heap --- A mergeable doubleended priority queue – Yuzheng Ding, Mark Allen Weiss - 1993
3 The complexity of implicit and space-efficient priority queues – Christian W. Mortensen, Seth Pettie
29 P.V.: An implicit binomial queue with constant insertion time – S Carlsson, J I Munro, Poblete - 1988
4 An algorithm for merging heaps – J-R Sack, Th Strothotte - 1985
2 Putting your data structure on a diet – Hervé Brönnimann, Jyrki Katajainen, Pat Morin - 2007
2 Alternatives to two classic data structures – C Okasaki - 2005
7 A characterization of heaps and its applications – J-R Sack, T Strothotte - 1990
10 Weight Biased Leftist Trees and Modified Skip Lists – S. Cho, S. Sahni, Seonghun Cho, Sartaj Sahni - 1996
2 An experimental evaluation of navigation piles – Claus Jensen, Jyrki Katajainen - 2006
86 A data structure for manipulating priority queues – J Vuillemin - 1978