The following pages link to Talya Eden (Q2146869):
Displaying 25 items.
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- Testing Bounded Arboricity (Q4608029) (← links)
- (Q4608031) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- (Q5009503) (← links)
- (Q5091207) (← links)
- (Q5111336) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- Faster sublinear approximation of the number of <i>k</i>-cliques in low-arboricity graphs (Q5146866) (← links)
- Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism (Q5205820) (← links)
- On approximating the number of k-cliques in sublinear time (Q5230333) (← links)
- On Sampling Edges Almost Uniformly (Q5240421) (← links)
- Sampling Multiple Edges Efficiently (Q6070395) (← links)
- Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time (Q6090913) (← links)
- (Q6126297) (← links)
- Lower Bounds for Approximating Graph Parameters via Communication Complexity (Q6291236) (← links)
- Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q6487531) (← links)
- Adversarially robust streaming via dense-sparse trade-offs (Q6538779) (← links)
- Sampling an edge in sublinear time exactly and optimally (Q6539127) (← links)
- Almost optimal bounds for sublinear-time sampling of \(k\)-cliques in bounded arboricity graphs (Q6560850) (← links)
- Approximating the arboricity in sublinear time (Q6575170) (← links)
- Massively parallel algorithms for small subgraph counting (Q6591892) (← links)
- Triangle counting with local edge differential privacy (Q6638054) (← links)
- Bias reduction for sum estimation (Q6663084) (← links)
