No. Title Author Year
1 Local Access to Random Walks Biswas, Amartya Shankha et al. 2022
2 Sampling Multiple Edges Efficiently Eden, Talya et al. 2021
3 Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time Biswas, Amartya Shankha et al. 2021
4 Local Access to Huge Random Objects Through Partial Sampling Biswas, Amartya Shankha et al. 2020
5 Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples Rubinfeld, Ronitt et al. 2020
6 Approximating the Noise Sensitivity of a Monotone Boolean Function Rubinfeld, Ronitt et al. 2019
7 Local Computation Algorithms for Spanners Parter, Merav et al. 2018
8 Fractional Set Cover in the Streaming Model Indyk, Piotr et al. 2017
9 Local Computation Algorithms (Invited Talk) Rubinfeld, Ronitt 2017
10 A Local Algorithm for Constructing Spanners in Minor-Free Graphs Levi, Reut et al. 2016
11 Testing Shape Restrictions of Discrete Distributions Canonne, Clément L. et al. 2016
12 Local Algorithms for Sparse Spanning Graphs Levi, Reut et al. 2014
13 08341 Abstracts Collection -- Sublinear Algorithms Czumaj, Artur et al. 2008
14 08341 Executive Summary -- Sublinear Algorithms Czumaj, Artur et al. 2008
15 05291 Abstracts Collection -- Sublinear Algorithms Czumaj, Artur et al. 2006
Current Page :
Number of result pages: 1
Number of documents: 15


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