@InProceedings{oshman_et_al:LIPIcs.ICALP.2023.95,
author = {Oshman, Rotem and Roth, Tal},
title = {{The Communication Complexity of Set Intersection Under Product Distributions}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {95:1--95:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.95},
URN = {urn:nbn:de:0030-drops-181472},
doi = {10.4230/LIPIcs.ICALP.2023.95},
annote = {Keywords: Communication complexity, intersection, set disjointness}
}