Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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]
Possibly Related PublicationsThe following publications are possibly variants of this publication: An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-DistanceAmit Chakrabarti, Oded Regev. eccc, 17:140, 2010. [doi] An optimal lower bound on the communication complexity of gap-hamming-distanceAmit Chakrabarti, Oded Regev. stoc 2011: 51-60 [doi]
The following publications are possibly variants of this publication: