No. |
Title |
Author |
Year |
---|

1 |
Local Access to Random Walks |
Biswas, Amartya Shankha et al. |
2022 |

2 |
Massively Parallel Algorithms for Small Subgraph Counting |
Biswas, Amartya Shankha et al. |
2022 |

3 |
Sampling Multiple Edges Efficiently |
Eden, Talya et al. |
2021 |

4 |
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time |
Biswas, Amartya Shankha et al. |
2021 |

5 |
Local Access to Huge Random Objects Through Partial Sampling |
Biswas, Amartya Shankha et al. |
2020 |

6 |
Monotone Probability Distributions over the Boolean Cube Can Be Learned with Sublinear Samples |
Rubinfeld, Ronitt et al. |
2020 |

7 |
Approximating the Noise Sensitivity of a Monotone Boolean Function |
Rubinfeld, Ronitt et al. |
2019 |

8 |
Local Computation Algorithms for Spanners |
Parter, Merav et al. |
2018 |

9 |
Fractional Set Cover in the Streaming Model |
Indyk, Piotr et al. |
2017 |

10 |
Local Computation Algorithms (Invited Talk) |
Rubinfeld, Ronitt |
2017 |

11 |
A Local Algorithm for Constructing Spanners in Minor-Free Graphs |
Levi, Reut et al. |
2016 |

12 |
Testing Shape Restrictions of Discrete Distributions |
Canonne, ClĂ©ment L. et al. |
2016 |

13 |
Local Algorithms for Sparse Spanning Graphs |
Levi, Reut et al. |
2014 |

14 |
08341 Abstracts Collection -- Sublinear Algorithms |
Czumaj, Artur et al. |
2008 |

15 |
08341 Executive Summary -- Sublinear Algorithms |
Czumaj, Artur et al. |
2008 |

16 |
05291 Abstracts Collection -- Sublinear Algorithms |
Czumaj, Artur et al. |
2006 |