Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld. Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. In Mary Wootters, Laura Sanità, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference). Volume 207 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{BiswasER21, title = {Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time}, author = {Amartya Shankha Biswas and Talya Eden and Ronitt Rubinfeld}, year = {2021}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.55}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.55}, researchr = {https://researchr.org/publication/BiswasER21}, cites = {0}, citedby = {0}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)}, editor = {Mary Wootters and Laura Sanità}, volume = {207}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-207-5}, }