Author:
Blin Lélia,Le Bouder Gabriel,Petit Franck
Publisher
Springer Nature Switzerland
Reference23 articles.
1. Blin, L., Boubekeur, F., Dubois, S.: A self-stabilizing memory efficient algorithm for the minimum diameter spanning tree under an omnipotent daemon. J. Parallel Distrib. Comput. 117, 50–62 (2018)
2. Lecture Notes in Computer Science;L Blin,2020
3. Blin, L., Feuilloley, L., Le Bouder, G.: Optimal space lower bound for deterministic self-stabilizing leader election algorithms. Discret. Math. Theor. Comput. Sci. 25 (2023). https://doi.org/10.46298/dmtcs.9335
4. Blin, L., Le Bouder, G., Petit, F.: Optimal memory requirement for self-stabilizing token circulation. Technical report, HAL Open Science (2024). https://hal.science/hal-04448960
5. Lecture Notes in Computer Science;L Blin,2009