Jérôme Durand-Lose

Author Info

Name	Affiliation	Papers
JÉRÔME DURAND-LOSE	Lab ISSS, Bat ESSI, BP 145, F-06903 Sophia Antipolis, France	30
Collaborators	Citations	PageRank
17	127	14.93
Referers	Referees	References
65	202	343

Search Limit

100202

Publications (30 rows)

Collaborators (17 rows)

Referers (65 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines	0	0.34	2021
Abstract geometrical computation 8: Small machines, accumulations & rationality.	0	0.34	2018
Self-Assembly of 3-D Structures Using 2-D Folding Tiles.	0	0.34	2018
An Intrinsically Universal Family of Signal Machines.	0	0.34	2018
Ways To Compute In Euclidean Frameworks	0	0.34	2017
Abstract Geometrical Computation 9: Exact Discretization of 3-Speed Rational Signal Machines.	0	0.34	2017
Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds.	3	0.53	2013
Abstract Geometrical Computation 6: A Reversible, Conservative And Rational Based Model For Black Hole Computation	3	0.43	2012
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants	5	0.46	2012
Abstract geometrical computation 7: geometrical accumulations and computably enumerable real numbers	1	0.36	2012
Abstract geometrical computation 4: Small Turing universal signal machines	1	0.36	2011
Abstract geometrical computation 5: embedding computable analysis.	2	0.38	2011
Geometrical accumulations and computably enumerable real numbers	1	0.35	2011
Fractal Parallelism: Solving SAT in Bounded Space and Time	5	0.46	2010
Abstract Geometrical Computation and Computable Analysis	4	0.43	2009
Abstract geometrical computation 3: black holes for classical and analog computing	14	0.93	2009
Small Turing Universal Signal Machines	0	0.34	2008
The signal point of view: from cellular automata to signal machines	4	0.44	2008
Vouzzavedibisar: International Conference MCU 2007 - Machines, Computations and Universality	0	0.34	2007
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model	5	0.48	2007
Abstract Geometrical Computation 1: Embedding Black Hole Computations with Rational Numbers	15	0.80	2006
Reversible conservative rational abstract geometrical computation is turing-universal	4	0.44	2006
Forecasting black holes in abstract geometrical computation is highly unpredictable	7	0.52	2006
Abstract geometrical computation: turing-computing ability and undecidability	12	0.63	2005
Abstract geometrical computation for black hole computation	11	0.75	2004
A Kleene theorem for splitable signals	4	0.81	2004
Token-based self-stabilizing uniform algorithms	13	0.85	2002
Representing Reversible Cellular Automata with Reversible Block Cellular Automata	6	0.97	2001
Randomized uniform self-stabilizing mutual exclusion	7	0.52	2000
Randomized Uniform SelfStabilizing Mutual Exclusion	0	0.34	1998