|
1
|
On sorting, heaps, and minimum spanning trees
– Gonzalo Navarro, Rodrigo Paredes
|
|
|
Fast Exchange Sorts
– Nachum Dershowitz, Hon-wai Leong
|
|
2
|
Interval Heaps
– D. Wood, Vakgreep Informatica, Budapestlean Cd H, J. Van Leeuwen, J. Van Leeuwen
- 1987
|
|
|
Multiway Blockwise In-place Merging
– Viliam Geffert
|
|
8
|
Practical In-Place Mergesort
– Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola
- 1996
|
|
4
|
The Ultimate Heapsort
– Jyrki Katajainen
- 1998
|
|
|
unknown title
– R. Fadel, K. V. Jakobsen, J. Katajainen, J. Teuhola Heaps
|
|
1
|
External Memory Geometric Data Structures
– Lars Arge
- 2005
|
|
|
Quickheaps: Simple, Efficient, and Cache-Oblivious ⋆
– Gonzalo Navarro, Rodrigo Paredes
|
|
|
DynamicExternalHashing:TheLimitofBuffering ∗
– Zheweiwei Keyi Qinzhang
|
|
14
|
An Experimental Study of Priority Queues in External Memory
– Klaus Brengel, et al.
|
|
|
I/O-Efficient Computation of Water Flow Across a Terrain
– Lars Arge, Morten Revsbæk, Norbert Zeh
|
|
5
|
The limits of buffering: A tight lower bound for dynamic membership in the external memory model
– Elad Verbin
- 2010
|
|
2
|
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
|
|
35
|
Worst-Case Efficient External-Memory Priority Queues
– Gerth Stølting Brodal, Jyrki Katajainen
- 1998
|
|
78
|
External Memory Data Structures
– Lars Arge
- 2001
|
|
56
|
Cache-oblivious priority queue and graph algorithm applications
– Lars Arge, Bryan Holland-minkley, Michael A. Bender, J. Ian Munro, Erik D. Demaine
- 2002
|
