Follow
Talya Eden
Talya Eden
Postdoctoral fellow, MIT and Boston University
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
1282017
On approximating the number of k-cliques in sublinear time
T Eden, D Ron, C Seshadhri
Proceedings of the 50th annual ACM SIGACT symposium on theory of computing …, 2018
642018
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
40*2017
On Sampling Edges Almost Unifromly
WR Talya Eden
Symposium on Simplicity in Algorithms (SOSA) 61, 7:1--7:9, 2018
31*2018
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
25*2020
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
232019
Sublinear-time distributed algorithms for detecting small cliques and even cycles
T Eden, N Fiat, O Fischer, F Kuhn, R Oshman
Distributed Computing 35 (3), 207-234, 2022
222022
Lower bounds for approximating graph parameters via communication complexity
T Eden, W Rosenbaum
arXiv preprint arXiv:1709.04262, 2017
222017
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
202018
Testing bounded arboricity
T Eden, R Levi, D Ron
ACM Transactions on Algorithms (TALG) 16 (2), 1-22, 2020
172020
Learning-based support estimation in sublinear time
T Eden, P Indyk, S Narayanan, R Rubinfeld, S Silwal, T Wagner
arXiv preprint arXiv:2106.08396, 2021
152021
The arboricity captures the complexity of sampling edges
T Eden, D Ron, W Rosenbaum
arXiv preprint arXiv:1902.08086, 2019
152019
Adversarially Robust Streaming via Dense-Sparse Trade-offs∗
O Ben-Eliezer, T Eden, K Onak
Symposium on Simplicity in Algorithms (SOSA), 214-227, 2022
92022
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
62020
Sampling multiple edges efficiently
T Eden, S Mossel, R Rubinfeld
arXiv preprint arXiv:2008.08032, 2020
52020
Parallel Algorithms for Small Subgraph Counting
AS Biswas, T Eden, QC Liu, S Mitrović, R Rubinfeld
arXiv preprint arXiv:2002.08299, 2020
52020
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time
A Shankha Biswas, T Eden, R Rubinfeld
arXiv e-prints, arXiv: 2107.06582, 2021
4*2021
Embeddings and labeling schemes for A
T Eden, P Indyk, H Xu
arXiv preprint arXiv:2111.10041, 2021
22021
Triangle and Four Cycle Counting with Predictions in Graph Streams
JY Chen, T Eden, P Indyk, H Lin, S Narayanan, R Rubinfeld, S Silwal, ...
arXiv preprint arXiv:2203.09572, 2022
12022
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs
T Eden, D Ron, W Rosenbaum
49th International Colloquium on Automata, Languages, and Programming (ICALP …, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–20