Lower bounds for off-line range searching

Bernard Chazelle. Lower bounds for off-line range searching. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 733-740, ACM, 1995. [doi]

@inproceedings{Chazelle95,
  title = {Lower bounds for off-line range searching},
  author = {Bernard Chazelle},
  year = {1995},
  doi = {10.1145/225058.225291},
  url = {http://doi.acm.org/10.1145/225058.225291},
  researchr = {https://researchr.org/publication/Chazelle95},
  cites = {0},
  citedby = {0},
  pages = {733-740},
  booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
  publisher = {ACM},
}