Talya Eden

Orcid: 0000-0001-8470-9508

Affiliations:
  • Bar-Ilan University, Ramat Gan, Israel
  • MIT, CSAIL, Cambridge, MA, USA (former)


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks.
CoRR, 2024

Plant-and-Steal: Truthful Fair Allocations via Predictions.
CoRR, 2024

Testing C<sub>k</sub>-freeness in bounded-arboricity graphs.
CoRR, 2024

Testing C_k-Freeness in Bounded-Arboricity Graphs.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Sampling an Edge in Sublinear Time Exactly and Optimally.
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023

Triangle Counting with Local Edge Differential Privacy.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Bias Reduction for Sum Estimation.
Proceedings of the Approximation, 2023

2022
Sublinear-time distributed algorithms for detecting small cliques and even cycles.
Distributed Comput., 2022

Sampling Multiple Nodes in Large Networks: Beyond Random Walks.
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.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Approximating the Arboricity in Sublinear Time.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Embeddings and Labeling Schemes for A.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Triangle and Four Cycle Counting with Predictions in Graph Streams.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Massively Parallel Algorithms for Small Subgraph Counting.
Proceedings of the Approximation, 2022

2021
Learning-based Support Estimation in Sublinear Time.
Proceedings of the 9th International Conference on Learning Representations, 2021

Sampling Multiple Edges Efficiently.
Proceedings of the Approximation, 2021

Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time.
Proceedings of the Approximation, 2021

2020
Testing Bounded Arboricity.
ACM Trans. Algorithms, 2020

On Approximating the Number of k-Cliques in Sublinear Time.
SIAM J. Comput., 2020

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

Amortized Edge Sampling.
CoRR, 2020

Parallel Algorithms for Small Subgraph Counting.
CoRR, 2020

Faster sublinear approximation of the number of <i>k</i>-cliques in low-arboricity graphs.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection.
SIAM J. Discret. Math., 2019

The Arboricity Captures the Complexity of Sampling Edges.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

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

Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

On Sampling Edges Almost Uniformly.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018

Lower Bounds for Approximating Graph Parameters via Communication Complexity.
Proceedings of the Approximation, 2018

2017
Approximately Counting Triangles in Sublinear Time.
SIAM J. Comput., 2017

Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection.
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.
Electron. Colloquium Comput. Complex., 2016

2015
Approximately Counting Triangles in Sublinear Time.
Electron. Colloquium Comput. Complex., 2015


  Loading...