Dynamic Monopolies of Constant Size
Author:
- Eli BergerEBEli Berger
- 1 November 2001
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 83 (2) , 191-200
Abstract
No abstract availableKeywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Size bounds for dynamic monopoliesDiscrete Applied Mathematics, 1998
- System diagnosis with smallest risk of error1997
- The Availability of Quorum SystemsInformation and Computation, 1995
- Voting as the optimal static pessimistic scheme for managing replicated dataIEEE Transactions on Parallel and Distributed Systems, 1994
- Fault Tolerance in Networks of Bounded DegreeSIAM Journal on Computing, 1988
- An O (log n ) expected rounds randomized byzantine generals protocolJournal of the ACM, 1987
- How to assign votes in a distributed systemJournal of the ACM, 1985
- On periodical behaviour in societies with symmetric influencesCombinatorica, 1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Periodic behaviour of generalized threshold functionsDiscrete Mathematics, 1980