@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 = {STOC},
year = {1999},
pages = {305-311},
ee = {http://doi.acm.org/10.1145/301250.301325},
crossref = {DBLP:conf/stoc/1999},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@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},
booktitle = {STOC},
publisher = {ACM},
year = {1999},
isbn = {1-58113-067-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}