BibTeX record: conf/stoc/ChakrabartiCGL99

download as .bib file

@inproceedings{DBLP:conf/stoc/ChakrabartiCGL99,
  author    = {Amit Chakrabarti and
               Bernard Chazelle and
               Benjamin Gum and
               Alexey Lvov},
  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}},
  year      = {1999},
  pages     = {305--311},
  crossref  = {DBLP:conf/stoc/1999},
  url       = {http://doi.acm.org/10.1145/301250.301325},
  doi       = {10.1145/301250.301325},
  timestamp = {Thu, 02 Oct 2014 01:12:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/ChakrabartiCGL99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/1999,
  editor    = {Jeffrey Scott Vitter and
               Lawrence L. Larmore and
               Frank Thomson Leighton},
  title     = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
               Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
  year      = {1999},
  publisher = {{ACM}},
  isbn      = {1-58113-067-8},
  timestamp = {Thu, 02 Oct 2014 01:12:10 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/stoc/1999},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}