Gianni Franceschini, Roberto Grossi. Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Michiel H. M. Smid, editors, Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings. Volume 2748 of Lecture Notes in Computer Science, pages 114-126, Springer, 2003. [doi]
@inproceedings{FranceschiniG03:2,
title = {Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees},
author = {Gianni Franceschini and Roberto Grossi},
year = {2003},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2748&spage=114},
tags = {caching, search},
researchr = {https://researchr.org/publication/FranceschiniG03%3A2},
cites = {0},
citedby = {0},
pages = {114-126},
booktitle = {Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings},
editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Michiel H. M. Smid},
volume = {2748},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-40545-3},
}