@InProceedings{gonen_et_al:LIPIcs.OPODIS.2017.6,
author = {Gonen, Tzlil and Oshman, Rotem},
title = {{Lower Bounds for Subgraph Detection in the CONGEST Model}},
booktitle = {21st International Conference on Principles of Distributed Systems (OPODIS 2017)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-061-3},
ISSN = {1868-8969},
year = {2018},
volume = {95},
editor = {Aspnes, James and Bessani, Alysson and Felber, Pascal and Leit\~{a}o, Jo\~{a}o},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2017.6},
URN = {urn:nbn:de:0030-drops-86445},
doi = {10.4230/LIPIcs.OPODIS.2017.6},
annote = {Keywords: subgraph freeness, CONGEST, lower bounds}
}