The One-Way Communication Complexity of Hamming Distance. Jayram, T. S., Kumar, R., & Sivakumar, D. Theory of Computing, 4(1):129-135, 2008.
The One-Way Communication Complexity of Hamming Distance. [link]Link  The One-Way Communication Complexity of Hamming Distance. [link]Paper  bibtex   
@article{journals/toc/JayramKS08,
  added-at = {2019-05-14T00:00:00.000+0200},
  author = {Jayram, T. S. and Kumar, Ravi and Sivakumar, D.},
  biburl = {https://www.bibsonomy.org/bibtex/2a7ffc1d26a786613136a948603d8a75c/dblp},
  ee = {https://doi.org/10.4086/toc.2008.v004a006},
  interhash = {f55aff3433584c1c145b3ad5b067eb31},
  intrahash = {a7ffc1d26a786613136a948603d8a75c},
  journal = {Theory of Computing},
  keywords = {dblp},
  number = 1,
  pages = {129-135},
  timestamp = {2019-05-15T11:37:58.000+0200},
  title = {The One-Way Communication Complexity of Hamming Distance.},
  url = {http://dblp.uni-trier.de/db/journals/toc/toc4.html#JayramKS08},
  volume = 4,
  year = 2008
}

Downloads: 0