A combinatorial characterization of the distributed 1-solvable tasks
- 3 September 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (3) , 420-440
- https://doi.org/10.1016/0196-6774(90)90020-f
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Computing on an anonymous ringJournal of the ACM, 1988
- Extended impossibility results for asynchronous complete networksInformation Processing Letters, 1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Reaching approximate agreement in the presence of faultsJournal of the ACM, 1986
- Easy impossibility proofs for distributed consensus problemsDistributed Computing, 1986
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982