@InProceedings{ivanyos_et_al:LIPIcs.FSTTCS.2012.148,
author = {Ivanyos, G\'{a}bor and Klauck, Hartmut and Lee, Troy and Santha, Miklos and de Wolf, Ronald},
title = {{New bounds on the classical and quantum communication complexity of some graph properties}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)},
pages = {148--159},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-47-7},
ISSN = {1868-8969},
year = {2012},
volume = {18},
editor = {D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.148},
URN = {urn:nbn:de:0030-drops-38523},
doi = {10.4230/LIPIcs.FSTTCS.2012.148},
annote = {Keywords: Graph properties, communication complexity, quantum communication}
}