Learning Based Support Estimation in Sublinear Time, spotlight presentation, ICLR 2021
with Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner
Amortized Edge Sampling, RANDOM 2021
with Saleet Mossel and Ronitt Rubinfeld.
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time, RANDOM 2021
with Amartya Shankha Biswas, Ronitt Rubinfeld
with Dana Ron, C. Seshadhri
with Dana Ron, Will Rosenbaum
with Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman
with Will Rosenbaum
with Dana Ron, C. Seshadhri
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples, WWW 2018
with Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism, SODA 2018
with Eric Blais, Clément L. Canonne, Amit Levi, Dana Ron
with Will Rosenbaum
SIAM Journal on Discrete Math (SIDMA) 33(4)
with Dana Ron, C. Seshadhri
Approximately Counting Triangles in Sublinear Time, FOCS 2015, SIAM Journal on Computing (SICOMP) 46 (5)
with Amit Levi, Dana Ron, C. Seshadhri (video from the talk at FOCS)
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting
with Dana Ron and Will Rosenbaum
Estimating the Arboricity in Sublinear Time
with Dana Ron and Saleet Mossel
Embeddings and Labeling schemes for A*
with Piotr Indyk, Haike Xu
with Amartya Shankha Biswas, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld
with Omri Ben-Eliezer, Krzysztof Onak