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

150 Algorithm 232: Heapsort – J W J Williams - 1964
13 Building heaps fast – C J H McDiarmid, B Reed - 1989
17 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
4 Cache oblivious data structures – D Ohashi - 2000
3962 Computer architecture: a quantitative approach, (3rd edition – J L Hennessy, D A Patterson - 2002
3 The worst case in shellsort and related algorithms – A Papernov, G Stasevich - 1965
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
3 QuickHeapsort, an efficient mix of classical sorting algorithms – D Cantone, G Cinotti
15 Radix Sorting & Searching – S Nilsson - 1996
8 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
9 An average case analysis of Floyd’s algorithm to construct heaps – E E Doberkat - 1984
20 Increasing the efficiency of quicksort – M H VanEmden - 1970
6 The Weak-Heap Data Structure – R D Dutton - 1992
8 Weak-heap sort – R D Dutton - 1993
58 The Art of Computer Programming - Vol III: Sorting and Searching – D E Knuth - 1973