| No. |
Title |
Author |
Year |
| 1 |
Distance Computations in the Hybrid Network Model via Oracle Simulations |
Censor-Hillel, Keren et al. |
2021 |
| 2 |
Distributed Distance Approximation |
Ancona, Bertie et al. |
2021 |
| 3 |
Distributed Subgraph Finding: Progress and Challenges (Invited Talk) |
Censor-Hillel, Keren |
2021 |
| 4 |
Fast Deterministic Algorithms for Highly-Dynamic Networks |
Censor-Hillel, Keren et al. |
2021 |
| 5 |
Fault Tolerant Max-Cut |
Censor-Hillel, Keren et al. |
2021 |
| 6 |
Locally Checkable Labelings with Small Messages |
Balliu, Alkida et al. |
2021 |
| 7 |
Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract) |
Censor-Hillel, Keren |
2020 |
| 8 |
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs |
Censor-Hillel, Keren et al. |
2020 |
| 9 |
Distributed Detection of Cliques in Dynamic Networks |
Bonne, Matthias et al. |
2019 |
| 10 |
Distributed Reconfiguration of Maximal Independent Sets |
Censor-Hillel, Keren et al. |
2019 |
| 11 |
Erasure Correction for Noisy Radio Networks |
Censor-Hillel, Keren et al. |
2019 |
| 12 |
Fast Distributed Approximation for TAP and 2-Edge-Connectivity |
Censor-Hillel, Keren et al. |
2018 |
| 13 |
Making Asynchronous Distributed Computations Robust to Channel Noise |
Censor-Hillel, Keren et al. |
2018 |
| 14 |
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model |
Censor-Hillel, Keren et al. |
2018 |
| 15 |
The Sparsest Additive Spanner via Multiple Weighted BFS Trees |
Censor-Hillel, Keren et al. |
2018 |
| 16 |
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions |
Censor-Hillel, Keren et al. |
2017 |
| 17 |
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model |
Censor-Hillel, Keren et al. |
2017 |
