You are here:
» Cache-Aware and Cache-Oblivious Adaptive Sorting
About Aarhus University
Cache-Aware and Cache-Oblivious Adaptive Sorting
Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
- Gerth Stølting Brodal
- Rolf Fagerberg, University of Southern Denmark, Denmark
- Gabriel Moruz, Denmark
- Department of Computer Science
Two new adaptive sorting algorithms are introduced which perform an optimal number of comparisons with respect to the number of inversions in the input. The first algorithm is based on a new linear time reduction to (non-adaptive) sorting. The second algorithm is based on a new division protocol for the GenericSort algorithm by Estivill-Castro and Wood. From both algorithms we derive I/O-optimal cache-aware and cache-oblivious adaptive sorting algorithms. These are the first I/O-optimal adaptive sorting algorithms.
| Original language | English |
|---|---|
| Title of host publication | Automata, Languages and Programming : 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings |
| Editors | Luis Caires, Guseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung |
| Number of pages | 13 |
| Publisher | Springer |
| Publication year | 2005 |
| Pages | 576-588 |
| ISBN (print) | 3-540-27580-0 |
| DOIs | |
| Publication status | Published - 2005 |
| Event | International Colloquium on Automata, Languages and Programming - Lissabon, Portugal Duration: 11 Jul 2005 → 15 Jul 2005 Conference number: 32 |
Conference
| Conference | International Colloquium on Automata, Languages and Programming |
|---|---|
| Nummer | 32 |
| Land | Portugal |
| By | Lissabon |
| Periode | 11/07/2005 → 15/07/2005 |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 3580 |
| ISSN | 0302-9743 |
See relations at Aarhus University Citationformats
ID: 230300