On sorting, heaps, and minimum spanning trees

by Gonzalo Navarro , Rodrigo Paredes
Venue:Algorithmica
Citations:1 - 1 self

Documents Related by Co-Citation

4 Introspective sorting and selection revisited – J Valois
1 Adatastructurefor manipulatingpriorityqueues.Comm – J Vuillemin - 1978
46 Fast Priority Queues for Cached Memory – Peter Sanders - 1999
22 Randomized Binary Search Trees – Conrado Martínez, Salvador Roura - 1997
46 Self adjusting heaps – D D Sleator, R E Tarjan - 1986
35 Algorithm 65: Find – C A R Hoare - 1961
19 General balanced trees – Arne Andersson - 1999
48 The pairing heap: A new form of self-adjusting heap – M L Fredman, R Sedgewick, D D Sleator, R E Tarjan - 1986
8557 R.: Introduction to Algorithms – T Cormen, C Leiserson, Rivest - 1990
534 Shortest connection networks and some generalizations – R Prim - 1957
579 Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms – M Fredman, R Tarjan - 1987
731 Amortized Efficiency of List Update and Paging Rules – D D Sleator, R E Tarjan - 1985
369 Time bounds for selection – Manuel Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert, E. Tarjan - 1973
150 Algorithm 232: Heapsort – J W J Williams - 1964
203 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977
40 On the limits of cache-obliviousness – Gerth Stølting Brodal, Rolf Fagerberg - 2003
39 Introspective Sorting and Selection Algorithms – David Musser - 1997
26 a new variant of heapsort beating, on an average, quicksort (if n is not very small – Bottom-up-heapsort - 1993