BibTeX record conf/stoc/ChakrabartiCGL99

• > Home > conf/stoc/ChakrabartiCGL99

@inproceedings{DBLP:conf/stoc/ChakrabartiCGL99,
  author       = {Amit Chakrabarti and
                  Bernard Chazelle and
                  Benjamin Gum and
                  Alexey Lvov},
  editor       = {Jeffrey Scott Vitter and
                  Lawrence L. Larmore and
                  Frank Thomson Leighton},
  title        = {A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching
                  on the Hamming Cube},
  booktitle    = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
                  Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  pages        = {305--311},
  publisher    = {{ACM}},
  year         = {1999},
  url          = {https://doi.org/10.1145/301250.301325},
  doi          = {10.1145/301250.301325},
  timestamp    = {Tue, 06 Nov 2018 11:07:06 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/ChakrabartiCGL99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}