default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Talya Eden
Bar-Ilan University, Ramat Gan, Israel
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 59 matches
- 2024
- Talya Eden, Reut Levi, Dana Ron:
Testing C_k-Freeness in Bounded-Arboricity Graphs. ICALP 2024: 60:1-60:20 - Talya Eden, Reut Levi, Dana Ron:
Testing Ck-freeness in bounded-arboricity graphs. CoRR abs/2404.18126 (2024) - Ilan Reuven Cohen, Alon Eden, Talya Eden, Arsen Vasilyan:
Plant-and-Steal: Truthful Fair Allocations via Predictions. CoRR abs/2406.07024 (2024) - 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
- 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 - Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith:
Triangle Counting with Local Edge Differential Privacy. ICALP 2023: 52:1-52:21 - Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. SOSA 2023: 253-260 - Talya Eden, Quanquan C. Liu, Sofya Raskhodnikova, Adam D. Smith:
Triangle Counting with Local Edge Differential Privacy. CoRR abs/2305.02263 (2023) - 2022
- 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) - 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 - 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 - 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 - Talya Eden, Piotr Indyk, Haike Xu:
Embeddings and Labeling Schemes for A. ITCS 2022: 62:1-62:19 - Talya Eden, Saleet Mossel, Dana Ron:
Approximating the Arboricity in Sublinear Time. SODA 2022: 2404-2425 - Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. SOSA 2022: 214-227 - Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. WSDM 2022: 37-47 - 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) - Talya Eden, Jakob Bæk Tejs Houen, Shyam Narayanan, Will Rosenbaum, Jakub Tetek:
Bias Reduction for Sum Estimation. CoRR abs/2208.01197 (2022) - Talya Eden, Shyam Narayanan, Jakub Tetek:
Sampling an Edge in Sublinear Time Exactly and Optimally. CoRR abs/2211.04981 (2022) - 2021
- 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 - Talya Eden, Saleet Mossel, Ronitt Rubinfeld:
Sampling Multiple Edges Efficiently. APPROX-RANDOM 2021: 51:1-51:15 - Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. ICLR 2021 - Talya Eden, Piotr Indyk, Shyam Narayanan, Ronitt Rubinfeld, Sandeep Silwal, Tal Wagner:
Learning-based Support Estimation in Sublinear Time. CoRR abs/2106.08396 (2021) - 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) - Omri Ben-Eliezer, Talya Eden, Krzysztof Onak:
Adversarially Robust Streaming via Dense-Sparse Trade-offs. CoRR abs/2109.03785 (2021) - Omri Ben-Eliezer, Talya Eden, Joel Oren, Dimitris Fotakis:
Sampling Multiple Nodes in Large Networks: Beyond Random Walks. CoRR abs/2110.13324 (2021) - Talya Eden, Saleet Mossel, Dana Ron:
Approximating the Arboricity in Sublinear Time. CoRR abs/2110.15260 (2021) - Talya Eden, Piotr Indyk, Haike Xu:
Embeddings and labeling schemes for A. CoRR abs/2111.10041 (2021) - 2020
- Talya Eden, Dana Ron, C. Seshadhri:
On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput. 49(4): 747-771 (2020) - Talya Eden, Reut Levi, Dana Ron:
Testing Bounded Arboricity. ACM Trans. Algorithms 16(2): 18:1-18:22 (2020)
skipping 29 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-06 20:28 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint