No. Title Author Year
1 Sampling Multiple Edges Efficiently Eden, Talya et al. 2021
2 Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time Biswas, Amartya Shankha et al. 2021
3 Sublinear-Time Distributed Algorithms for Detecting Small Cliques and Even Cycles Eden, Talya et al. 2019
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
7 Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection Eden, Talya et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 7


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