6 citations · 20 across the 10 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.CG2014
Noncooperative algorithms in self-assembly
Pierre-Étienne Meunier
We show the first non-trivial positive algorithmic results (i.e. programs whose output is larger than their size), in a model of self-assembly that has so far resisted many attempt…
cs.CC2014
Unraveling simplicity in elementary cellular automata
Pierre-Étienne Meunier
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a…
cs.CC2014★ 2 cited
Binary pattern tile set synthesis is NP-hard
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier +2
In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The -PATS problem…