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

1 |
Sample-Based Distance-Approximation for Subsequence-Freeness |
Cohen Sidon, Omer et al. |
2023 |

2 |
Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques in Bounded Arboricity Graphs |
Eden, Talya et al. |
2022 |

3 |
Testing Distributions of Huge Objects |
Goldreich, Oded et al. |
2022 |

4 |
Testing Dynamic Environments: Back to Basics |
Nakar, Yonatan et al. |
2021 |

5 |
Almost Optimal Distribution-Free Sample-Based Testing of k-Modality |
Ron, Dana et al. |
2020 |

6 |
The Arboricity Captures the Complexity of Sampling Edges |
Eden, Talya et al. |
2019 |

7 |
On the Testability of Graph Partition Properties |
Nakar, Yonatan et al. |
2018 |

8 |
The Subgraph Testing Model |
Goldreich, Oded et al. |
2018 |

9 |
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection |
Eden, Talya et al. |
2017 |

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

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

12 |
Approximating Average Parameters of Graphs |
Goldreich, Oded et al. |
2006 |