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
972017
On Approximating the Number of -Cliques in Sublinear Time
T Eden, D Ron, C Seshadhri
SIAM Journal on Computing 49 (4), 747-771, 2020
412020
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
31*2017
On Sampling Edges Almost Unifromly
WR Talya Eden
Symposium on Simplicity in Algorithms (SOSA) 61, 7:1--7:9, 2018
22*2018
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
182019
Lower bounds for approximating graph parameters via communication complexity
T Eden, W Rosenbaum
arXiv preprint arXiv:1709.04262, 2017
172017
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
152018
Testing Bounded Arboricity
T Eden, R Levi, D Ron
ACM Transactions on Algorithms (TALG) 16 (2), 1-22, 2020
132020
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
112019
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
10*2020
The arboricity captures the complexity of sampling edges
T Eden, D Ron, W Rosenbaum
arXiv preprint arXiv:1902.08086, 2019
62019
Parallel Algorithms for Small Subgraph Counting
AS Biswas, T Eden, QC Liu, S Mitrović, R Rubinfeld
arXiv preprint arXiv:2002.08299, 2020
12020
Almost Optimal Bounds for Sublinear-Time Sampling of -Cliques: Sampling Cliques is Harder Than Counting
T Eden, D Ron, W Rosenbaum
arXiv preprint arXiv:2012.04090, 2020
2020
Amortized Edge Sampling
T Eden, S Mossel, R Rubinfeld
arXiv preprint arXiv:2008.08032, 2020
2020
LEARNING-BASED SUPPORT ESTIMATION IN SUBLINEAR TIME
T Eden, P Indyk, S Narayanan, R Rubinfeld, S Silwal, T Wagner
FOCS 2020 Program Committee
D Alistarh, P Beame, C Canonne, NR Devanur, T Eden, Y Filmus, J Garg, ...
The system can't perform the operation now. Try again later.
Articles 1–16