| No. |
Title |
Author |
Year |
| 1 |
A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration |
Brandt, Sebastian et al. |
2018 |
| 2 |
Algorithmic Channel Design |
Avarikioti, Georgia et al. |
2018 |
| 3 |
Impatient Online Matching |
Liu, Xingwu et al. |
2018 |
| 4 |
piChain: When a Blockchain meets Paxos |
Burchert, Conrad et al. |
2018 |
| 5 |
A Tight Lower Bound for the Capture Time of the Cops and Robbers Game |
Brandt, Sebastian et al. |
2017 |
| 6 |
Brief Announcement: Towards Reduced Instruction Sets for Synchronization |
Gelashvili, Rati et al. |
2017 |
| 7 |
Distributed Stable Matching with Similar Preference Lists |
Khanchandani, Pankaj et al. |
2017 |
| 8 |
Min-Cost Bipartite Perfect Matching with Delays |
Ashlagi, Itai et al. |
2017 |
| 9 |
Byzantine Agreement with Median Validity |
Stolz, David et al. |
2016 |
| 10 |
Overcoming Obstacles with Ants |
Langner, Tobias et al. |
2016 |
