Pierre-Etienne Meunier

According to our database, Pierre-Etienne Meunier authored at least 25 papers between 2008 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Directed Non-Cooperative Tile Assembly Is Decidable.

Pierre-Étienne Meunier, Damien Regnault

Proceedings of the 27th International Conference on DNA Computing and Molecular Programming, 2021

2020

On the directed tile assembly systems at temperature 1.

Pierre-Étienne Meunier, Damien Regnault

CoRR, 2020

The program-size complexity of self-assembled paths.

Pierre-Étienne Meunier, Damien Regnault, Damien Woods

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019

Non-cooperatively assembling large structures: a 2D pumping lemma cannot be as powerful as its 1D counterpart.

Pierre-Etienne Meunier, Damien Regnault

CoRR, 2019

Non-cooperatively Assembling Large Structures.

Pierre-Étienne Meunier, Damien Regnault

Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019

2018

Proving the Turing Universality of Oritatami Co-Transcriptional Folding.

Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017

Binary Pattern Tile Set Synthesis Is NP-Hard.

Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki

Algorithmica, 2017

The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation.

Pierre-Étienne Meunier, Damien Woods

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Self-Assembly at Temperature 1.

Pierre-Étienne Meunier

Encyclopedia of Algorithms, 2016

Unraveling simplicity in elementary cellular automata.

Pierre-Étienne Meunier

Theor. Comput. Sci., 2016

A pumping lemma for non-cooperative self-assembly.

Pierre-Étienne Meunier, Damien Regnault

CoRR, 2016

Programming Biomolecules That Fold Greedily During Transcription.

Cody W. Geary, Pierre-Etienne Meunier, Nicolas Schabanel, Shinnosuke Seki

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Efficient Universal Computation by Greedy Molecular Folding.

Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki

CoRR, 2015

It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition.

Florent Becker, Pierre-Étienne Meunier

CoRR, 2015

Non-cooperative Algorithms in Self-assembly.

Pierre-Étienne Meunier

Proceedings of the Unconventional Computation and Natural Computation, 2015

2014

Noncooperative algorithms in self-assembly.

Pierre-Étienne Meunier

CoRR, 2014

Intrinsic universality in tile self-assembly requires cooperation.

Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

A pumping lemma for non-cooperative self-assembly.

Pierre-Étienne Meunier

CoRR, 2013

The self-assembly of paths and squares at temperature 1.

Pierre-Étienne Meunier

CoRR, 2013

2012

Les automates cellulaires en tant que modèle de complexités parallèles. (Cellular automata as a model of parallel complexities).

Pierre-Etienne Meunier

PhD thesis, 2012

2011

Communication complexity and intrinsic universality in cellular automata.

Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier

Theor. Comput. Sci., 2011

Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21].

Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier

Theor. Comput. Sci., 2011

The structure of communication problems in cellular automata.

Raimundo Briceño, Pierre-Etienne Meunier

Proceedings of the 17th International Workshop on Cellular Automata and Discrete Complex Systems, 2011

2010

Clandestine Simulations in Cellular Automata.

Pierre Guillon, Pierre-Etienne Meunier, Guillaume Theyssier

Proceedings of the Second Symposium on Cellular Automata "Journées Automates Cellulaires", 2010

2008

Communications in cellular automata

Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier

Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008