No. Title Author Year
1 Bias Reduction for Sum Estimation Eden, Talya et al. 2023
2 Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs Eden, Talya et al. 2022
3 Packet Forwarding with a Locally Bursty Adversary Rosenbaum, Will 2022
4 The Arboricity Captures the Complexity of Sampling Edges Eden, Talya et al. 2019
5 Lower Bounds for Approximating Graph Parameters via Communication Complexity Eden, Talya et al. 2018
6 On Sampling Edges Almost Uniformly Eden, Talya et al. 2018
Current Page :
Number of result pages: 1
Number of documents: 6

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI