The epigenetic consensus problem
From MaRDI portal
Publication:2117720
Cites work
- A biological solution to a fundamental distributed computing problem
- Concurrent programming: algorithms, principles, and foundations.
- Coordination without prior agreement
- Easy impossibility proofs for distributed consensus problems
- Fast randomized consensus using shared memory
- scientific article; zbMATH DE number 432838 (Why is no real title available?)
- scientific article; zbMATH DE number 3885030 (Why is no real title available?)
- scientific article; zbMATH DE number 3819094 (Why is no real title available?)
- scientific article; zbMATH DE number 928746 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Randomized protocols for asynchronous consensus
- Reaching Agreement in the Presence of Faults
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Space-efficient asynchronous consensus without shared memory initialization
- The Byzantine Generals Problem
- Wait-free consensus with infinite arrivals
Cited in
(4)- Election in fully anonymous shared memory systems: tight space bounds and algorithms
- A visit to mutual exclusion in seven dates
- Brief announcement: Understanding read-write wait-free coverings in the fully-anonymous shared-memory model
- Majority consensus thresholds in competitive Lotka-Volterra populations
This page was built for publication: The epigenetic consensus problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117720)