%0 Conference Paper %1 conf/stoc/ChakrabartiR11 %A Chakrabarti, Amit %A Regev, Oded %B STOC %D 2011 %E Fortnow, Lance %E Vadhan, Salil P. %I ACM %K dblp %P 51-60 %T An optimal lower bound on the communication complexity of gap-hamming-distance. %U http://dblp.uni-trier.de/db/conf/stoc/stoc2011.html#ChakrabartiR11 %@ 978-1-4503-0691-1

@inproceedings{conf/stoc/ChakrabartiR11, added-at = {2018-11-06T00:00:00.000+0100}, author = {Chakrabarti, Amit and Regev, Oded}, biburl = {https://www.bibsonomy.org/bibtex/2cee09134da6b022e7beda3f8fcc203d4/dblp}, booktitle = {STOC}, crossref = {conf/stoc/2011}, editor = {Fortnow, Lance and Vadhan, Salil P.}, ee = {https://doi.org/10.1145/1993636.1993644}, interhash = {472a1d333930ae961b15ef1d2a6c15c0}, intrahash = {cee09134da6b022e7beda3f8fcc203d4}, isbn = {978-1-4503-0691-1}, keywords = {dblp}, pages = {51-60}, publisher = {ACM}, timestamp = {2018-11-07T16:08:09.000+0100}, title = {An optimal lower bound on the communication complexity of gap-hamming-distance.}, url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2011.html#ChakrabartiR11}, year = 2011 }