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 | 65 | 2014 |

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 | 32 | 2011 |

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 | 19 | 2016 |

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 | 18 | 2017 |

Binary pattern tile set synthesis is NP-hard L Kari, S Kopecki, PÉ Meunier, MJ Patitz, S Seki Algorithmica 78 (1), 1-46, 2017 | 14 | 2017 |

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 | 10 | 2018 |

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 | 7 | 2019 |

Efficient universal computation by greedy molecular folding C Geary, P Meunier, N Schabanel, S Seki CoRR, abs/1508.00510, 2015 | 7 | 2015 |

The self-assembly of paths and squares at temperature 1 PÉ Meunier arXiv preprint arXiv:1312.1299, 2013 | 5 | 2013 |

Non-cooperative algorithms in self-assembly PÉ Meunier International Conference on Unconventional Computation and Natural …, 2015 | 4 | 2015 |

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 | 3 | 2020 |

Clandestine simulations in cellular automata P Guillon, PE Meunier, G Theyssier arXiv preprint arXiv:1009.5621, 2010 | 3 | 2010 |

Communications in cellular automata E Goles, PE Meunier, I Rapaport, G Theyssier arXiv preprint arXiv:0906.3284, 2009 | 3 | 2009 |

Folding Turing is hard but feasible C Geary, PE Meunier, N Schabanel, S Seki arXiv preprint arXiv:1508.00510, 2017 | 2 | 2017 |

A pumping lemma for non-cooperative self-assembly PÉ Meunier, D Regnault arXiv preprint arXiv:1610.07908, 2016 | 2 | 2016 |

Unraveling simplicity in elementary cellular automata PÉ Meunier Theoretical Computer Science 641, 2-10, 2016 | 2 | 2016 |

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 | 2 | 2015 |

The structure of communication problems in cellular automata R Briceno, PE Meunier Discrete Mathematics and Theoretical Computer Science, 59-76, 2011 | 2 | 2011 |

Non-cooperatively assembling large structures PÉ Meunier, D Regnault International Conference on DNA Computing and Molecular Programming, 120-139, 2019 | 1 | 2019 |

Les automates cellulaires en tant que modèle de complexités parallèles PE Meunier Université de Grenoble; 417 University of Chile, 2012 | 1 | 2012 |