Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata. - Jérôme Olivier Durand-Lose (LATIN, 1995)

Grain Sorting in the One-dimensional Sand Pile Model. - Jérôme Durand-Lose (Complex Syst., 1996)

Automates Cellulaires, Automates à Partitions et Tas de Sable. - Jérôme Durand-Lose (1996)

Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton. - Jérôme Olivier Durand-Lose (STACS, 1997)

About the Universality of the Billiard ball model. - Jérôme Olivier Durand-Lose (MCU (2), 1998)

Randomized Uniform SelfStabilizing Mutual Exclusion. - Jérôme Durand-Lose (OPODIS, 1998)

Parallel Transient Time of One-Dimensional Sand Pile. - Jérôme Olivier Durand-Lose (Theor. Comput. Sci., 1998)

Randomized uniform self-stabilizing mutual exclusion. - Jérôme Olivier Durand-Lose (Inf. Process. Lett., 2000)

Reversible space-time simulation of cellular automata. - Jérôme Olivier Durand-Lose (Theor. Comput. Sci., 2000)

Representing Reversible Cellular Automata with Reversible Block Cellular Automata. - Jérôme Durand-Lose (DM-CCG, 2001)

Computing Inside the Billiard Ball Model. - Jérôme Durand-Lose (Collision-Based Computing, 2002)

Token-Based Self-Stabilizing Uniform Algorithms. - Joffroy Beauquier; Maria Gradinariu; Colette Johnen; Jérôme Olivier Durand-Lose (J. Parallel Distributed Comput., 2002)

Calculer géométriquement sur le plan - machines à signaux. - Jérôme Durand-Lose (2003)

Abstract Geometrical Computation for Black Hole Computation. - Jérôme Durand-Lose (MCU, 2004)

A Kleene theorem for splitable signals. - Jérôme Durand-Lose (Inf. Process. Lett., 2004)

Abstract Geometrical Computation: Turing-Computing Ability and Undecidability. - Jérôme Durand-Lose (CiE, 2005)

Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. - Jérôme Durand-Lose (CiE, 2006)

Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable. - Jérôme Durand-Lose (TAMC, 2006)

Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers. - Jérôme Durand-Lose (Fundam. Informaticae, 2006)

Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model. - Jérôme Durand-Lose (CiE, 2007)

Vouzzavedibisar: International Conference MCU 2007 - Machines, Computations and Universality. - Jérôme Durand-Lose (Bull. dInformatique Approfondie et Appl., 2007)

The signal point of view: from cellular automata to signal machines. - Jérôme Durand-Lose (JAC, 2008)

Small Turing universal signal machines - Jérôme Durand-Lose (CSP, 2008)

Abstract Geometrical Computation and Computable Analysis. - Jérôme Durand-Lose (UC, 2009)

Abstract geometrical computation 3: black holes for classical and analog computing. - Jérôme Durand-Lose (Nat. Comput., 2009)

Cellular Automata, Universality of. - Jérôme Durand-Lose (Encyclopedia of Complexity and Systems Science, 2009)

Fractal Parallelism: Solving SAT in Bounded Space and Time. - Denys Duchier; Jérôme Durand-Lose; Maxime Senot (ISAAC (1), 2010)

Massively Parallel Automata in Euclidean Space-Time. - Denys Duchier; Jérôme Durand-Lose; Maxime Senot (SASO Workshops, 2010)

Geometrical Accumulations and Computably Enumerable Real Numbers. - Jérôme Durand-Lose (UC, 2011)

Preface. - Jérôme Durand-Lose (Int. J. Unconv. Comput., 2011)

Abstract geometrical computation 5: embedding computable analysis. - Jérôme Durand-Lose (Nat. Comput., 2011)

Abstract geometrical computation 4: Small Turing universal signal machines. - Jérôme Durand-Lose (Theor. Comput. Sci., 2011)

Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants. - Denys Duchier; Jérôme Durand-Lose; Maxime Senot (TAMC, 2012)

Preface. - Jérôme Durand-Lose; Maurice Margenstern; Klaus Sutner (Int. J. Found. Comput. Sci., 2012)

Abstract Geometrical Computation 6: A Reversible, Conservative and Rational Based Model for Black Hole Computation. - Jérôme Durand-Lose (Int. J. Unconv. Comput., 2012)

Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers. - Jérôme Durand-Lose (Nat. Comput., 2012)

Collision-Based Computing. - Andrew Adamatzky; Jérôme Durand-Lose (Handbook of Natural Computing, 2012)

Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds. - Jérôme Durand-Lose (CiE, 2013)

Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality. - Florent Becker; Mathieu Chapelle; Jérôme Durand-Lose; Vincent Levorato; Maxime Senot (CoRR, 2013)

Preface. - Jérôme Durand-Lose; Natasa Jonoska (Nat. Comput., 2014)

Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata. - Tom Besson; Jérôme Durand-Lose (Automata, 2016)

Ways to Compute in Euclidean Frameworks. - Jérôme Durand-Lose (UCNC, 2017)

Preface / Editorial. - Jérôme Durand-Lose; Jarkko Kari; Benedek Nagy (Fundam. Informaticae, 2017)

Abstract Geometrical Computation 9: Exact Discretization of 3-Speed Rational Signal Machines. - Tom Besson; Jérôme Durand-Lose (J. Cell. Autom., 2017)

Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage. - Jérôme Durand-Lose (Reversibility and Universality, 2018)

An Intrinsically Universal Family of Signal Machines. - Florent Becker; Jérôme Durand-Lose; Mohammad-Hadi Foroughmand-Araabi; Sama Goliaei (CoRR, 2018)

Abstract geometrical computation 8: Small machines, accumulations & rationality. - Florent Becker; Mathieu Chapelle; Jérôme Durand-Lose; Vincent Levorato; Maxime Senot (J. Comput. Syst. Sci., 2018)

Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute. - Jérôme Durand-Lose; Hendrik Jan Hoogeboom; Natasa Jonoska (CoRR, 2019)

Self-assembly of 3-D structures using 2-D folding tiles. - Jérôme Durand-Lose; Jacob Hendricks; Matthew J. Patitz; Ian Perkins; Michael Sharp (Nat. Comput., 2020)

Preface. - Jérôme Durand-Lose; Jarkko Kari; Sergey Verlan (Fundam. Informaticae, 2021)

Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines. - Jérôme Durand-Lose; Aurélien Emmanuel (Theor. Comput. Sci., 2021)

Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines. - Florent Becker; Tom Besson; Jérôme Durand-Lose; Aurélien Emmanuel; Mohammad-Hadi Foroughmand-Araabi; Sama Goliaei; Shahrzad Heydarshahi (ACM Trans. Comput. Theory, 2021)

On the Power of Recursive Word-Functions Without Concatenation. - Jérôme Durand-Lose (DCFS, 2022)

Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths. - Jérôme Durand-Lose; Hendrik Jan Hoogeboom; Natasa Jonoska (CoRR, 2022)

Abstract geometrical computation 12: generating representation of infinite countable linear orderings. - Jérôme Durand-Lose (Nat. Comput., 2025)