Studienprotokoll
A Nearly Time-Optimal Population Protocol for Self-Stabilizing Leader Election on Rings with Polylogarithmic States
Theoretical Computer Science · 2026-11 · 116325
DOI: 10.1016/j.tcs.2026.116325 ↗Kurz gefasst
Studienprotokoll in der Zeitschrift Theoretical Computer Science, 2026-11. Verfasst von Daisuke Yokota und 3 weiteren Autor:innen. Die Arbeit nennt 34 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Yokota, D., Sudo, Y., Ooshita, F., & Masuzawa, T. (2026). A Nearly Time-Optimal Population Protocol for Self-Stabilizing Leader Election on Rings with Polylogarithmic States. Theoretical Computer Science, 116325. https://doi.org/10.1016/j.tcs.2026.116325
Vancouver
Yokota D, Sudo Y, Ooshita F, Masuzawa T. A Nearly Time-Optimal Population Protocol for Self-Stabilizing Leader Election on Rings with Polylogarithmic States. Theoretical Computer Science. 2026:116325. doi:10.1016/j.tcs.2026.116325
BibTeX
@article{Yokota2026,
author = {Yokota, Daisuke and Sudo, Yuichi and Ooshita, Fukuhito and Masuzawa, Toshimitsu},
title = {A Nearly Time-Optimal Population Protocol for Self-Stabilizing Leader Election on Rings with Polylogarithmic States},
journal = {Theoretical Computer Science},
year = {2026},
pages = {116325},
doi = {10.1016/j.tcs.2026.116325}
}
EUVIMED