Majority-Vote Cellular Automata, Ising Dynamics, and P-Completeness

Limits to parallel computation: P-completeness theory

Choice Reviews Online · 1996 · 422 citations

Computing, Computer Science, Parallel Algorithms +10

Universal Computation in Simple One-Dimensional Cellular Automata

Kristian Lindgren, Mats G. Nordahl · Chalmers Publication Library (Chalmers University of Technology) · 1990 · 144 citations

Computing, Computer Science, Algorithms +14

Quasilinear cellular automata

Cristopher Moore · Physica D Nonlinear Phenomena · 1997 · 38 citations · Full text

A space efficient algorithm for the monotone planar circuit value problem

Leslie M. Goldschlager · Information Processing Letters · 1980 · 29 citations

Computing, Computer Engineering, Computer Science +9

5 The Computational Complexity of Generating Random Fractals

1996 · 23 citations

Natural Sciences, Computer Science, Mathematics +8