| No. |
Title |
Author |
Year |
| 1 |
From Big Data Theory to Big Data Practice (Dagstuhl Seminar 23071) |
Farach-Colton, Martin et al. |
2023 |
| 2 |
New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling |
Compton, Spencer et al. |
2023 |
| 3 |
Local Access to Random Walks |
Biswas, Amartya Shankha et al. |
2022 |
| 4 |
Massively Parallel Algorithms for Small Subgraph Counting |
Biswas, Amartya Shankha et al. |
2022 |
| 5 |
Sampling Multiple Edges Efficiently |
Eden, Talya et al. |
2021 |
| 6 |
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time |
Biswas, Amartya Shankha et al. |
2021 |
| 7 |
Local Access to Huge Random Objects Through Partial Sampling |
Biswas, Amartya Shankha et al. |
2020 |
| 8 |
Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples |
Rubinfeld, Ronitt et al. |
2020 |
| 9 |
Approximating the Noise Sensitivity of a Monotone Boolean Function |
Rubinfeld, Ronitt et al. |
2019 |
| 10 |
Local Computation Algorithms for Spanners |
Parter, Merav et al. |
2018 |
| 11 |
Fractional Set Cover in the Streaming Model |
Indyk, Piotr et al. |
2017 |
| 12 |
Local Computation Algorithms (Invited Talk) |
Rubinfeld, Ronitt |
2017 |
| 13 |
A Local Algorithm for Constructing Spanners in Minor-Free Graphs |
Levi, Reut et al. |
2016 |
| 14 |
Testing Shape Restrictions of Discrete Distributions |
Canonne, Clément L. et al. |
2016 |
| 15 |
Local Algorithms for Sparse Spanning Graphs |
Levi, Reut et al. |
2014 |
| 16 |
08341 Abstracts Collection -- Sublinear Algorithms |
Czumaj, Artur et al. |
2008 |
| 17 |
08341 Executive Summary -- Sublinear Algorithms |
Czumaj, Artur et al. |
2008 |
| 18 |
05291 Abstracts Collection -- Sublinear Algorithms |
Czumaj, Artur et al. |
2006 |
