default search action
Pierre-Etienne Meunier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c12]Pierre-Étienne Meunier, Damien Regnault:
Directed Non-Cooperative Tile Assembly Is Decidable. DNA 2021: 6:1-6:21 - 2020
- [c11]Pierre-Étienne Meunier, Damien Regnault, Damien Woods
:
The program-size complexity of self-assembled paths. STOC 2020: 727-737 - [i15]Pierre-Étienne Meunier, Damien Regnault, Damien Woods:
The program-size complexity of self-assembled paths. CoRR abs/2002.04012 (2020) - [i14]Pierre-Étienne Meunier, Damien Regnault:
On the directed tile assembly systems at temperature 1. CoRR abs/2011.09675 (2020)
2010 – 2019
- 2019
- [c10]Pierre-Étienne Meunier, Damien Regnault:
Non-cooperatively Assembling Large Structures. DNA 2019: 120-139 - [i13]Pierre-Etienne Meunier, Damien Regnault:
Non-cooperatively assembling large structures: a 2D pumping lemma cannot be as powerful as its 1D counterpart. CoRR abs/1902.02253 (2019) - 2018
- [c9]Cody W. Geary
Proving the Turing Universality of Oritatami Co-Transcriptional Folding. ISAAC 2018: 23:1-23:13 - 2017
- [j4]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz
Binary Pattern Tile Set Synthesis Is NP-Hard. Algorithmica 78(1): 1-46 (2017) - [c8]Pierre-Étienne Meunier, Damien Woods
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. STOC 2017: 328-341 - [i12]Pierre-Étienne Meunier, Damien Woods:
The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation. CoRR abs/1702.00353 (2017) - 2016
- [j3]Pierre-Étienne Meunier:
Unraveling simplicity in elementary cellular automata. Theor. Comput. Sci. 641: 2-10 (2016) - [c7]Cody W. Geary
Programming Biomolecules That Fold Greedily During Transcription. MFCS 2016: 43:1-43:14 - [r1]Pierre-Étienne Meunier:
Self-Assembly at Temperature 1. Encyclopedia of Algorithms 2016: 1913-1918 - [i11]Pierre-Étienne Meunier, Damien Regnault:
A pumping lemma for non-cooperative self-assembly. CoRR abs/1610.07908 (2016) - 2015
- [c6]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz
Binary Pattern Tile Set Synthesis Is NP-hard. ICALP (1) 2015: 1022-1034 - [c5]Pierre-Étienne Meunier:
Non-cooperative Algorithms in Self-assembly. UCNC 2015: 263-276 - [i10]Florent Becker, Pierre-Étienne Meunier:
It's a Tough Nanoworld: in Tile Assembly, Cooperation is not (strictly) more Powerful than Competition. CoRR abs/1502.05558 (2015) - [i9]Cody W. Geary, Pierre-Étienne Meunier, Nicolas Schabanel, Shinnosuke Seki:
Efficient Universal Computation by Greedy Molecular Folding. CoRR abs/1508.00510 (2015) - 2014
- [c4]Pierre-Etienne Meunier, Matthew J. Patitz
Intrinsic universality in tile self-assembly requires cooperation. SODA 2014: 752-771 - [i8]Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary pattern tile set synthesis is NP-hard. CoRR abs/1404.0967 (2014) - [i7]Pierre-Étienne Meunier:
Unraveling simplicity in elementary cellular automata. CoRR abs/1406.5306 (2014) - [i6]Pierre-Étienne Meunier:
Noncooperative algorithms in self-assembly. CoRR abs/1406.6889 (2014) - 2013
- [i5]Pierre-Etienne Meunier, Matthew J. Patitz, Scott M. Summers, Guillaume Theyssier, Andrew Winslow, Damien Woods:
Intrinsic universality in tile self-assembly requires cooperation. CoRR abs/1304.1679 (2013) - [i4]Pierre-Étienne Meunier:
The self-assembly of paths and squares at temperature 1. CoRR abs/1312.1299 (2013) - [i3]Pierre-Étienne Meunier:
A pumping lemma for non-cooperative self-assembly. CoRR abs/1312.6668 (2013) - 2012
- [b1]Pierre-Etienne Meunier:
Les automates cellulaires en tant que modèle de complexités parallèles. (Cellular automata as a model of parallel complexities). Grenoble Alpes University, France, 2012 - 2011
- [j2]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport
Communication complexity and intrinsic universality in cellular automata. Theor. Comput. Sci. 412(1-2): 2-21 (2011) - [j1]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]. Theor. Comput. Sci. 412(52): 7169-7170 (2011) - [c3]Raimundo Briceño, Pierre-Etienne Meunier:
The structure of communication problems in cellular automata. Automata 2011: 59-76 - 2010
- [c2]Pierre Guillon, Pierre-Etienne Meunier, Guillaume Theyssier:
Clandestine Simulations in Cellular Automata. JAC 2010: 133-144 - [i2]Pierre Guillon, Pierre-Etienne Meunier, Guillaume Theyssier:
Clandestine Simulations in Cellular Automata. CoRR abs/1009.5621 (2010)
2000 – 2009
- 2009
- [i1]Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communication Complexity and Intrinsic Universality in Cellular Automata. CoRR abs/0912.1777 (2009) - 2008
- [c1]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communications in cellular automata. CSP 2008: 81-92
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-17 20:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: