How to assign votes in a distributed system
Journal of the ACM (JACM)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
On an application of convexity to discrete systems
Discrete Applied Mathematics
Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
An O(log n) expected rounds randomized byzantine generals protocol
Journal of the ACM (JACM)
The number of fixed points of the majority rule
Discrete Mathematics
Fault tolerance in networks of bounded degree
SIAM Journal on Computing
An optimal synchronizer for the hypercube
SIAM Journal on Computing
Neural and automata networks: dynamical behavior and applications
Neural and automata networks: dynamical behavior and applications
On a paper of Agur, Fraenkel and Klein
Discrete Mathematics
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The r-majority vote action on 0-1 sequences
Discrete Mathematics
Parametrization for stationary patterns of the r-majority operators on 0-1 sequences
Discrete Mathematics
Eigenvalues and expansion of regular graphs
Journal of the ACM (JACM)
The availability of quorum systems
Information and Computation
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Time-adaptive self stabilization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Testing and reconfiguration of VLSI linear arrays
Theoretical Computer Science
Size bounds for dynamic monopolies
Discrete Applied Mathematics
Fault-local distributed mending
Journal of Algorithms
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms
SIAM Journal on Computing
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
IEEE Transactions on Parallel and Distributed Systems
On the Complexity of Testing for Catastrophic Faults
ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
System Diagnosis with Smallest Risk of Error
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
REPLICATION METHODS FOR ABSTRACT DATA TYPES
REPLICATION METHODS FOR ABSTRACT DATA TYPES
Graph Immunity Against Local Influence
Graph Immunity Against Local Influence
The complexity of system-level fault diagnosis and diagnosability
The complexity of system-level fault diagnosis and diagnosability
Probabilistic local majority voting for the agreement problem on finite graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On Majority Voting Games in Trees
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
The power of small coalitions in graphs
Discrete Applied Mathematics
On time versus size for monotone dynamic monopolies in regular topologies
Journal of Discrete Algorithms
Revocation games in ephemeral networks
Proceedings of the 15th ACM conference on Computer and communications security
Global defensive alliances in star graphs
Discrete Applied Mathematics
Theoretical Computer Science
Efficient control of epidemics over random networks
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
An exact almost optimal algorithm for target set selection in social networks
Proceedings of the 10th ACM conference on Electronic commerce
Near-optimal solutions for the generalized max-controlled set problem
Computers and Operations Research
On dissemination thresholds in regular and irregular graph classes
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Distributed anonymous function computation in information fusion and multiagent systems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Note: Combinatorial model and bounds for target set selection
Theoretical Computer Science
Brief announcement: on reversible and irreversible conversions
DISC'10 Proceedings of the 24th international conference on Distributed computing
Network decontamination with local immunization
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Irreversible conversion of graphs
Theoretical Computer Science
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Dynamic monopolies and feedback vertex sets in hexagonal grids
Computers & Mathematics with Applications
Global defensive alliances of trees and Cartesian product of paths and cycles
Discrete Applied Mathematics
Bounding the number of tolerable faults in majority-based systems
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Stable sets of threshold-based cascades on the erdős-rényi random graphs
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On the non-progressive spread of influence through social networks
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Triggering cascades on undirected connected graphs
Information Processing Letters
Treewidth governs the complexity of target set selection
Discrete Optimization
Reversible iterative graph processes
Theoretical Computer Science
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science
Minimum weight dynamo and fast opinion spreading
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Immediate versus eventual conversion: comparing geodetic and hull numbers in P3-convexity
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Constant thresholds can make target set selection tractable
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics
A New Model for Probabilistic Polling on Social Network
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
| Hi-index | 5.23 |
This paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints.