Pierre-Etienne Meunier
Pierre-Etienne Meunier
Affiliation inconnue
Adresse e-mail validée de caltech.edu
Titre
Citée par
Citée par
Année
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
662014
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
322011
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
202017
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
202016
Binary pattern tile set synthesis is NP-hard
L Kari, S Kopecki, PÉ Meunier, MJ Patitz, S Seki
Algorithmica 78 (1), 1-46, 2017
142017
Proving the turing universality of oritatami co-transcriptional folding
C Geary, PÉ Meunier, N Schabanel, S Seki
ISAAC 2018-29th International Symposium on Algorithms and Computation, 2018
112018
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
72019
Efficient universal computation by greedy molecular folding
C Geary, P Meunier, N Schabanel, S Seki
CoRR, abs/1508.00510, 2015
72015
Non-cooperative algorithms in self-assembly
PÉ Meunier
International Conference on Unconventional Computation and Natural …, 2015
52015
The self-assembly of paths and squares at temperature 1
PÉ Meunier
arXiv preprint arXiv:1312.1299, 2013
52013
The program-size complexity of self-assembled paths
PÉ Meunier, D Regnault, D Woods
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
42020
Clandestine simulations in cellular automata
P Guillon, PE Meunier, G Theyssier
arXiv preprint arXiv:1009.5621, 2010
32010
Communications in cellular automata
E Goles, PE Meunier, I Rapaport, G Theyssier
arXiv preprint arXiv:0906.3284, 2009
32009
Non-cooperatively assembling large structures
PÉ Meunier, D Regnault
International Conference on DNA Computing and Molecular Programming, 120-139, 2019
22019
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
The structure of communication problems in cellular automata
R Briceno, PE Meunier
Discrete Mathematics and Theoretical Computer Science, 59-76, 2011
22011
Les automates cellulaires en tant que modèle de complexités parallèles
PE Meunier
Université de Grenoble; 417 University of Chile, 2012
12012
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20