| No. |
Title |
Author |
Year |
|---|
| 1 |
Beeping Shortest Paths via Hypergraph Bipartite Decomposition |
Dufoulon, Fabien et al. |
2023 |
| 2 |
Interactive Coding Resilient to an Unknown Number of Erasures |
Gelles, Ran et al. |
2020 |
| 3 |
Optimal Short-Circuit Resilient Formulas |
Braverman, Mark et al. |
2019 |
| 4 |
Making Asynchronous Distributed Computations Robust to Channel Noise |
Censor-Hillel, Keren et al. |
2018 |
| 5 |
Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks |
Gelles, Ran et al. |
2017 |
| 6 |
Coding for Interactive Communication Correcting Insertions and Deletions |
Braverman, Mark et al. |
2016 |
