Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)
Andre Gronemeier. Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 505-516, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gronemeier:LIPIcs.STACS.2009.1846, author = {Gronemeier, Andre}, title = {{Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {505--516}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1846}, URN = {urn:nbn:de:0030-drops-18465}, doi = {10.4230/LIPIcs.STACS.2009.1846}, annote = {Keywords: Computational complexity, Communication complexity} }
Feedback for Dagstuhl Publishing