@InProceedings{rao_et_al:LIPIcs.CCC.2015.88,
author = {Rao, Anup and Yehudayoff, Amir},
title = {{Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness}},
booktitle = {30th Conference on Computational Complexity (CCC 2015)},
pages = {88--101},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-81-1},
ISSN = {1868-8969},
year = {2015},
volume = {33},
editor = {Zuckerman, David},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.88},
URN = {urn:nbn:de:0030-drops-50769},
doi = {10.4230/LIPIcs.CCC.2015.88},
annote = {Keywords: communication complexity, set disjointness, number on forehead, lower bounds}
}