@InProceedings{eden_et_al:LIPIcs.DISC.2019.15,
author = {Eden, Talya and Fiat, Nimrod and Fischer, Orr and Kuhn, Fabian and Oshman, Rotem},
title = {{Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles}},
booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-126-9},
ISSN = {1868-8969},
year = {2019},
volume = {146},
editor = {Suomela, Jukka},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.15},
URN = {urn:nbn:de:0030-drops-113224},
doi = {10.4230/LIPIcs.DISC.2019.15},
annote = {Keywords: Distributed Computing, Subgraph Freeness, CONGEST}
}