Damien Regnault

According to our database1, Damien Regnault authored at least 32 papers between 2006 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Complexity of Membership and Non-Emptiness Problems in Unbounded Memory Automata.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

Obtaining tilings by self-assembly and self-stabilization. (Formation de pavages par auto-assemblage et auto-stabilisation).
, 2023

2022
A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graph with Bounded Tree-width.
CoRR, 2022

A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width.
Proceedings of the Euro-Par 2022: Parallel Processing, 2022

On Boolean Automata Isolated Cycles and Tangential Double-Cycles Dynamics.
Proceedings of the Automata and Complexity, 2022

2021
Directed Non-Cooperative Tile Assembly Is Decidable.
Proceedings of the 27th International Conference on DNA Computing and Molecular Programming, 2021

2020
On the directed tile assembly systems at temperature 1.
CoRR, 2020

The program-size complexity of self-assembled paths.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 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
Lost in self-stabilization: A local process that aligns connected cells.
Theor. Comput. Sci., 2018

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

FPT Approximation Algorithm for Scheduling with Memory Constraints.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

Asynchronous Simulation of Boolean Networks by Monotone Boolean Networks.
Proceedings of the Cellular Automata, 2016

2015
Cycles, double-cycles d'interactions et modes de mise à jour.
Tech. Sci. Informatiques, 2015

Improved local search for universal facility location.
J. Comb. Optim., 2015

Asynchronous Dynamics of Boolean Automata Double-Cycles.
Proceedings of the Unconventional Computation and Natural Computation, 2015

Lost in Self-Stabilization.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2013
About non-monotony in Boolean automata networks.
Theor. Comput. Sci., 2013

Full characterization of attractors for two intersected asynchronous Boolean automata cycles.
CoRR, 2013

Proof of a Phase Transition in Probabilistic Cellular Automata.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

On the Convergence of Boolean Automata Networks without Negative Cycles.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2013

2012
Boolean networks synchronism sensitivity and XOR circulant networks convergence time
Proceedings of the Proceedings 18th international workshop on Cellular Automata and Discrete Complex Systems and 3rd international symposium Journées Automates Cellulaires, 2012

2011
Stochastic minority on graphs.
Theor. Comput. Sci., 2011

Stochastic Flips on Dimer Tilings
CoRR, 2011

Non-monotony and Boolean automata networks
CoRR, 2011

2010
On the analysis of "simple" 2D stochastic cellular automata.
Discret. Math. Theor. Comput. Sci., 2010

Stochastic Flips on Two-letter Words.
Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics, 2010

2009
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority.
Theor. Comput. Sci., 2009

2008
Directed Percolation Arising in Stochastic Cellular Automata Analysis.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Quick Energy Drop in Stochastic 2D Minority.
Proceedings of the Cellular Automata, 2008

2006
Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006


  Loading...