scientific article; zbMATH DE number 7561458
From MaRDI portal
Publication:5091108
DOI10.4230/LIPIcs.OPODIS.2018.30MaRDI QIDQ5091108
Fukuhito Ooshita, Hirotsugu Kakugawa, Lawrence L. Larmore, Yuichi Sudo, Toshimitsu Masuzawa, Ajoy K. Datta
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)
Related Items (2)
A combinatorial characterization of self-stabilizing population protocols ⋮ Loosely-stabilizing leader election with polylogarithmic convergence time
Cites Work
- Unnamed Item
- Loosely-stabilizing leader election in a population protocol model
- How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
- On space complexity of self-stabilizing leader election in mediated population protocol
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Fast and Exact Majority in Population Protocols
- Polylogarithmic-Time Leader Election in Population Protocols
- On Space and Time Complexity of Loosely-Stabilizing Leader Election
- Loosely-Stabilizing Leader Election on Arbitrary Graphs in Population Protocols Without Identifiers nor Random Numbers
- Probability and Computing
This page was built for publication: