Personal profile
About Me
I am an assistant professor at the department of computer science at Bar Ilan University.
Prior to that I was postdoctoral fellow at the Foundations of Data Science Institute (FODSI) jointly affiliated with MIT and Boston University. At Boston University I was hosted by Prof. Sofya Raskhodnikova, and at MIT, I am hosted by Prof. Ronitt Rubinfeld and Prof. Piotr Indyk.
Prior to that I was postdoctoral fellow at the Foundations of Data Science Institute (FODSI) jointly affiliated with MIT and Boston University. At Boston University I was hosted by Prof. Sofya Raskhodnikova, and at MIT, I am hosted by Prof. Ronitt Rubinfeld and Prof. Piotr Indyk.
My research lies in the fields of Sublinear-Time Algorithms and Property Testing. My main focus is approximation of graph parameters in sublinear time.
Fingerprint
Dive into the research topics where Talya Eden is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
Testable Algorithms for Approximately Counting Edges and Triangles in Sublinear Time and Space
Eden, T., Rubinfeld, R. & Vasilyan, A., 2026, 17th Innovations in Theoretical Computer Science Conference,ITCS 2026. Saraf, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 54. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 362).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
Eden, T., Levi, R., Ron, D. & Rubinfeld, R., 15 Jun 2025, STOC 2025 - Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Koucky, M. & Bansal, N. (eds.). Association for Computing Machinery, p. 1043-1054 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access1 Scopus citations -
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
Basu, S., Kōshima, N., Eden, T., Ben-Eliezer, O. & Seshadhri, C., 10 Mar 2025, WSDM 2025 - Proceedings of the 18th ACM International Conference on Web Search and Data Mining. Association for Computing Machinery, Inc, p. 20-29 10 p. (WSDM 2025 - Proceedings of the 18th ACM International Conference on Web Search and Data Mining).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
1 Scopus citations -
Triangle Counting With Local Edge Differential Privacy
Eden, T., Liu, Q. C., Raskhodnikova, S. & Smith, A., Jul 2025, In: Random Structures and Algorithms. 66, 4, e70002.Research output: Contribution to journal › Article › peer-review
2 Scopus citations -
Plant-and-Steal: Truthful Fair Allocations via Predictions
Cohen, I. R., Eden, A., Eden, T. & Vasilyan, A., 2024, In: Advances in Neural Information Processing Systems. 37Research output: Contribution to journal › Conference article › peer-review
1 Scopus citations