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

1 |
Beeping Shortest Paths via Hypergraph Bipartite Decomposition |
Dufoulon, Fabien et al. |
2023 |

2 |
Locally Restricted Proof Labeling Schemes |
Emek, Yuval et al. |
2022 |

3 |
Online Paging with a Vanishing Regret |
Emek, Yuval et al. |
2021 |

4 |
Communication Efficient Self-Stabilizing Leader Election |
DÃ©fago, Xavier et al. |
2020 |

5 |
Low Diameter Graph Decompositions by Approximate Distance Computation |
Becker, Ruben et al. |
2020 |

6 |
Towards Distributed Two-Stage Stochastic Optimization |
Emek, Yuval et al. |
2020 |

7 |
Twenty-Two New Approximate Proof Labeling Schemes |
Emek, Yuval et al. |
2020 |

8 |
Bayesian Generalized Network Design |
Emek, Yuval et al. |
2019 |

9 |
Deterministic Leader Election in Programmable Matter |
Emek, Yuval et al. |
2019 |

10 |
Distributed Algorithms for Low Stretch Spanning Trees |
Becker, Ruben et al. |
2019 |

11 |
Message Reduction in the LOCAL Model Is a Free Lunch |
Bitton, Shimon et al. |
2019 |

12 |
Online Disjoint Set Cover Without Prior Knowledge |
Emek, Yuval et al. |
2019 |

13 |
Selecting a Leader in a Network of Finite State Machines |
Afek, Yehuda et al. |
2018 |

14 |
The Synergy of Finite State Machines |
Afek, Yehuda et al. |
2018 |

15 |
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game |
Brandt, Sebastian et al. |
2017 |

16 |
Brief Announcement: The Synergy of Finite State Machines |
Afek, Yehuda et al. |
2017 |