Talya Eden

According to our database, Talya Eden authored at least 34 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.

Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri

CoRR, 2024

Plant-and-Steal: Truthful Fair Allocations via Predictions.

Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan

CoRR, 2024

Testing C_k-freeness in bounded-arboricity graphs.

Talya Eden, Reut Levi, Dana Ron

CoRR, 2024

Testing C_k-Freeness in Bounded-Arboricity Graphs.

Talya Eden, Reut Levi, Dana Ron

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

Sampling an Edge in Sublinear Time Exactly and Optimally.

Talya Eden, Shyam Narayanan, Jakub Tetek

Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Triangle Counting with Local Edge Differential Privacy.

Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Bias Reduction for Sum Estimation.

Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek

Proceedings of the Approximation, 2023

2022

Sublinear-time distributed algorithms for detecting small cliques and even cycles.

Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman

Distributed Comput., 2022

Sampling Multiple Nodes in Large Networks: Beyond Random Walks.

Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis

Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022

Adversarially Robust Streaming via Dense-Sparse Trade-offs.

Omri Ben-Eliezer, Talya Eden, Krzysztof Onak

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Approximating the Arboricity in Sublinear Time.

Talya Eden, Saleet Mossel, Dana Ron

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Embeddings and Labeling Schemes for A.

Talya Eden, Piotr Indyk, Haike Xu

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

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

Proceedings of the Tenth International Conference on Learning Representations, 2022

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs.

Talya Eden, Dana Ron, Will Rosenbaum

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Massively Parallel Algorithms for Small Subgraph Counting.

Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic

Proceedings of the Approximation, 2022

2021

Learning-based Support Estimation in Sublinear Time.

Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner

Proceedings of the 9th International Conference on Learning Representations, 2021

Sampling Multiple Edges Efficiently.

Talya Eden, Saleet Mossel, Ronitt Rubinfeld

Proceedings of the Approximation, 2021

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time.

Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld

Proceedings of the Approximation, 2021

2020

Testing Bounded Arboricity.

Talya Eden, Reut Levi, Dana Ron

ACM Trans. Algorithms, 2020

On Approximating the Number of k-Cliques in Sublinear Time.

Talya Eden, Dana Ron, C. Seshadhri

SIAM J. Comput., 2020

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting.

Talya Eden, Dana Ron, Will Rosenbaum

CoRR, 2020

Amortized Edge Sampling.

Talya Eden, Saleet Mossel, Ronitt Rubinfeld

CoRR, 2020

Parallel Algorithms for Small Subgraph Counting.

Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld

CoRR, 2020

Faster sublinear approximation of the number of <i>k</i>-cliques in low-arboricity graphs.

Talya Eden, Dana Ron, C. Seshadhri

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection.

Talya Eden, Dana Ron, C. Seshadhri

SIAM J. Discret. Math., 2019

The Arboricity Captures the Complexity of Sampling Edges.

Talya Eden, Dana Ron, Will Rosenbaum

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Faster sublinear approximations of k-cliques for low arboricity graphs.

Talya Eden, Dana Ron, C. Seshadhri

CoRR, 2018

Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples.

Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

On Sampling Edges Almost Uniformly.

Talya Eden, Will Rosenbaum

Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Lower Bounds for Approximating Graph Parameters via Communication Complexity.

Talya Eden, Will Rosenbaum

Proceedings of the Approximation, 2018

2017

Approximately Counting Triangles in Sublinear Time.

Talya Eden, Amit Levi, Dana Ron, C. Seshadhri

SIAM J. Comput., 2017

Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection.

Talya Eden, Dana Ron, C. Seshadhri

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism.

Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron

Electron. Colloquium Comput. Complex., 2016

2015

Approximately Counting Triangles in Sublinear Time.

Talya Eden, Amit Levi, Dana Ron

Electron. Colloquium Comput. Complex., 2015