Pierre-Étienne Meunier

21 papers A* 2B 3Journal 13Unranked 2
YearRankTypeTitle / Venue / Authors
2021 B conf
Directed Non-Cooperative Tile Assembly Is Decidable.
DNA
Pierre-Étienne Meunier, Damien Regnault
2020 J jnl
On the directed tile assembly systems at temperature 1.
CoRR
Pierre-Étienne Meunier, Damien Regnault
2020 A* conf
The program-size complexity of self-assembled paths.
STOC
Pierre-Étienne Meunier, Damien Regnault, Damien Woods
2020 J jnl
The program-size complexity of self-assembled paths.
CoRR
Pierre-Étienne Meunier, Damien Regnault, Damien Woods
2019 B conf
Non-cooperatively Assembling Large Structures.
DNA
Pierre-Étienne Meunier, Damien Regnault
2018 B conf
Proving the Turing Universality of Oritatami Co-Transcriptional Folding.
ISAAC
Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki
2017 J jnl
Binary Pattern Tile Set Synthesis Is NP-Hard.
Algorithmica
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
2017 A* conf
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation.
STOC
Pierre-Étienne Meunier, Damien Woods
2017 J jnl
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation.
CoRR
Pierre-Étienne Meunier, Damien Woods
2016 J jnl
A pumping lemma for non-cooperative self-assembly.
CoRR
Pierre-Étienne Meunier, Damien Regnault
2016 — ch.
Self-Assembly at Temperature 1.
Encyclopedia of Algorithms
Pierre-Étienne Meunier
2016 J jnl
Unraveling simplicity in elementary cellular automata.
Theor. Comput. Sci.
Pierre-Étienne Meunier
2015 — conf
Binary Pattern Tile Set Synthesis Is NP-hard.
ICALP (1)
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
2015 J jnl
Efficient Universal Computation by Greedy Molecular Folding.
CoRR
Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki
2015 J jnl
It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition.
CoRR
Florent Becker, Pierre-Étienne Meunier
2015 — conf
Non-cooperative Algorithms in Self-assembly.
UCNC
Pierre-Étienne Meunier
2014 J jnl
Binary pattern tile set synthesis is NP-hard.
CoRR
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki
2014 J jnl
Noncooperative algorithms in self-assembly.
CoRR
Pierre-Étienne Meunier
2014 J jnl
Unraveling simplicity in elementary cellular automata.
CoRR
Pierre-Étienne Meunier
2013 J jnl
A pumping lemma for non-cooperative self-assembly.
CoRR
Pierre-Étienne Meunier
2013 J jnl
The self-assembly of paths and squares at temperature 1.
CoRR
Pierre-Étienne Meunier