Performance Engineering Case Study: Heap Construction (1999)

Cached

Download Links

by Jesper Bojesen , Jyrki Katajainen , Maz Spork
Venue:WAE, LNCS
Citations:7 - 3 self

Documents Related by Co-Citation

140 Algorithm 232: heapsort – J Williams - 1964
12 Building Heaps Fast – C J H McDiarmid, B A Reed - 1989
15 Priority queues with update and finding minimum spanning trees – D B Johnson - 1975
7 The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1:1n – I Wegener - 1992
3 The worst case in shellsort and related algorithms – A Papernov, G Stasevich - 1965
6 Sorting in-place with a worst case complexity of n log n --- 1:3n + O(log n) comparisons and ffln log n +O(1) transports – Klaus Reinhardt - 1992
3 One hundred problems in elemantary mathematics �Problems 52,85 – H Steinhaus - 1958
5 Increasing the e�ciency of QUICKSORT – M H van Emden - 1970
2 QuickHeapsort, an e�cient mix of classical sorting algorithms – D Cantone, G Cinotti
2 On the performance – S Edelkamp, I Wegener - 2000
2 an efficient mix of classical sorting algorithms – D Cantone, G Cincotti
6 The weak-heap data structure – R D DUTTON - 1992
7 Weak-heap sort – R Dutton - 1993
15 Radix Sorting & Searching – S Nilsson - 1996
8 An Average Case Analysis of Floyd’s Algorithm to Construct Heaps – E E Doberkat - 1984
51 The Art of Computer Programming. Vol. III: Sorting and Searching – D E Knuth - 1973
19 Increasing the efficiency of quicksort – M H van Emden - 1970
493 Fibonacci heaps and their uses in improved network optimization algorithms – M L Fredman, R E Tarjan - 1987
13 A Variant of Heapsort with Almost Optimal Number of Comparisons – S Carlsson - 1987