Talya Eden
Talya Eden
Postdoctoral fellow, MIT
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
Approximately counting triangles in sublinear time
T Eden, A Levi, D Ron, C Seshadhri
SIAM Journal on Computing 46 (5), 1603-1646, 2017
742017
On Approximating the Number of -Cliques in Sublinear Time
T Eden, D Ron, C Seshadhri
SIAM Journal on Computing 49 (4), 747-771, 2020
272020
Sublinear time estimation of degree distribution moments: The degeneracy connection
T Eden, D Ron, C Seshadhri
44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017
23*2017
On sampling edges almost uniformly
T Eden, W Rosenbaum
arXiv preprint arXiv:1706.09748, 2017
162017
Tolerant junta testing and the connection to submodular optimization and function isomorphism
E Blais, CL Canonne, T Eden, A Levi, D Ron
ACM Transactions on Computation Theory (TOCT) 11 (4), 1-33, 2019
142019
Testing bounded arboricity
T Eden, R Levi, D Ron
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
102018
Lower bounds for approximating graph parameters via communication complexity
T Eden, W Rosenbaum
arXiv preprint arXiv:1709.04262, 2017
102017
Provable and practical approximations for the degree distribution using sublinear graph samples
T Eden, S Jain, A Pinar, D Ron, C Seshadhri
Proceedings of the 2018 World Wide Web Conference, 449-458, 2018
82018
Sublinear-time distributed algorithms for detecting small cliques and even cycles
T Eden, N Fiat, O Fischer, F Kuhn, R Oshman
33rd International Symposium on Distributed Computing (DISC 2019), 2019
52019
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs
T Eden, D Ron, C Seshadhri
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
32020
Faster sublinear approximations of -cliques for low arboricity graphs
T Eden, D Ron, C Seshadhri
arXiv preprint arXiv:1811.04425, 2018
32018
The Arboricity Captures the Complexity of Sampling Edges
T Eden, D Ron, W Rosenbaum
arXiv preprint arXiv:1902.08086, 2019
12019
Testing Bounded Arboricity
T Eden, R Levi, D Ron
ACM Transactions on Algorithms (TALG) 16 (2), 1-22, 2020
2020
Parallel Algorithms for Small Subgraph Counting
AS Biswas, T Eden, QC Liu, S Mitrović, R Rubinfeld
arXiv preprint arXiv:2002.08299, 2020
2020
Parallel Algorithms for Small Subgraph Counting
A Shankha Biswas, T Eden, QC Liu, S Mitrović, R Rubinfeld
arXiv, arXiv: 2002.08299, 2020
2020
Faster sublinear approximation of the number of\emph {k}-cliques in low-arboricity graphs
T Eden, D Ron, C Seshadhri
Symposium on Algorithms and Data Structures (SODA), 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–16