Published in: LIPIcs, Volume 200, 36th Computational Complexity Conference (CCC 2021)
Akshay Kamath, Eric Price, and David P. Woodruff. A Simple Proof of a New Set Disjointness with Applications to Data Streams. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 37:1-37:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kamath_et_al:LIPIcs.CCC.2021.37, author = {Kamath, Akshay and Price, Eric and Woodruff, David P.}, title = {{A Simple Proof of a New Set Disjointness with Applications to Data Streams}}, booktitle = {36th Computational Complexity Conference (CCC 2021)}, pages = {37:1--37:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-193-1}, ISSN = {1868-8969}, year = {2021}, volume = {200}, editor = {Kabanets, Valentine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.37}, URN = {urn:nbn:de:0030-drops-143119}, doi = {10.4230/LIPIcs.CCC.2021.37}, annote = {Keywords: Streaming algorithms, heavy hitters, communication complexity, information complexity} }
Feedback for Dagstuhl Publishing