The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection

Eyal Kushilevitz, Enav Weinreb. The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA. pages 63-72, IEEE Computer Society, 2009. [doi]

@inproceedings{KushilevitzW09-0,
  title = {The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection},
  author = {Eyal Kushilevitz and Enav Weinreb},
  year = {2009},
  doi = {10.1109/FOCS.2009.15},
  url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.15},
  researchr = {https://researchr.org/publication/KushilevitzW09-0},
  cites = {0},
  citedby = {0},
  pages = {63-72},
  booktitle = {50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA},
  publisher = {IEEE Computer Society},
  isbn = {978-0-7695-3850-1},
}