An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching

Amit Chakrabarti, Oded Regev. An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching. SIAM Journal on Computing, 39(5):1919-1940, 2010. [doi]

@article{ChakrabartiR10-1,
  title = {An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching},
  author = {Amit Chakrabarti and Oded Regev},
  year = {2010},
  doi = {10.1137/080729955},
  url = {http://dx.doi.org/10.1137/080729955},
  researchr = {https://researchr.org/publication/ChakrabartiR10-1},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {39},
  number = {5},
  pages = {1919-1940},
}