Jérôme Olivier Durand-Lose

Orcid: 0000-0001-6506-074X

Affiliations:
  • University of Orléans, France


According to our database1, Jérôme Olivier Durand-Lose authored at least 54 papers between 1995 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths.
CoRR, 2022

On the Power of Recursive Word-Functions Without Concatenation.
Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021
Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines.
ACM Trans. Comput. Theory, 2021

Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines.
Theor. Comput. Sci., 2021

Preface.
Fundam. Informaticae, 2021

2020
Self-assembly of 3-D structures using 2-D folding tiles.
Nat. Comput., 2020

2019
Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute.
CoRR, 2019

2018
Abstract geometrical computation 8: Small machines, accumulations & rationality.
J. Comput. Syst. Sci., 2018

An Intrinsically Universal Family of Signal Machines.
CoRR, 2018

Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage.
Proceedings of the Reversibility and Universality, 2018

2017
Abstract Geometrical Computation 9: Exact Discretization of 3-Speed Rational Signal Machines.
J. Cell. Autom., 2017

Preface / Editorial.
Fundam. Informaticae, 2017

Ways to Compute in Euclidean Frameworks.
Proceedings of the Unconventional Computation and Natural Computation, 2017

2016
Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2016

2014
Preface.
Nat. Comput., 2014

2013
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality.
CoRR, 2013

Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Collision-Based Computing.
Proceedings of the Handbook of Natural Computing, 2012

Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers.
Nat. Comput., 2012

Abstract Geometrical Computation 6: A Reversible, Conservative and Rational Based Model for Black Hole Computation.
Int. J. Unconv. Comput., 2012

Preface.
Int. J. Found. Comput. Sci., 2012

Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants.
Proceedings of the Theory and Applications of Models of Computation, 2012

2011
Abstract geometrical computation 4: Small Turing universal signal machines.
Theor. Comput. Sci., 2011

Abstract geometrical computation 5: embedding computable analysis.
Nat. Comput., 2011

Preface.
Int. J. Unconv. Comput., 2011

Geometrical Accumulations and Computably Enumerable Real Numbers.
Proceedings of the Unconventional Computation - 10th International Conference, 2011

2010
Massively Parallel Automata in Euclidean Space-Time.
Proceedings of the Fourth IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2010

Fractal Parallelism: Solving SAT in Bounded Space and Time.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Cellular Automata, Universality of.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Abstract geometrical computation 3: black holes for classical and analog computing.
Nat. Comput., 2009

Abstract Geometrical Computation and Computable Analysis.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

2008
Small Turing universal signal machines
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

The signal point of view: from cellular automata to signal machines.
Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

2007
Vouzzavedibisar: International Conference MCU 2007 - Machines, Computations and Universality.
Bull. dInformatique Approfondie et Appl., 2007

Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers.
Fundam. Informaticae, 2006

Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable.
Proceedings of the Theory and Applications of Models of Computation, 2006

Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability.
Proceedings of the New Computational Paradigms, 2005

2004
A Kleene theorem for splitable signals.
Inf. Process. Lett., 2004

Abstract Geometrical Computation for Black Hole Computation.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

2003
Calculer géométriquement sur le plan - machines à signaux.
, 2003

2002
Token-Based Self-Stabilizing Uniform Algorithms.
J. Parallel Distributed Comput., 2002

Computing Inside the Billiard Ball Model.
Proceedings of the Collision-Based Computing, 2002

2001
Representing Reversible Cellular Automata with Reversible Block Cellular Automata.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

2000
Reversible space-time simulation of cellular automata.
Theor. Comput. Sci., 2000

Randomized uniform self-stabilizing mutual exclusion.
Inf. Process. Lett., 2000

1998
Parallel Transient Time of One-Dimensional Sand Pile.
Theor. Comput. Sci., 1998

Randomized Uniform SelfStabilizing Mutual Exclusion.
Proceedings of the Distributed Computing, 1998

About the Universality of the Billiard ball model.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

1997
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton.
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

1996
Automates Cellulaires, Automates à Partitions et Tas de Sable.
PhD thesis, 1996

Grain Sorting in the One-dimensional Sand Pile Model.
Complex Syst., 1996

1995
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata.
Proceedings of the LATIN '95: Theoretical Informatics, 1995


  Loading...