Amit Chakrabarti, Oded Regev. An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance. SIAM Journal on Computing, 41(5):1299-1317, 2012. [doi]
@article{ChakrabartiR12,
title = {An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance},
author = {Amit Chakrabarti and Oded Regev},
year = {2012},
doi = {10.1137/120861072},
url = {http://dx.doi.org/10.1137/120861072},
researchr = {https://researchr.org/publication/ChakrabartiR12},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {41},
number = {5},
pages = {1299-1317},
}