Skewed binary search trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 708-719

  Brodal, Gerth Stølting ^a   Moruz, Gabriel ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

CACHE MEMORY; COMPUTER SCIENCE; DATA STRUCTURES; PROBABILITY; SUPERVISORY AND EXECUTIVE PROGRAMS;

BINARY SEARCH TREE; CACHE FAULTS; MEMORY LAYOUTS; RUNNING TIME;

TREES (MATHEMATICS);

EID: 33750691356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_63     Document Type: Conference Paper

References (17)

1. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31 (9): 1116-1127, 1988.
2. S. Alstrup, M. A. Bender, E. D. Demaine, M. Farach-Colton, J. I. Munro, T. Rauhe, and M. Thorup. Efficient tree layout in a multilevel memory hierarchy. Manuscript, 2003.
3. L. Arge. External memory data structures. In J. Abello, P. M. Pardalos, and M. G. C. Resende, editors, Handbook of Massive Data Sets, pages 313-358. Kluwer Academic Publishers, 2002.
4. L. Arge, G. S. Brodal, and R. Fagerberg. Cache-oblivious data structures, In D. Mehta and S. Sahni, editors, Handbook of Data Structures and Applications, page 27. CRC Press, 2004.
5. R. Bayer and E. M. McCreight. Organization and maintenance of large ordered indices. Acta Informatica, 1:173-189, 1972.
6. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious B-trees. In Proc. 41st Annual Symposium on Foundations of Computer Science, pages 399-409, 2000.
7. M. A. Bender, Z. Duan, J. Iacono, and J. Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual ACM-SIAM symposium on Discrete algorithms, pages 29-38, 2002.
8. G. S. Brodai. Cache-oblivious algorithms and data structures. In Proc. 9th Scandinavian Workshop on Algorithm Theory, volume 3111 of Lecture Notes in Computer Science, pages 3-13. Springer Verlag, Berlin, 2004.
9. G. S. Brodai, R. Fagerberg, and R. Jacob. Cache-oblivious search trees via binary trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002.
10. G. S. Brodai, R. Fagerberg, and G. Moruz. On the adaptiveness of quicksort. In Proc. 7th Workshop on Algorithm Engineering and Experiments, pages 130-140, 2005.
11. G. S. Brodai and G. Moruz. Tradeoffs between branch mispredictions and comparisons for sorting algorithms. In Proc. 9th International Workshop on Algorithms and Data Structures, volume 3608 of Lecture Notes in Computer Science, pages 385-395. Springer Verlag, Berlin, 2005.
12. E. D. Demaine, J. Iacono, and S. Langerman. Worst-case optimal tree layout in a memory hierarchy. Manuscript, August 2004.
13. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache oblivious algorithms. In 40th Annual IEEE Symposium on Foundations of Computer Science, pages 285-298, 1999.
14. J. Gil and A. Itai. How to pack trees. Journal of Algorithms, 32(2):108-132, 1999.
15. J. Nievergelt and E. M. Reingold. Binary search trees of bounded balance. In Proc. 4th Annual ACM Symposium on Theory of Computing, pages 137-142, 1972.
16. P. Sanders and S. Winkel. Super scalar sample sort. In Proc. 12th European Symposium on Algorithms, volume 3221 of Lecture Notes in Computer Science, pages 784-796. Springer Verlag, Berlin, 2004.
17. J. S. Vitter. External memory algorithms and data structures: Dealing with massive data. ACM Computing Surveys, 33(2):209-271, 2001.