EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Deterministic color-optimal self-stabilizing semi-synchronous gathering: Two certified algorithms

François Bonnet, Quentin Bramas, Pierre Courtieu, Xavier Défago, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain

Theoretical Computer Science · 2026-07 · 1078 · 116013

DOI: 10.1016/j.tcs.2026.116013 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von François Bonnet und 6 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Bonnet, F., Bramas, Q., Courtieu, P., Défago, X., Rieg, L., Tixeuil, S., & Urbain, X. (2026). Deterministic color-optimal self-stabilizing semi-synchronous gathering: Two certified algorithms. Theoretical Computer Science, 1078, 116013. https://doi.org/10.1016/j.tcs.2026.116013

Vancouver

Bonnet F, Bramas Q, Courtieu P, Défago X, Rieg L, Tixeuil S, et al. Deterministic color-optimal self-stabilizing semi-synchronous gathering: Two certified algorithms. Theoretical Computer Science. 2026;1078:116013. doi:10.1016/j.tcs.2026.116013

BibTeX
@article{Bonnet2026,
  author = {Bonnet, François and Bramas, Quentin and Courtieu, Pierre and Défago, Xavier and Rieg, Lionel and Tixeuil, Sébastien and Urbain, Xavier},
  title = {Deterministic color-optimal self-stabilizing semi-synchronous gathering: Two certified algorithms},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1078},
  pages = {116013},
  doi = {10.1016/j.tcs.2026.116013}
}
Kostenlos starten →