עקוב אחר
Talya Eden
Talya Eden
Assistant Professor, Bar-Ilan University
אין אימייל מאומת - דף הבית
כותרת
צוטט על ידי
צוטט על ידי
שנה
Approximately counting triangles in sublinear time‏
T Eden, A Levi, D Ron, C Seshadhri‏
SIAM Journal on Computing 46 (5), 1603-1646, 2017‏
1682017
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‏
852018
On Sampling Edges Almost Unifromly‏
WR Talya Eden‏
Symposium on Simplicity in Algorithms (SOSA) 61, 7:1--7:9, 2018‏
51*2018
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‏
462018
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‏
46*2017
Sublinear-time distributed algorithms for detecting small cliques and even cycles‏
T Eden, N Fiat, O Fischer, F Kuhn, R Oshman‏
Distributed Computing, 1-28, 2022‏
382022
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‏
38*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‏
372019
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‏
332021
Lower bounds for approximating graph parameters via communication complexity‏
T Eden, W Rosenbaum‏
arXiv preprint arXiv:1709.04262, 2017‏
332017
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‏
322022
Adversarially Robust Streaming via Dense-Sparse Trade-offs∗‏
O Ben-Eliezer, T Eden, K Onak‏
Symposium on Simplicity in Algorithms (SOSA), 214-227, 2022‏
292022
Testing bounded arboricity‏
T Eden, R Levi, D Ron‏
ACM Transactions on Algorithms (TALG) 16 (2), 1-22, 2020‏
232020
The arboricity captures the complexity of sampling edges‏
T Eden, D Ron, W Rosenbaum‏
arXiv preprint arXiv:1902.08086, 2019‏
212019
Triangle counting with local edge differential privacy‏
T Eden, QC Liu, S Raskhodnikova, A Smith‏
arXiv preprint arXiv:2305.02263, 2023‏
162023
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‏
15*2021
Sampling multiple edges efficiently‏
T Eden, S Mossel, R Rubinfeld‏
arXiv preprint arXiv:2008.08032, 2020‏
102020
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‏
92020
Massively parallel algorithms for small subgraph counting‏
AS Biswas, T Eden, QC Liu, S Mitrović, R Rubinfeld‏
arXiv preprint arXiv:2002.08299, 2020‏
92020
Sampling multiple nodes in large networks: Beyond random walks‏
O Ben-Eliezer, T Eden, J Oren, D Fotakis‏
Proceedings of the fifteenth ACM international conference on web search and …, 2022‏
82022
המערכת אינה יכולה לבצע את הפעולה כעת. נסה שוב מאוחר יותר.
מאמרים 1–20