Lars Arge. The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract). In Selim G. Akl, Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, 4th International Workshop, WADS 95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings. Volume 955 of Lecture Notes in Computer Science, pages 334-345, Springer, 1995.
@inproceedings{Arge95:0,
title = {The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)},
author = {Lars Arge},
year = {1995},
researchr = {https://researchr.org/publication/Arge95%3A0},
cites = {0},
citedby = {0},
pages = {334-345},
booktitle = {Algorithms and Data Structures, 4th International Workshop, WADS 95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
editor = {Selim G. Akl and Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro},
volume = {955},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-60220-8},
}