An introduction to parallel algorithms
An introduction to parallel algorithms
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
An $\cal NC$ Algorithm for Evaluating Monotone Planar Circuits
SIAM Journal on Computing
Random disease on the square grid
proceedings of the eighth international conference on Random structures and algorithms
ContagAlert: Using Contagion Theory for Adaptive, Distributed Alert Propagation
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Encyclopedia of Complexity and Systems Science - v. 1-10
Encyclopedia of Complexity and Systems Science - v. 1-10
On Dissemination Thresholds in Regular and Irregular Graph Classes
Algorithmica - Special Issue: Latin American Theoretical Informatics
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 5.23 |
We study the problem of predicting the state of a vertex in automata networks, where the state at each site is given by the majority function over its neighborhood. We show that for networks with maximum degree greater than 5 the problem is P-Complete, simulating a monotone Boolean circuit. Then, we show that the problem for networks with no vertex with degree greater than 4 is in NC, giving a fast parallel algorithm. Finally, we apply the result to the study of related problems.