Bernard Chazelle, Burton Rosenberg. Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. In Werner Kuich, editor, Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings. Volume 623 of Lecture Notes in Computer Science, pages 439-449, Springer, 1992.
@inproceedings{ChazelleR92,
title = {Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine},
author = {Bernard Chazelle and Burton Rosenberg},
year = {1992},
researchr = {https://researchr.org/publication/ChazelleR92},
cites = {0},
citedby = {0},
pages = {439-449},
booktitle = {Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
editor = {Werner Kuich},
volume = {623},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-55719-9},
}