@InProceedings{assadi_et_al:LIPIcs.ITCS.2019.6,
author = {Assadi, Sepehr and Kapralov, Michael and Khanna, Sanjeev},
title = {{A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling}},
booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)},
pages = {6:1--6:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-095-8},
ISSN = {1868-8969},
year = {2019},
volume = {124},
editor = {Blum, Avrim},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.6},
URN = {urn:nbn:de:0030-drops-100996},
doi = {10.4230/LIPIcs.ITCS.2019.6},
annote = {Keywords: Sublinear-time algorithms, Subgraph counting, AGM bound}
}