A model for hierarchical memory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Searching a two key table under a single key
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Simplified stable merging tasks
Journal of Algorithms
The input/output complexity of sorting and related problems
Communications of the ACM
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Sorting with minimum data movement
Journal of Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
In-place sorting with fewer moves
Information Processing Letters
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Implicit B-Trees: New Results for the Dictionary Problem
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient Tree Layout in a Multilevel Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
On the limits of cache-obliviousness
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Optimal cache-oblivious implicit dictionaries
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Engineering a cache-oblivious sorting algorithm
Journal of Experimental Algorithmics (JEA)
Masking patterns in sequences: A new class of motif discovery with don't cares
Theoretical Computer Science
Low depth cache-oblivious algorithms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Optimal in-place sorting of vectors and records
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
An algorithm performs its operations in-place if it uses O(1) extra locations of main memory besides those containing the input entries. An algorithm is cache-oblivious if it is not conscious of any parameter of the memory hierarchy (M, the size of cache memory, and B, the size of the minimal contiguous block of information that can be transferred between the cache and the main memory). Hence, it cannot directly exploit these parameters to reach the optimality. In the cache-oblivious model the complexity is measured with two criteria: the work complexity, which is the standard complexity in the RAM model, and the cache complexity, which is the total number of block transfers (cache misses) incurred during the computation.The contribution of this paper is twofold. We present the first sorting algorithm that is optimal in both work and cache complexity in the cache-oblivious model and that operates in-place. Furthermore, we introduce a new approach to the sorting problem in the cache-oblivious model.