Talya Eden
Assistant Professor, Computer Science, Bar Ilan University
Office: Room 537, Nanotechnology building
talyaa01@gmail.com
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.
I completed my PhD in the School of Electrical Engineering at Tel Aviv University, privileged to work under the wonderful supervision of Prof. Dana Ron.
Publications
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting, ICALP 2022
with Dana Ron and Will RosenbaumParallel Algorithms for Small Subgraph Counting, to appear in APPROX 2022
with Amartya Shankha Biswas, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld
Triangles and Four Cycle Counting with Predictions in Graph Streams, ICLR 2022
with Justin Y Chen, Piotr Indyk, Honghao Lin , Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, David Woodruff, Tal Wagner, Jinyao (Michael) ZhangEmbeddings and Labeling schemes for A*, ITCS 2022
with Piotr Indyk, Haike Xu
Sampling Multiple Nodes in Large Networks: Beyond Random Walks, WSDM 2022, spotlight presentation
Omri Ben Eliezer, Talya Eden, Joel Oren and Dimtris Fotakis
Estimating the Arboricity in Sublinear Time, SODA 2022
with Saleet Mossel and Dana Ron
with Omri Ben-Eliezer, Krzysztof Onak
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)