Pierre-Etienne Meunier
Pierre-Etienne Meunier
Unknown affiliation
Verified email at caltech.edu
TitleCited byYear
Intrinsic universality in tile self-assembly requires cooperation
PE Meunier, MJ Patitz, SM Summers, G Theyssier, A Winslow, D Woods
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
622014
Communication complexity and intrinsic universality in cellular automata
E Goles, PE Meunier, I Rapaport, G Theyssier
Theoretical Computer Science 412 (1-2), 2-21, 2011
282011
Programming biomolecules that fold greedily during transcription
C Geary, PÉ Meunier, N Schabanel, S Seki
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
152016
Binary pattern tile set synthesis is NP-hard
L Kari, S Kopecki, PÉ Meunier, MJ Patitz, S Seki
Algorithmica 78 (1), 1-46, 2017
132017
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
PÉ Meunier, D Woods
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
112017
Efficient universal computation by greedy molecular folding
C Geary, P Meunier, N Schabanel, S Seki
CoRR, abs/1508.00510, 2015
72015
The self-assembly of paths and squares at temperature 1
PÉ Meunier
arXiv preprint arXiv:1312.1299, 2013
52013
Proving the Turing Universality of Oritatami Co-Transcriptional Folding
C Geary, PÉ Meunier, N Schabanel, S Seki
32017
Non-cooperative algorithms in self-assembly
PÉ Meunier
International Conference on Unconventional Computation and Natural …, 2015
32015
Communications in cellular automata
E Goles, PE Meunier, I Rapaport, G Theyssier
arXiv preprint arXiv:0906.3284, 2009
32009
Folding Turing is hard but feasible
C Geary, PE Meunier, N Schabanel, S Seki
arXiv preprint arXiv:1508.00510, 2017
22017
A pumping lemma for non-cooperative self-assembly
PÉ Meunier, D Regnault
arXiv preprint arXiv:1610.07908, 2016
22016
Unraveling simplicity in elementary cellular automata
PÉ Meunier
Theoretical Computer Science 641, 2-10, 2016
22016
It's a tough nanoworld: in tile assembly, cooperation is not (strictly) more powerful than competition
F Becker, PÉ Meunier
arXiv preprint arXiv:1502.05558, 2015
22015
Clandestine simulations in cellular automata
P Guillon, PE Meunier, G Theyssier
arXiv preprint arXiv:1009.5621, 2010
22010
Oritatami: A Computational Model for Molecular Co-Transcriptional Folding
C Geary, PÉ Meunier, N Schabanel, S Seki
International journal of molecular sciences 20 (9), 2259, 2019
12019
Les automates cellulaires en tant que modèle de complexités parallèles
PE Meunier
Université de Grenoble, 2012
12012
The structure of communication problems in cellular automata
R Briceno, PE Meunier
12011
Non-cooperatively Assembling Large Structures
PÉ Meunier, D Regnault
International Conference on DNA Computing and Molecular Programming, 120-139, 2019
2019
Non-cooperatively assembling large structures: a 2D pumping lemma cannot be as powerful as its 1D counterpart
PE Meunier, D Regnault
arXiv preprint arXiv:1902.02253, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20