Talya Eden

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Bias reduction for sum estimation	2025-01-14	Paper
Triangle counting with local edge differential privacy	2024-11-14	Paper
Massively parallel algorithms for small subgraph counting	2024-08-22	Paper
Approximating the arboricity in sublinear time	2024-07-19	Paper
Almost optimal bounds for sublinear-time sampling of \(k\)-cliques in bounded arboricity graphs	2024-06-24	Paper
Adversarially robust streaming via dense-sparse trade-offs	2024-05-14	Paper
Sampling an edge in sublinear time exactly and optimally	2024-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q6126297	2024-04-09	Paper
Sampling Multiple Edges Efficiently	2023-11-20	Paper
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time	2023-11-20	Paper
Sublinear-time distributed algorithms for detecting small cliques and even cycles	2023-02-03	Paper
The arboricity captures the complexity of sampling edges	2022-07-21	Paper
Sublinear-time distributed algorithms for detecting small cliques and even cycles	2022-06-21	Paper
Lower bounds for approximating graph parameters via communication complexity	2021-08-04	Paper
Testing bounded arboricity	2021-05-03	Paper
Faster sublinear approximation of the number of k-cliques in low-arboricity graphs	2021-02-02	Paper
On approximating the number of \(k\)-cliques in sublinear time	2020-08-18	Paper
https://portal.mardi4nfdi.de/entity/Q5111336	2020-05-27	Paper
Tolerant junta testing and the connection to submodular optimization and function isomorphism	2019-12-16	Paper
Sublinear time estimation of degree distribution moments: the arboricity connection	2019-11-25	Paper
On sampling edges almost uniformly	2019-10-25	Paper
On approximating the number of k-cliques in sublinear time	2019-08-22	Paper
Tolerant junta testing and the connection to submodular optimization and function isomorphism	2018-03-15	Paper
Testing bounded arboricity	2018-03-15	Paper
Approximately counting triangles in sublinear time	2017-11-22	Paper
Lower Bounds for Approximating Graph Parameters via Communication Complexity	2017-09-13	Paper

Research outcomes over time

This page was built for person: Talya Eden