@InProceedings{biswas_et_al:LIPIcs.APPROX/RANDOM.2022.39,
author = {Biswas, Amartya Shankha and Eden, Talya and Liu, Quanquan C. and Rubinfeld, Ronitt and Mitrovi\'{c}, Slobodan},
title = {{Massively Parallel Algorithms for Small Subgraph Counting}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
pages = {39:1--39:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-249-5},
ISSN = {1868-8969},
year = {2022},
volume = {245},
editor = {Chakrabarti, Amit and Swamy, Chaitanya},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.39},
URN = {urn:nbn:de:0030-drops-171619},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.39},
annote = {Keywords: triangle counting, massively parallel computation, clique counting, approximation algorithms, subgraph counting}
}