Research output per year
Research output per year
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
-
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
Open Access -
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
-
Testing Ck-Freeness in Bounded-Arboricity Graphs
Eden, T., Levi, R. & Ron, D., 2024, Testing Ck-Freeness in Bounded-Arboricity Graphs. Bringmann, K., Grohe, M., Puppis, G. & Svensson, O. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 297. (Leibniz International Proceedings in Informatics, LIPIcs).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
1 Scopus citations -
Bias Reduction for Sum Estimation
Eden, T., Tejs Houen, J. B., Narayanan, S., Rosenbaum, W. & Tětek, J., Sep 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 62. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 275).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Sampling an Edge in Sublinear Time Exactly and Optimally
Eden, T., Narayanan, S. & Tětek, J., 2023, Proceedings - 2023 SIAM Symposium on Simplicity in Algorithms, SOSA 2023. Kavitha, T. & Mehlhorn, K. (eds.). Society for Industrial and Applied Mathematics Publications, p. 253-260 8 p. (Proceedings - 2023 SIAM Symposium on Simplicity in Algorithms, SOSA 2023).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access