Pierre-Etienne Meunier

According to our database1, Pierre-Etienne Meunier authored at least 23 papers between 2008 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The program-size complexity of self-assembled paths.
CoRR, 2020

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

Non-cooperatively Assembling Large Structures.
Proceedings of the DNA Computing and Molecular Programming - 25th International Conference, 2019

2018
Proving the Turing Universality of Oritatami Co-Transcriptional Folding.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Binary Pattern Tile Set Synthesis Is NP-Hard.
Algorithmica, 2017

The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Self-Assembly at Temperature 1.
Encyclopedia of Algorithms, 2016

Unraveling simplicity in elementary cellular automata.
Theor. Comput. Sci., 2016

A pumping lemma for non-cooperative self-assembly.
CoRR, 2016

Programming Biomolecules That Fold Greedily During Transcription.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Efficient Universal Computation by Greedy Molecular Folding.
CoRR, 2015

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

Non-cooperative Algorithms in Self-assembly.
Proceedings of the Unconventional Computation and Natural Computation, 2015

2014
Noncooperative algorithms in self-assembly.
CoRR, 2014

Intrinsic universality in tile self-assembly requires cooperation.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013
A pumping lemma for non-cooperative self-assembly.
CoRR, 2013

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

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

2011
Communication complexity and intrinsic universality in cellular automata.
Theor. Comput. Sci., 2011

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

The structure of communication problems in cellular automata.
Proceedings of the 17th International Workshop on Cellular Automata and Discrete Complex Systems, 2011

2010
Clandestine Simulations in Cellular Automata.
Proceedings of the Second Symposium on Cellular Automata "Journeacute;es Automates Cellulaires", 2010

2008
Communications in cellular automata
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008


  Loading...