| 2025 | STOC | Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. | Talya Eden, Reut Levi, Dana Ron, Ronitt Rubinfeld |
| 2025 | WSDM | A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. | Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri |
| 2024 | ICALP | Testing C_k-Freeness in Bounded-Arboricity Graphs. | Talya Eden, Reut Levi, Dana Ron |
| 2023 | ICALP | Triangle Counting with Local Edge Differential Privacy. | Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam Smith |
| 2022 | ICALP | Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2022 | ICLR | Triangle and Four Cycle Counting with Predictions in Graph Streams. | Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang |
| 2022 | SODA | Approximating the Arboricity in Sublinear Time. | Talya Eden, Saleet Mossel, Dana Ron |
| 2022 | WSDM | Sampling Multiple Nodes in Large Networks: Beyond Random Walks. | Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis |
| 2021 | ICLR | Learning-based Support Estimation in Sublinear Time. | Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner |
| 2020 | SODA | Faster sublinear approximation of the number of | Talya Eden, Dana Ron, C. Seshadhri |
| 2019 | ICALP | The Arboricity Captures the Complexity of Sampling Edges. | Talya Eden, Dana Ron, Will Rosenbaum |
| 2018 | WWW | Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. | Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri |
| 2018 | SODA | Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. | Eric Blais, Clment L. Canonne, Talya Eden, Amit Levi, Dana Ron |
| 2018 | SODA | Testing bounded arboricity. | Talya Eden, Reut Levi, Dana Ron |
| 2018 | SODA | On Sampling Edges Almost Uniformly. | Talya Eden, Will Rosenbaum |
| 2018 | STOC | On approximating the number of k-cliques in sublinear time. | Talya Eden, Dana Ron, C. Seshadhri |
| 2017 | ICALP | Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. | Talya Eden, Dana Ron, C. Seshadhri |
| 2015 | FOCS | Approximately Counting Triangles in Sublinear Time. | Talya Eden, Amit Levi, Dana Ron, C. Seshadhri |