Amit Chakrabarti, Oded Regev. An optimal lower bound on the communication complexity of gap-hamming-distance. In Lance Fortnow, Salil P. Vadhan, editors, Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. pages 51-60, ACM, 2011. [doi]
Abstract is missing.