| No. |
Title |
Author |
Year |
| 1 |
Beeping Shortest Paths via Hypergraph Bipartite Decomposition |
Dufoulon, Fabien et al. |
2023 |
| 2 |
Design of Self-Stabilizing Approximation Algorithms via a Primal-Dual Approach |
Emek, Yuval et al. |
2023 |
| 3 |
On the Runtime of Chemical Reaction Networks Beyond Idealized Conditions |
Condon, Anne et al. |
2023 |
| 4 |
Online Algorithms with Randomly Infused Advice |
Emek, Yuval et al. |
2023 |
| 5 |
Locally Restricted Proof Labeling Schemes |
Emek, Yuval et al. |
2022 |
| 6 |
Online Paging with a Vanishing Regret |
Emek, Yuval et al. |
2021 |
| 7 |
Communication Efficient Self-Stabilizing Leader Election |
Défago, Xavier et al. |
2020 |
| 8 |
Low Diameter Graph Decompositions by Approximate Distance Computation |
Becker, Ruben et al. |
2020 |
| 9 |
Towards Distributed Two-Stage Stochastic Optimization |
Emek, Yuval et al. |
2020 |
| 10 |
Twenty-Two New Approximate Proof Labeling Schemes |
Emek, Yuval et al. |
2020 |
| 11 |
Bayesian Generalized Network Design |
Emek, Yuval et al. |
2019 |
| 12 |
Deterministic Leader Election in Programmable Matter |
Emek, Yuval et al. |
2019 |
| 13 |
Distributed Algorithms for Low Stretch Spanning Trees |
Becker, Ruben et al. |
2019 |
| 14 |
Message Reduction in the LOCAL Model Is a Free Lunch |
Bitton, Shimon et al. |
2019 |
| 15 |
Online Disjoint Set Cover Without Prior Knowledge |
Emek, Yuval et al. |
2019 |
| 16 |
Selecting a Leader in a Network of Finite State Machines |
Afek, Yehuda et al. |
2018 |
| 17 |
The Synergy of Finite State Machines |
Afek, Yehuda et al. |
2018 |
| 18 |
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game |
Brandt, Sebastian et al. |
2017 |
| 19 |
Brief Announcement: The Synergy of Finite State Machines |
Afek, Yehuda et al. |
2017 |
