Lars Arge, Andrew Danner, Sha-Mayn Teh. I/O-efficient Point Location Using Persistent B-Trees. In Richard E. Ladner, editor, Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003. pages 82-92, SIAM, 2003.
@inproceedings{ArgeDT03,
title = {I/O-efficient Point Location Using Persistent B-Trees},
author = {Lars Arge and Andrew Danner and Sha-Mayn Teh},
year = {2003},
tags = {persistent},
researchr = {https://researchr.org/publication/ArgeDT03},
cites = {0},
citedby = {0},
pages = {82-92},
booktitle = {Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, MD, USA, January 11, 2003},
editor = {Richard E. Ladner},
publisher = {SIAM},
isbn = {0-89871-542-3},
}