default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTalya Eden
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
- affiliation (former): MIT, CSAIL, Cambridge, MA, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[c29]Talya Eden
, Ronitt Rubinfeld, Arsen Vasilyan:
Testable Algorithms for Approximately Counting Edges and Triangles in Sublinear Time and Space. ITCS 2026: 54:1-54:24- [i32]Talya Eden, C. Seshadhri:
A note on approximating the average degree of bounded arboricity graphs. CoRR abs/2603.08694 (2026) - 2025
- [j7]Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith:
Triangle Counting With Local Edge Differential Privacy. Random Struct. Algorithms 66(4) (2025) - [c28]Talya Eden, Reut Levi, Dana Ron, Ronitt Rubinfeld:
Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. STOC 2025: 1043-1054 - [c27]Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri:
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. WSDM 2025: 20-29 - [i31]Talya Eden, Reut Levi, Dana Ron, Ronitt Rubinfeld:
Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time. CoRR abs/2503.09810 (2025) - [i30]Talya Eden, Ronitt Rubinfeld, Arsen Vasilyan:
Testable algorithms for approximately counting edges and triangles in sublinear time and space. CoRR abs/2509.20351 (2025) - [i29]Talya Eden, Ludmila Glinskih, Sofya Raskhodnikova:
Fast Agnostic Learners in the Plane. CoRR abs/2510.18057 (2025) - 2024
- [c26]Talya Eden, Reut Levi, Dana Ron:
Testing C_k-Freeness in Bounded-Arboricity Graphs. ICALP 2024: 60:1-60:20 - [c25]Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan:
Plant-and-Steal: Truthful Fair Allocations via Predictions. NeurIPS 2024 - [i28]Talya Eden, Reut Levi, Dana Ron:
Testing Ck-freeness in bounded-arboricity graphs. CoRR abs/2404.18126 (2024) - [i27]Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan:
Plant-and-Steal: Truthful Fair Allocations via Predictions. CoRR abs/2406.07024 (2024) - [i26]Sabyasachi Basu, Nadia Koshima, Talya Eden, Omri Ben-Eliezer, C. Seshadhri:
A Sublinear Algorithm for Approximate Shortest Paths in Large Networks. CoRR abs/2406.08624 (2024) - 2023
- [c24]Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
Bias Reduction for Sum Estimation. APPROX/RANDOM 2023: 62:1-62:21 - [c23]Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam Smith:
Triangle Counting with Local Edge Differential Privacy. ICALP 2023: 52:1-52:21 - [c22]Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. SOSA 2023: 253-260 - [i25]Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith:
Triangle Counting with Local Edge Differential Privacy. CoRR abs/2305.02263 (2023) - 2022
- [j6]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Comput. 35(3): 207-234 (2022) - [c21]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Ronitt Rubinfeld, Slobodan Mitrovic:
Massively Parallel Algorithms for Small Subgraph Counting. APPROX/RANDOM 2022: 39:1-39:28 - [c20]Talya Eden, Dana Ron, Will Rosenbaum:
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs. ICALP 2022: 56:1-56:19 - [c19]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. ICLR 2022 - [c18]Talya Eden, Piotr Indyk, Haike Xu:
Embeddings and Labeling Schemes for A. ITCS 2022: 62:1-62:19 - [c17]Talya Eden, Saleet Mossel, Dana Ron:
Approximating the Arboricity in Sublinear Time. SODA 2022: 2404-2425 - [c16]Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. SOSA 2022: 214-227 - [c15]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. WSDM 2022: 37-47 - [i24]Justin Y. Chen, Talya Eden, Piotr Indyk, Honghao Lin, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner, David P. Woodruff, Michael Zhang:
Triangle and Four Cycle Counting with Predictions in Graph Streams. CoRR abs/2203.09572 (2022) - [i23]Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
Bias Reduction for Sum Estimation. CoRR abs/2208.01197 (2022) - [i22]Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. CoRR abs/2211.04981 (2022) - 2021
- [c14]Talya Eden, Saleet Mossel, Ronitt Rubinfeld:
Sampling Multiple Edges Efficiently. APPROX-RANDOM 2021: 51:1-51:15 - [c13]Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld:
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. APPROX-RANDOM 2021: 55:1-55:19 - [c12]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. ICLR 2021 - [i21]Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. CoRR abs/2106.08396 (2021) - [i20]Amartya Shankha Biswas, Talya Eden, Ronitt Rubinfeld:
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time. CoRR abs/2107.06582 (2021) - [i19]Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. CoRR abs/2109.03785 (2021) - [i18]Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. CoRR abs/2110.13324 (2021) - [i17]Talya Eden, Saleet Mossel, Dana Ron:
Approximating the Arboricity in Sublinear Time. CoRR abs/2110.15260 (2021) - [i16]Talya Eden, Piotr Indyk, Haike Xu:
Embeddings and labeling schemes for A. CoRR abs/2111.10041 (2021) - 2020
- [j5]Talya Eden, Dana Ron, C. Seshadhri:
On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput. 49(4): 747-771 (2020) - [j4]Talya Eden, Reut Levi, Dana Ron:
Testing Bounded Arboricity. ACM Trans. Algorithms 16(2): 18:1-18:22 (2020) - [c11]Talya Eden, Dana Ron, C. Seshadhri:
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs. SODA 2020: 1467-1478 - [i15]Amartya Shankha Biswas, Talya Eden, Quanquan C. Liu, Slobodan Mitrovic, Ronitt Rubinfeld:
Parallel Algorithms for Small Subgraph Counting. CoRR abs/2002.08299 (2020) - [i14]Talya Eden, Saleet Mossel, Ronitt Rubinfeld:
Amortized Edge Sampling. CoRR abs/2008.08032 (2020) - [i13]Talya Eden, Dana Ron, Will Rosenbaum:
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting. CoRR abs/2012.04090 (2020)
2010 – 2019
- 2019
- [j3]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. SIAM J. Discret. Math. 33(4): 2267-2285 (2019) - [j2]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. ACM Trans. Comput. Theory 11(4): 24:1-24:33 (2019) - [c10]Talya Eden, Dana Ron, Will Rosenbaum:
The Arboricity Captures the Complexity of Sampling Edges. ICALP 2019: 52:1-52:14 - [c9]Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, Rotem Oshman:
Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles. DISC 2019: 15:1-15:16 - [i12]Talya Eden, Dana Ron, Will Rosenbaum:
The Arboricity Captures the Complexity of Sampling Edges. CoRR abs/1902.08086 (2019) - 2018
- [c8]Talya Eden, Will Rosenbaum:
Lower Bounds for Approximating Graph Parameters via Communication Complexity. APPROX-RANDOM 2018: 11:1-11:18 - [c7]Talya Eden, Will Rosenbaum:
On Sampling Edges Almost Uniformly. SOSA 2018: 7:1-7:9 - [c6]Talya Eden, Reut Levi, Dana Ron:
Testing bounded arboricity. SODA 2018: 2081-2092 - [c5]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. SODA 2018: 2113-2132 - [c4]Talya Eden, Dana Ron, C. Seshadhri:
On approximating the number of k-cliques in sublinear time. STOC 2018: 722-734 - [c3]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW 2018: 449-458 - [i11]Talya Eden, Dana Ron, C. Seshadhri:
Faster sublinear approximations of k-cliques for low arboricity graphs. CoRR abs/1811.04425 (2018) - 2017
- [j1]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. SIAM J. Comput. 46(5): 1603-1646 (2017) - [c2]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. ICALP 2017: 7:1-7:13 - [i10]Talya Eden, Will Rosenbaum:
On Sampling Edges Almost Uniformly. CoRR abs/1706.09748 (2017) - [i9]Talya Eden, Dana Ron, C. Seshadhri:
On Approximating the Number of $k$-cliques in Sublinear Time. CoRR abs/1707.04858 (2017) - [i8]Talya Eden, Reut Levi, Dana Ron:
Testing bounded arboricity. CoRR abs/1707.04864 (2017) - [i7]Talya Eden, Will Rosenbaum:
Lower Bounds for Approximating Graph Parameters via Communication Complexity. CoRR abs/1709.04262 (2017) - [i6]Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri:
Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR abs/1710.08607 (2017) - 2016
- [i5]Talya Eden, Dana Ron, C. Seshadhri:
Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection. CoRR abs/1604.03661 (2016) - [i4]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. CoRR abs/1607.03938 (2016) - [i3]Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron:
Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism. Electron. Colloquium Comput. Complex. TR16: Article TR16-105 (2016) - 2015
- [c1]Talya Eden, Amit Levi, Dana Ron, C. Seshadhri:
Approximately Counting Triangles in Sublinear Time. FOCS 2015: 614-633 - [i2]Talya Eden, Amit Levi, Dana Ron:
Approximately Counting Triangles in Sublinear Time. CoRR abs/1504.00954 (2015) - [i1]Talya Eden, Amit Levi, Dana Ron:
Approximately Counting Triangles in Sublinear Time. Electron. Colloquium Comput. Complex. TR15: Article TR15-046 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-05 02:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
