Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic. Massively Parallel Algorithms for Small Subgraph Counting. In Amit Chakrabarti, Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference). Volume 245 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]
@inproceedings{BiswasELRM22,
title = {Massively Parallel Algorithms for Small Subgraph Counting},
author = {Amartya Shankha Biswas and Talya Eden and Quanquan C. Liu and Ronitt Rubinfeld and Slobodan Mitrovic},
year = {2022},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.39},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.39},
researchr = {https://researchr.org/publication/BiswasELRM22},
cites = {0},
citedby = {0},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)},
editor = {Amit Chakrabarti and Chaitanya Swamy},
volume = {245},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-249-5},
}