Talya Eden
Affiliations: MIT, CSAIL, Cambridge, MA, USA
According to our database^{1},
Talya Eden
authored at least 30 papers
between 2015 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2023
CoRR, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
2022
Sublineartime distributed algorithms for detecting small cliques and even cycles.
Distributed Comput., 2022
CoRR, 2022
Proceedings of the WSDM '22: The Fifteenth ACM International Conference on Web Search and Data Mining, Virtual Event / Tempe, AZ, USA, February 21, 2022
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022
Proceedings of the 2022 ACMSIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022
Proceedings of the Tenth International Conference on Learning Representations, 2022
Almost Optimal Bounds for SublinearTime Sampling of kCliques in Bounded Arboricity Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the Approximation, 2022
2021
Proceedings of the 9th International Conference on Learning Representations, 2021
Proceedings of the Approximation, 2021
Towards a DecompositionOptimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time.
Proceedings of the Approximation, 2021
2020
ACM Trans. Algorithms, 2020
SIAM J. Comput., 2020
Almost Optimal Bounds for SublinearTime Sampling of kCliques: Sampling Cliques is Harder Than Counting.
CoRR, 2020
CoRR, 2020
CoRR, 2020
Faster sublinear approximation of the number of <i>k</i>cliques in lowarboricity graphs.
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
2019
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection.
SIAM J. Discret. Math., 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
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
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
Proceedings of the Approximation, 2018
2017
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
Electron. Colloquium Comput. Complex., 2015