Clocked population protocols
From MaRDI portal
Publication:2040025
DOI10.1016/j.jcss.2021.05.001OpenAlexW3163190310MaRDI QIDQ2040025
Publication date: 6 July 2021
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2021.05.001
Cites Work
- Unnamed Item
- Mediated population protocols
- Passively mobile communicating machines that use restricted space
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Computation with finite stochastic chemical reaction networks
- The method of forced enumeration for nondeterministic automata
- The computational power of population protocols
- On the power of oracle \(\varOmega ?\) for self-stabilizing leader election in population protocols
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- All Symmetric Predicates in NSPACE(n 2) Are Stably Computable by the Mediated Population Protocol Model
- Relational queries computable in polynomial time
- Nondeterministic Space is Closed under Complementation
- Alternation
- Infinite time Turing machines
- Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
- Clocked Population Protocols
- Counter machines and counter languages
