Sublinear-Time Algorithms for Counting Star Subgraphs with Applications to Join Selectivity Estimation. - Maryam Aliakbarpour; Amartya Shankha Biswas; Themistoklis Gouleakis; John Peebles; Ronitt Rubinfeld; Anak Yodpinyanee (CoRR, 2016)

Common Development of Prisms, Anti-Prisms, Tetrahedra, and Wedges. - Amartya Shankha Biswas; Erik D. Demaine (CCCG, 2017)

Local-Access Generators for Basic Random Graph Models. - Amartya Shankha Biswas; Ronitt Rubinfeld; Anak Yodpinyanee (CoRR, 2017)

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling. - Maryam Aliakbarpour; Amartya Shankha Biswas; Themis Gouleakis; John Peebles; Ronitt Rubinfeld; Anak Yodpinyanee (Algorithmica, 2018)

Local Access to Huge Random Objects Through Partial Sampling. - Amartya Shankha Biswas; Ronitt Rubinfeld; Anak Yodpinyanee (ITCS, 2020)

Parallel Algorithms for Small Subgraph Counting. - Amartya Shankha Biswas; Talya Eden; Quanquan C. Liu; Slobodan Mitrovic; Ronitt Rubinfeld (CoRR, 2020)

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. - Amartya Shankha Biswas; Talya Eden; Ronitt Rubinfeld (APPROX-RANDOM, 2021)

Massively Parallel Algorithms for Distance Approximation and Spanners. - Amartya Shankha Biswas; Michal Dory; Mohsen Ghaffari 001; Slobodan Mitrovic; Yasamin Nazari (SPAA, 2021)

Massively Parallel Algorithms for Small Subgraph Counting. - Amartya Shankha Biswas; Talya Eden; Quanquan C. Liu; Ronitt Rubinfeld; Slobodan Mitrovic (APPROX/RANDOM, 2022)

Local Access to Random Walks. - Amartya Shankha Biswas; Edward Pyne; Ronitt Rubinfeld (ITCS, 2022)

Testing Tail Weight of a Distribution Via Hazard Rate. - Maryam Aliakbarpour; Amartya Shankha Biswas; Kavya Ravichandran; Ronitt Rubinfeld (ALT, 2023)

Average-Case Local Computation Algorithms. - Amartya Shankha Biswas; Ruidi Cao; Edward Pyne; Ronitt Rubinfeld (CoRR, 2024)