|
7324
|
Cache-oblivious algorithms
– M FRIGO, C E LEISERSON, H PROKOP, S RAMACHANDRAN
- 1999
|
|
494
|
The input/output complexity of sorting and related problems. Commun
– A AGGARWAL, J S VITTER
- 1988
|
|
286
|
External Memory Algorithms and Data Structures
– Jeffrey Scott Vitter
- 1998
|
|
61
|
Cache Oblivious Search Trees via Binary Trees of Small Height
– Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Rolf Fagerberg Riko Jacob
- 2002
|
|
37
|
Cache oblivious distribution sweeping
– Gerth Stølting Brodal, Rolf Fagerberg
- 2002
|
|
121
|
A model for hierarchical memory
– A Aggarwal, B Alpern, A K Chandra, M Snir
- 1987
|
|
56
|
Cache-oblivious priority queue and graph algorithm applications
– Lars Arge, Bryan Holland-minkley, Michael A. Bender, J. Ian Munro, Erik D. Demaine
- 2002
|
|
30
|
Funnel heap - a cache oblivious priority queue
– Gerth Stølting Brodal, Rolf Fagerberg
- 2002
|
|
105
|
Hierarchical memory with block transfer
– A Aggarwal, A K Chandra, M Snir
- 1987
|
|
11
|
Cache oblivious algorithms
– Piyush Kumar
- 2003
|
|
99
|
Emde Boas. Preserving order in a forest in less than logarithmic time and linear
– P van
- 1977
|
|
119
|
Cache-oblivious B-trees
– Michael A. Bender, Erik D. Demaine, Martin Farach-colton
- 2000
|
|
65
|
A Locality-Preserving Cache-Oblivious Dynamic Dictionary
– Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu
- 2002
|
|
7
|
Cache oblivious algorithms
– H Prokop
- 1999
|
|
29
|
New Algorithms for the Disk Scheduling Problem
– Matthew Andrews, Michael A. Bender, Lisa Zhang
- 1996
|
|
15
|
A Theoretical Framework for Memory-Adaptive Algorithms
– Rakesh D. Barve, Jeffrey Scott Vitter
- 1999
|
|
29
|
Scanning and traversing: maintaining data for traversals in a memory hierarchy
– Michael A. Bender, Richard Cole, Erik D. Demaine
- 2002
|
|
10
|
I/O-Efficient Construction of Voronoi Diagrams
– Piyush Kumar, Edgar A. Ramos
- 2002
|
|
20
|
Exponential structures for cache-oblivious algorithms
– M Bender, R Cole, R Raman
- 2002
|
