Thin Heaps, Thick Heaps (2006)

by Haim Kaplan , Robert E. Tarjan
Citations:2 - 1 self

Documents Related by Co-Citation

12 New heap data structures – H Kaplan, R Tarjan - 1999
31 Pairing heaps: Experiments and analysis – J T Stasko, Jeffrey S Vitter - 1987
9 A General Technique for Implementation of Efficient Priority Queues – Peter Høyer - 1994
14 On the efficiency of pairing heaps and related data structures – M L Fredman - 1999
10 Theory of 2-3 Heaps – Tadao Takaoka - 1999
12 A balanced tree scheme for meldable heaps with updates – G L PETERSON - 1987
11 Two-tier relaxed heaps – Amr Elmasry, Claus Jensen, Jyrki Katajainen - 2006
5 Pairing heaps with O(log log n) decrease cost – Amr Elmasry - 2009
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
86 A data structure for manipulating priority queues – J Vuillemin - 1978
10 Towards a Final Analysis of Pairing Heaps – Seth Pettie - 2005
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
20 The pairing heap: a new form of self adjusting heap, Algorithmica 1(1 – M Fredman, R Sedgewick, D Sleator, R Tarjan - 1986
4 Worst-case priority queues – G Brodal - 1996
1 Layered heaps, 9th Scandinavian Workshop on Algorithm Theory – A Elmasry - 2004
40 An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree – Bernard M. E. Moret, Henry D. Shapiro - 1994
321 Introduction to Algorithms (2nd Edition – T H Cormen, C E Leiserson, R L Rivest, C Stein - 2001
3 AND ROBERT ENDRE TARJAN, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs – HAROLD N GABOW, ZVI GALIL, THOMAS H SPENCER - 1986
1 The Fifth DIMACS Challenge—Priority Queue Tests – VARIOUS - 1996