default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDamien Regnault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Sergiu Ivanov, Damien Regnault:
A linear bound for the size of the finite terminal assembly of a directed non-cooperative tile assembly system. CoRR abs/2405.18630 (2024)- 2023
- [b1]Damien Regnault:
Obtaining tilings by self-assembly and self-stabilization. (Formation de pavages par auto-assemblage et auto-stabilisation). University of Paris-Saclay, France, 2023 - [c20]Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault:
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. CONCUR 2023: 33:1-33:17 - [i15]Clément Bertrand, Cinzia Di Giusto, Hanna Klaudel, Damien Regnault:
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata. CoRR abs/2307.03561 (2023) - 2022
- [c19]Jacques Demongeot, Tarek Melliti, Mathilde Noual, Damien Regnault, Sylvain Sené:
On Boolean Automata Isolated Cycles and Tangential Double-Cycles Dynamics. Automata and Complexity 2022: 145-178 - [c18]Eric Angel, Sébastien Morais, Damien Regnault:
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width. Euro-Par 2022: 136-151 - [i14]Eric Angel, Sébastien Morais, Damien Regnault:
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width. CoRR abs/2202.08704 (2022) - [i13]Jacques Demongeot
, Tarek Melliti, Mathilde Noual, Damien Regnault, Sylvain Sené:
Boolean automata isolated cycles and tangential double-cycles dynamics. CoRR abs/2204.10686 (2022) - 2021
- [c17]Pierre-Étienne Meunier, Damien Regnault:
Directed Non-Cooperative Tile Assembly Is Decidable. DNA 2021: 6:1-6:21 - 2020
- [c16]Pierre-Étienne Meunier, Damien Regnault, Damien Woods:
The program-size complexity of self-assembled paths. STOC 2020: 727-737 - [i12]Pierre-Étienne Meunier, Damien Regnault, Damien Woods:
The program-size complexity of self-assembled paths. CoRR abs/2002.04012 (2020) - [i11]Pierre-Étienne Meunier, Damien Regnault:
On the directed tile assembly systems at temperature 1. CoRR abs/2011.09675 (2020)
2010 – 2019
- 2019
- [c15]Pierre-Étienne Meunier, Damien Regnault:
Non-cooperatively Assembling Large Structures. DNA 2019: 120-139 - [i10]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
- [j7]Damien Regnault, Eric Rémila:
Lost in self-stabilization: A local process that aligns connected cells. Theor. Comput. Sci. 736: 41-61 (2018) - 2016
- [c14]Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené:
Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks. ACRI 2016: 182-191 - [c13]Eric Angel, Cédric Chevalier, Franck Ledoux, Sébastien Morais, Damien Regnault:
FPT Approximation Algorithm for Scheduling with Memory Constraints. Euro-Par 2016: 196-208 - [i9]Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené:
Asynchronous simulation of Boolean networks by monotone Boolean networks. CoRR abs/1606.05172 (2016) - [i8]Pierre-Étienne Meunier, Damien Regnault:
A pumping lemma for non-cooperative self-assembly. CoRR abs/1610.07908 (2016) - 2015
- [j6]Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved local search for universal facility location. J. Comb. Optim. 29(1): 237-246 (2015) - [j5]Tarek Melliti, Mathilde Noual, Damien Regnault, Sylvain Sené:
Cycles, double-cycles d'interactions et modes de mise à jour. Tech. Sci. Informatiques 34(4): 401-430 (2015) - [c12]Damien Regnault, Eric Rémila:
Lost in Self-Stabilization. MFCS (1) 2015: 432-443 - [c11]Tarek Melliti, Mathilde Noual, Damien Regnault, Sylvain Sené, Jérémy Sobieraj:
Asynchronous Dynamics of Boolean Automata Double-Cycles. UCNC 2015: 250-262 - 2014
- [i7]Damien Regnault, Eric Rémila:
Lost in Self-stabilization. CoRR abs/1410.7669 (2014) - 2013
- [j4]Mathilde Noual, Damien Regnault, Sylvain Sené:
About non-monotony in Boolean automata networks. Theor. Comput. Sci. 504: 12-25 (2013) - [c10]Tarek Melliti, Damien Regnault, Adrien Richard, Sylvain Sené:
On the Convergence of Boolean Automata Networks without Negative Cycles. Automata 2013: 124-138 - [c9]Eric Angel, Kim Thang Nguyen, Damien Regnault:
Improved Local Search for Universal Facility Location. COCOON 2013: 316-324 - [c8]Damien Regnault:
Proof of a Phase Transition in Probabilistic Cellular Automata. Developments in Language Theory 2013: 433-444 - [i6]Tarek Melliti, Mathilde Noual, Damien Regnault, Sylvain Sené, Jérémy Sobieraj:
Full characterization of attractors for two intersected asynchronous Boolean automata cycles. CoRR abs/1310.5747 (2013) - 2012
- [c7]Mathilde Noual, Damien Regnault, Sylvain Sené:
Boolean networks synchronism sensitivity and XOR circulant networks convergence time. AUTOMATA & JAC 2012: 37-52 - 2011
- [j3]Jean-Baptiste Rouquier, Damien Regnault, Eric Thierry:
Stochastic minority on graphs. Theor. Comput. Sci. 412(30): 3947-3963 (2011) - [i5]Mathilde Noual, Damien Regnault, Sylvain Sené:
Non-monotony and Boolean automata networks. CoRR abs/1111.4552 (2011) - [i4]Thomas Fernique, Damien Regnault:
Stochastic Flips on Dimer Tilings. CoRR abs/1111.7297 (2011) - 2010
- [j2]Damien Regnault, Nicolas Schabanel, Eric Thierry:
On the analysis of "simple" 2D stochastic cellular automata. Discret. Math. Theor. Comput. Sci. 12(2): 263-294 (2010) - [c6]Olivier Bodini, Thomas Fernique, Damien Regnault:
Stochastic Flips on Two-letter Words. ANALCO 2010: 48-55 - [i3]Olivier Bodini, Thomas Fernique, Damien Regnault:
Stochastic Flips on Two-letter Words. CoRR abs/1010.1086 (2010) - [i2]Jean-Baptiste Rouquier, Damien Regnault, Eric Thierry:
Stochastic Minority on Graphs. CoRR abs/1011.5119 (2010)
2000 – 2009
- 2009
- [j1]Damien Regnault, Nicolas Schabanel, Eric Thierry:
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority. Theor. Comput. Sci. 410(47-49): 4844-4855 (2009) - 2008
- [c5]Damien Regnault:
Quick Energy Drop in Stochastic 2D Minority. ACRI 2008: 307-314 - [c4]Damien Regnault, Nicolas Schabanel, Eric Thierry:
On the Analysis of "Simple" 2D Stochastic Cellular Automata. LATA 2008: 452-463 - [c3]Damien Regnault:
Directed Percolation Arising in Stochastic Cellular Automata Analysis. MFCS 2008: 563-574 - 2007
- [c2]Damien Regnault, Nicolas Schabanel, Eric Thierry:
Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority. MFCS 2007: 320-332 - [i1]Damien Regnault, Nicolas Schabanel, Eric Thierry:
Progresses in the Analysis of Stochastic 2D Cellular Automata: a Study of Asynchronous 2D Minority. CoRR abs/0706.2479 (2007) - 2006
- [c1]Nazim Fatès, Damien Regnault, Nicolas Schabanel, Eric Thierry:
Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata. LATIN 2006: 455-466
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-08-05 21:18 CEST 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:
