Performance Engineering Case Study: Heap Construction (1999)


Download Links

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

Active Bibliography

1 On sorting, heaps, and minimum spanning trees – Gonzalo Navarro, Rodrigo Paredes
Fast Exchange Sorts – Nachum Dershowitz, Hon-wai Leong
3 Interval Heaps – D. Wood, Vakgreep Informatica, Budapestlean Cd H, J. Van Leeuwen, J. Van Leeuwen - 1987
-William Shakespeare – Bruce Weide
Multiway Blockwise In-place Merging – Viliam Geffert
4 The Ultimate Heapsort – Jyrki Katajainen - 1998
Additional Key Words and Phrases: Sorting in-place – Gianni Franceschini
10 Practical In-Place Mergesort – Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola - 1996
9 An In-Place Sorting with O(n log n) Comparisons and O(n) Moves – Gianni Franceschini, Viliam Geffert - 2003
unknown title – R. Fadel, K. V. Jakobsen, J. Katajainen, J. Teuhola Heaps
Quickheaps: Simple, Efficient, and Cache-Oblivious ⋆ – Gonzalo Navarro, Rodrigo Paredes
I/O-Efficient Computation of Water Flow Across a Terrain – Lars Arge, Morten Revsbæk, Norbert Zeh
2 External Memory Geometric Data Structures, Handbook of Massive Data Sets – Lars Arge - 2002
4 The limits of buffering: A tight lower bound for dynamic membership in the external memory model – Elad Verbin - 2010
37 Worst-Case Efficient External-Memory Priority Queues – Gerth Stølting Brodal, Jyrki Katajainen - 1998
15 An Experimental Study of Priority Queues in External Memory – Klaus Brengel, et al.
5 An Optimal Cache-Oblivious Priority Queue and its Application to Graph Algorithms – Lars Arge, Michael A. Bender, Erik D. Demaine, Bryan Holland-Minkley, J. Ian Munro - 2007
3 On the Cell Probe Complexity of Dynamic Membership – Ke Yi, Qin Zhang
6 Dynamic external hashing: The limit of buffering – Zhewei Wei, Ke Yi, Qin Zhang - 2009