no code implementations • 15 Feb 2021 • Amartya Shankha Biswas, Edward Pyne, Ronitt Rubinfeld
We then prove that no that algorithm with sub-constant error given probe access to random $d$-regular graphs can have runtime better than $\Omega(\sqrt{n}/\log(n))$ per query in expectation, obtaining a nearly matching lower bound.
Data Structures and Algorithms
no code implementations • 6 Oct 2020 • Maryam Aliakbarpour, Amartya Shankha Biswas, Kavya Ravichandran, Ronitt Rubinfeld
Understanding the shape of a distribution of data is of interest to people in a great variety of fields, as it may affect the types of algorithms used for that data.
1 code implementation • 19 Feb 2020 • Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrović, Ronitt Rubinfeld
Finally, we prove that a recent result of Bera, Pashanasangi and Seshadhri (ITCS 2020) for exactly counting all subgraphs of size at most $5$ can be implemented in the MPC model in total space.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
