| No. |
Title |
Author |
Year |
| 1 |
Computational Power of a Single Oblivious Mobile Agent in Two-Edge-Connected Graphs |
Inoue, Taichi et al. |
2023 |
| 2 |
Gathering of Mobile Robots with Defected Views |
Kim, Yonghwan et al. |
2023 |
| 3 |
Brief Announcement: Gathering Despite Defected View |
Kim, Yonghwan et al. |
2022 |
| 4 |
Time-Optimal Loosely-Stabilizing Leader Election in Population Protocols |
Sudo, Yuichi et al. |
2021 |
| 5 |
Communication Efficient Self-Stabilizing Leader Election |
Défago, Xavier et al. |
2020 |
| 6 |
Tight Bounds on Distributed Exploration of Temporal Graphs |
Gotoh, Tsuyoshi et al. |
2020 |
| 7 |
Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time |
Sudo, Yuichi et al. |
2018 |
| 8 |
Loosely-Stabilizing Leader Election with Polylogarithmic Convergence Time |
Sudo, Yuichi et al. |
2018 |
| 9 |
Self-Stabilizing Token Distribution with Constant-Space for Trees |
Sudo, Yuichi et al. |
2018 |
| 10 |
Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers |
Sudo, Yuichi et al. |
2016 |
| 11 |
Maximum Matching for Anonymous Trees with Constant Space per Process |
Datta, Ajoy K. et al. |
2016 |
