default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJérôme Olivier Durand-Lose
Person information
- affiliation: University of Orléans, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j24]Jérôme Durand-Lose:
Abstract geometrical computation 12: generating representation of infinite countable linear orderings. Nat. Comput. 24(1): 67-78 (2025)- [e6]Enrico Formenti
, Jérôme Durand-Lose:
Machines, Computations, and Universality - 10th International Conference, MCU 2024, Nice, France, June 5-7, 2024, Revised Selected Papers. Lecture Notes in Computer Science 15270, Springer 2025, ISBN 978-3-031-81201-9 [contents] - 2022
- [c22]Jérôme Durand-Lose:
On the Power of Recursive Word-Functions Without Concatenation. DCFS 2022: 30-42 - [e5]Jérôme Durand-Lose, György Vaszil:
Machines, Computations, and Universality - 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 - September 2, 2022, Proceedings. Lecture Notes in Computer Science 13419, Springer 2022, ISBN 978-3-031-13501-9 [contents] - [i7]Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Natasa Jonoska:
Deterministic Non-cooperative Binding in Two-Dimensional Tile Assembly Systems Must Have Ultimately Periodic Paths. CoRR abs/2202.05165 (2022) - 2021
- [j23]Jérôme Durand-Lose, Jarkko Kari, Sergey Verlan:
Preface. Fundam. Informaticae 181(2-3) (2021) - [j22]Jérôme Durand-Lose, Aurélien Emmanuel:
Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines. Theor. Comput. Sci. 894: 103-120 (2021) - [j21]Florent Becker, Tom Besson, Jérôme Durand-Lose, Aurélien Emmanuel, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Shahrzad Heydarshahi:
Abstract Geometrical Computation 10: An Intrinsically Universal Family of Signal Machines. ACM Trans. Comput. Theory 13(1): 4:1-4:31 (2021) - [i6]Jérôme Durand-Lose, Aurélien Emmanuel:
Abstract Geometrical Computation 11: Slanted Firing Squad Synchronisation on Signal Machines. CoRR abs/2106.11176 (2021) - 2020
- [j20]Jérôme Durand-Lose, Jacob Hendricks, Matthew J. Patitz, Ian Perkins, Michael Sharp:
Self-assembly of 3-D structures using 2-D folding tiles. Nat. Comput. 19(2): 337-355 (2020)
2010 – 2019
- 2019
- [i5]Jérôme Durand-Lose, Hendrik Jan Hoogeboom, Natasa Jonoska:
Deterministic 2-Dimensional Temperature-1 Tile Assembly Systems Cannot Compute. CoRR abs/1901.08575 (2019) - 2018
- [j19]Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose, Vincent Levorato, Maxime Senot:
Abstract geometrical computation 8: Small machines, accumulations & rationality. J. Comput. Syst. Sci. 97: 182-198 (2018) - [c21]Jérôme Durand-Lose, Jacob Hendricks, Matthew J. Patitz, Ian Perkins, Michael Sharp:
Self-assembly of 3-D Structures Using 2-D Folding Tiles. DNA 2018: 105-121 - [p3]Jérôme Durand-Lose:
Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage. Reversibility and Universality 2018: 61-93 - [e4]Jérôme Durand-Lose, Sergey Verlan:
Machines, Computations, and Universality - 8th International Conference, MCU 2018, Fontainebleau, France, June 28-30, 2018, Proceedings. Lecture Notes in Computer Science 10881, Springer 2018, ISBN 978-3-319-92401-4 [contents] - [i4]Florent Becker, Jérôme Durand-Lose, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei:
An Intrinsically Universal Family of Signal Machines. CoRR abs/1804.09018 (2018) - [i3]Jérôme Durand-Lose, Jacob Hendricks, Matthew J. Patitz, Ian Perkins, Michael Sharp:
Self-Assembly of 3-D Structures Using 2-D Folding Tiles. CoRR abs/1807.04818 (2018) - 2017
- [j18]Jérôme Durand-Lose, Jarkko Kari, Benedek Nagy:
Preface / Editorial. Fundam. Informaticae 155(1-2): v-vii (2017) - [j17]Tom Besson, Jérôme Durand-Lose:
Abstract Geometrical Computation 9: Exact Discretization of 3-Speed Rational Signal Machines. J. Cell. Autom. 12(3-4): 159-187 (2017) - [c20]Jérôme Durand-Lose:
Ways to Compute in Euclidean Frameworks. UCNC 2017: 8-25 - 2016
- [c19]Tom Besson, Jérôme Durand-Lose:
Exact Discretization of 3-Speed Rational Signal Machines into Cellular Automata. Automata 2016: 63-76 - 2015
- [e3]Jérôme Durand-Lose, Benedek Nagy:
Machines, Computations, and Universality - 7th International Conference, MCU 2015, Famagusta, North Cyprus, September 9-11, 2015, Proceedings. Lecture Notes in Computer Science 9288, Springer 2015, ISBN 978-3-319-23110-5 [contents] - 2014
- [j16]Jérôme Durand-Lose, Natasa Jonoska:
Preface. Nat. Comput. 13(2): 193-194 (2014) - 2013
- [c18]Jérôme Durand-Lose:
Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds. CiE 2013: 108-119 - [i2]Florent Becker, Mathieu Chapelle, Jérôme Durand-Lose, Vincent Levorato, Maxime Senot:
Abstract Geometrical Computation 8: Small Machines, Accumulations and Rationality. CoRR abs/1307.6468 (2013) - 2012
- [j15]Jérôme Durand-Lose, Maurice Margenstern, Klaus Sutner:
Preface. Int. J. Found. Comput. Sci. 23(7): 1419-1422 (2012) - [j14]Jérôme Durand-Lose:
Abstract Geometrical Computation 6: A Reversible, Conservative and Rational Based Model for Black Hole Computation. Int. J. Unconv. Comput. 8(1): 33-46 (2012) - [j13]Jérôme Durand-Lose:
Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers. Nat. Comput. 11(4): 609-622 (2012) - [c17]Denys Duchier, Jérôme Durand-Lose, Maxime Senot:
Computing in the Fractal Cloud: Modular Generic Solvers for SAT and Q-SAT Variants. TAMC 2012: 435-447 - [p2]Andrew Adamatzky, Jérôme Durand-Lose:
Collision-Based Computing. Handbook of Natural Computing 2012: 1949-1978 - [e2]Jérôme Durand-Lose, Natasa Jonoska:
Unconventional Computation and Natural Computation - 11th International Conference, UCNC 2012, Orléan, France, September 3-7, 2012. Proceedings. Lecture Notes in Computer Science 7445, Springer 2012, ISBN 978-3-642-32893-0 [contents] - 2011
- [j12]Jérôme Durand-Lose:
Preface. Int. J. Unconv. Comput. 7(4): 221-222 (2011) - [j11]Jérôme Durand-Lose:
Abstract geometrical computation 5: embedding computable analysis. Nat. Comput. 10(4): 1261-1273 (2011) - [j10]Jérôme Durand-Lose:
Abstract geometrical computation 4: Small Turing universal signal machines. Theor. Comput. Sci. 412(1-2): 57-67 (2011) - [c16]Jérôme Durand-Lose:
Geometrical Accumulations and Computably Enumerable Real Numbers. UC 2011: 101-112 - [i1]Denys Duchier, Jérôme Durand-Lose, Maxime Senot:
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants. CoRR abs/1105.3454 (2011) - 2010
- [c15]Denys Duchier, Jérôme Durand-Lose, Maxime Senot:
Fractal Parallelism: Solving SAT in Bounded Space and Time. ISAAC (1) 2010: 279-290 - [c14]Denys Duchier, Jérôme Durand-Lose, Maxime Senot:
Massively Parallel Automata in Euclidean Space-Time. SASO Workshops 2010: 104-109
2000 – 2009
- 2009
- [j9]Jérôme Durand-Lose:
Abstract geometrical computation 3: black holes for classical and analog computing. Nat. Comput. 8(3): 455-472 (2009) - [c13]Jérôme Durand-Lose:
Abstract Geometrical Computation and Computable Analysis. UC 2009: 158-167 - [r1]Jérôme Durand-Lose:
Cellular Automata, Universality of. Encyclopedia of Complexity and Systems Science 2009: 901-913 - 2008
- [c12]Jérôme Durand-Lose:
The signal point of view: from cellular automata to signal machines. JAC 2008: 238-249 - [c11]Jérôme Durand-Lose:
Small Turing universal signal machines. CSP 2008: 70-80 - 2007
- [j8]Jérôme Durand-Lose:
Vouzzavedibisar: International Conference MCU 2007 - Machines, Computations and Universality. Bull. dInformatique Approfondie et Appl. 76: 19 (2007) - [c10]Jérôme Durand-Lose:
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model. CiE 2007: 238-247 - [e1]Jérôme Olivier Durand-Lose, Maurice Margenstern:
Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings. Lecture Notes in Computer Science 4664, Springer 2007, ISBN 978-3-540-74592-1 [contents] - 2006
- [j7]Jérôme Durand-Lose:
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers. Fundam. Informaticae 74(4): 491-510 (2006) - [c9]Jérôme Durand-Lose:
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. CiE 2006: 163-172 - [c8]Jérôme Durand-Lose:
Forecasting Black Holes in Abstract Geometrical Computation is Highly Unpredictable. TAMC 2006: 644-653 - 2005
- [c7]Jérôme Durand-Lose:
Abstract Geometrical Computation: Turing-Computing Ability and Undecidability. CiE 2005: 106-116 - 2004
- [j6]Jérôme Durand-Lose:
A Kleene theorem for splitable signals. Inf. Process. Lett. 89(5): 237-245 (2004) - [c6]Jérôme Durand-Lose:
Abstract Geometrical Computation for Black Hole Computation. MCU 2004: 176-187 - 2003
- [b2]Jérôme Durand-Lose:
Calculer géométriquement sur le plan - machines à signaux. University of Nice Sophia Antipolis, France, 2003 - 2002
- [j5]Joffroy Beauquier, Maria Gradinariu, Colette Johnen, Jérôme Olivier Durand-Lose:
Token-Based Self-Stabilizing Uniform Algorithms. J. Parallel Distributed Comput. 62(5): 899-921 (2002) - [p1]Jérôme Durand-Lose:
Computing Inside the Billiard Ball Model. Collision-Based Computing 2002: 135-160 - 2001
- [c5]Jérôme Durand-Lose:
Representing Reversible Cellular Automata with Reversible Block Cellular Automata. DM-CCG 2001: 145-154 - 2000
- [j4]Jérôme Olivier Durand-Lose:
Randomized uniform self-stabilizing mutual exclusion. Inf. Process. Lett. 74(5-6): 203-207 (2000) - [j3]Jérôme Olivier Durand-Lose:
Reversible space-time simulation of cellular automata. Theor. Comput. Sci. 246(1-2): 117-129 (2000)
1990 – 1999
- 1998
- [j2]Jérôme Olivier Durand-Lose:
Parallel Transient Time of One-Dimensional Sand Pile. Theor. Comput. Sci. 205(1-2): 183-193 (1998) - [c4]Jérôme Olivier Durand-Lose:
About the Universality of the Billiard ball model. MCU (2) 1998: 118-132 - [c3]Jérôme Durand-Lose:
Randomized Uniform SelfStabilizing Mutual Exclusion. OPODIS 1998: 89-98 - 1997
- [c2]Jérôme Olivier Durand-Lose:
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton. STACS 1997: 439-450 - 1996
- [b1]Jérôme Durand-Lose:
Automates Cellulaires, Automates à Partitions et Tas de Sable. University of Bordeaux, France, 1996 - [j1]Jérôme Durand-Lose:
Grain Sorting in the One-dimensional Sand Pile Model. Complex Syst. 10(3) (1996) - 1995
- [c1]Jérôme Olivier Durand-Lose:
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata. LATIN 1995: 230-244
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 2025-03-21 02:13 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:
