Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Rotem Oshman and Tal Roth. The Communication Complexity of Set Intersection Under Product Distributions. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 95:1-95:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@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} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Inbar Ben Yaacov, Gil Cohen, and Anand Kumar Narayanan. Candidate Tree Codes via Pascal Determinant Cubes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 54:1-54:22, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{benyaacov_et_al:LIPIcs.APPROX/RANDOM.2021.54, author = {Ben Yaacov, Inbar and Cohen, Gil and Narayanan, Anand Kumar}, title = {{Candidate Tree Codes via Pascal Determinant Cubes}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {54:1--54:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.54}, URN = {urn:nbn:de:0030-drops-147474}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.54}, annote = {Keywords: Tree codes, Sparse polynomials, Explicit constructions} }
Feedback for Dagstuhl Publishing