@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
}

{"_id":"YPAzXCj934xbTzvT3","bibbaseid":"jayram-kumar-sivakumar-theonewaycommunicationcomplexityofhammingdistance-2008","author_short":["Jayram, T. S.","Kumar, R.","Sivakumar, D."],"bibdata":{"bibtype":"article","type":"article","added-at":"2019-05-14T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Jayram"],"firstnames":["T.","S."],"suffixes":[]},{"propositions":[],"lastnames":["Kumar"],"firstnames":["Ravi"],"suffixes":[]},{"propositions":[],"lastnames":["Sivakumar"],"firstnames":["D."],"suffixes":[]}],"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","bibtex":"@article{journals/toc/JayramKS08,\n added-at = {2019-05-14T00:00:00.000+0200},\n author = {Jayram, T. S. and Kumar, Ravi and Sivakumar, D.},\n biburl = {https://www.bibsonomy.org/bibtex/2a7ffc1d26a786613136a948603d8a75c/dblp},\n ee = {https://doi.org/10.4086/toc.2008.v004a006},\n interhash = {f55aff3433584c1c145b3ad5b067eb31},\n intrahash = {a7ffc1d26a786613136a948603d8a75c},\n journal = {Theory of Computing},\n keywords = {dblp},\n number = 1,\n pages = {129-135},\n timestamp = {2019-05-15T11:37:58.000+0200},\n title = {The One-Way Communication Complexity of Hamming Distance.},\n url = {http://dblp.uni-trier.de/db/journals/toc/toc4.html#JayramKS08},\n volume = 4,\n year = 2008\n}\n\n","author_short":["Jayram, T. S.","Kumar, R.","Sivakumar, D."],"key":"journals/toc/JayramKS08","id":"journals/toc/JayramKS08","bibbaseid":"jayram-kumar-sivakumar-theonewaycommunicationcomplexityofhammingdistance-2008","role":"author","urls":{"Link":"https://doi.org/10.4086/toc.2008.v004a006","Paper":"http://dblp.uni-trier.de/db/journals/toc/toc4.html#JayramKS08"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/ravi Kumar?items=1000","dataSources":["DiSHMj5oiLBLaqrYP"],"keywords":["dblp"],"search_terms":["one","way","communication","complexity","hamming","distance","jayram","kumar","sivakumar"],"title":"The One-Way Communication Complexity of Hamming Distance.","year":2008}