Joshua Brody, Amit Chakrabarti. A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009. pages 358-368, IEEE Computer Society, 2009. [doi]
@inproceedings{BrodyC09,
title = {A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences},
author = {Joshua Brody and Amit Chakrabarti},
year = {2009},
doi = {10.1109/CCC.2009.31},
url = {http://doi.ieeecomputersociety.org/10.1109/CCC.2009.31},
researchr = {https://researchr.org/publication/BrodyC09},
cites = {0},
citedby = {0},
pages = {358-368},
booktitle = {Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-3717-7},
}