On the parameterized complexity of freezing dynamics

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Simple dynamics on graphs
Fundamentals of parameterized complexity
The complexity of the bootstraping percolation and other problems
Computational complexity of finite asynchronous cellular automata
Bootstrap percolation on the hypercube
Constraint satisfaction with bounded treewidth revisited
Graph minors. V. Excluding a planar graph
Cellular automaton growth on \(\mathbb{Z}^2\): Theorems, examples, and problems
Sharp metastability threshold for two-dimensional bootstrap percolation
Counter machines and distributed automata -- a story about exchanging space and time
Universality in freezing cellular automata
Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity
On the computational complexity of the freezing non-strict majority automata
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
Cellular automata with sparse communication
Bootstrap percolation in power-law random graphs
Nilpotent dynamics on signed interaction graphs and weak converses of Thomas' rules
The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
Polynomial Bounds for the Grid-Minor Theorem
A Brief Tour of Theoretical Tile Self-Assembly
Undirected connectivity in log-space
Complexity of Finding Embeddings in a k-Tree
The Nilpotency Problem of One-Dimensional Cellular Automata
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
Fixed-Parameter Tractability and Completeness I: Basic Results
Computational Complexity
The sharp threshold for bootstrap percolation in all dimensions
Directed Nowhere Dense Classes of Graphs
The complexity of theorem-proving procedures
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata

This page was built for publication: On the parameterized complexity of freezing dynamics