Sparse and Lopsided Set Disjointness via Information Theory. Dasgupta, A., Kumar, R., & Sivakumar, D. In Gupta, A., Jansen, K., Rolim, J. D. P., & Servedio, R. A., editors, APPROX-RANDOM, volume 7408, of Lecture Notes in Computer Science, pages 517-528, 2012. Springer.
Sparse and Lopsided Set Disjointness via Information Theory. [link]Link  Sparse and Lopsided Set Disjointness via Information Theory. [link]Paper  bibtex   
@inproceedings{conf/approx/DasguptaKS12,
  added-at = {2017-06-01T00:00:00.000+0200},
  author = {Dasgupta, Anirban and Kumar, Ravi and Sivakumar, D.},
  biburl = {https://www.bibsonomy.org/bibtex/256aa05838142bada24d3d88215a73e2c/dblp},
  booktitle = {APPROX-RANDOM},
  crossref = {conf/approx/2012},
  editor = {Gupta, Anupam and Jansen, Klaus and Rolim, José D. P. and Servedio, Rocco A.},
  ee = {https://doi.org/10.1007/978-3-642-32512-0_44},
  interhash = {87055a285d0ab65c988b3a76504b7581},
  intrahash = {56aa05838142bada24d3d88215a73e2c},
  isbn = {978-3-642-32511-3},
  keywords = {dblp},
  pages = {517-528},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T20:03:04.000+0200},
  title = {Sparse and Lopsided Set Disjointness via Information Theory.},
  url = {http://dblp.uni-trier.de/db/conf/approx/approx2012.html#DasguptaKS12},
  volume = 7408,
  year = 2012
}

Downloads: 0