| 2008 |
|---|
| 24 | | Jacques Mazoyer:
Algorithms and computations on cellular automata.
JAC 2008: 15-16 |
| 2007 |
|---|
| 23 | EE | Anahí Gajardo,
Jacques Mazoyer:
One Head Machines from a symbolic approach.
Theor. Comput. Sci. 370(1-3): 34-47 (2007) |
| 2004 |
|---|
| 22 | EE | Jacques Demongeot,
Jacques Mazoyer:
Discrete applied problems, cellular automata and lattices: florilegium for E. Goles.
Theor. Comput. Sci. 322(2): 231-232 (2004) |
| 21 | EE | Marianne Delorme,
Jacques Mazoyer:
Real-time recognition of languages on an two-dimensional Archimedean thread.
Theor. Comput. Sci. 322(2): 335-354 (2004) |
| 2002 |
|---|
| 20 | EE | Marianne Delorme,
Jacques Mazoyer:
Pebble Automata. Figures Families Recognition and Universality.
Fundam. Inform. 52(1-3): 81-132 (2002) |
| 19 | EE | Marianne Delorme,
Jacques Mazoyer:
Reconnaissance parallele des langages rationnels sur automates cellulaires plans.
Theor. Comput. Sci. 281(1-2): 251-289 (2002) |
| 2001 |
|---|
| 18 | | Robert Cori,
Jacques Mazoyer,
Michel Morvan,
Rémy Mosseri:
Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001
DM-CCG 2001 |
| 17 | EE | Codrin M. Nichitiu,
Jacques Mazoyer,
Eric Rémila:
Algorithms for Leader Election by Cellular Automata.
J. Algorithms 41(2): 302-329 (2001) |
| 2000 |
|---|
| 16 | EE | Grégory Lafitte,
Jacques Mazoyer:
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory.
MFCS 2000: 508-517 |
| 1999 |
|---|
| 15 | EE | Jacques Mazoyer,
Codrin M. Nichitiu,
Eric Rémila:
Compass Permits Leader Election.
SODA 1999: 947-948 |
| 14 | EE | Jacques Mazoyer,
Ivan Rapaport:
Inducing an Order on Cellular Automata by a Grouping Operation.
Discrete Applied Mathematics 91(1-3): 177-196 (1999) |
| 13 | EE | Jacques Mazoyer,
Ivan Rapaport:
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results.
Discrete Mathematics 199(1-3): 103-122 (1999) |
| 12 | EE | Jacques Mazoyer,
Véronique Terrier:
Signals in One-Dimensional Cellular Automata.
Theor. Comput. Sci. 217(1): 53-80 (1999) |
| 11 | EE | Jacques Mazoyer,
Renzo Pinzani,
Jean-Guy Penaud:
Avant Propos.
Theor. Comput. Sci. 218(2): 217-218 (1999) |
| 10 | EE | Marianne Delorme,
Jacques Mazoyer,
Laure Tougne:
Discrete Parabolas and Circles on 2D Cellular Automata.
Theor. Comput. Sci. 218(2): 347-417 (1999) |
| 1998 |
|---|
| 9 | EE | Jacques Mazoyer,
Ivan Rapaport:
Additive Cellular Automata over Zp and the Bottom of (CA, <=).
MFCS 1998: 834-843 |
| 8 | | Jacques Mazoyer,
Ivan Rapaport:
Inducing an Order on Cellular Automata by a Grouping Operation.
STACS 1998: 116-127 |
| 1997 |
|---|
| 7 | | Gianpiero Cattaneo,
Enrico Formenti,
Luciano Margara,
Jacques Mazoyer:
A Shift-Invariant Metric on Szz Inducing a Non-trivial Tolology.
MFCS 1997: 179-188 |
| 1996 |
|---|
| 6 | | Jacques Mazoyer:
Computations on One Dimensional Cellular Automata.
Ann. Math. Artif. Intell. 16: 285-309 (1996) |
| 5 | EE | Jacques Mazoyer:
On Optimal Solutions to the Firing Squad Synchronization Problem.
Theor. Comput. Sci. 168(2): 367-404 (1996) |
| 1995 |
|---|
| 4 | | Bruno Durand,
Jacques Mazoyer:
Growing Patterns in 1D Cellular Automata.
FCT 1995: 211-220 |
| 1992 |
|---|
| 3 | | Jacques Mazoyer,
N. Reimen:
A Linear Speed-Up Theorem for Cellular Automata.
Theor. Comput. Sci. 101(1): 59-98 (1992) |
| 1987 |
|---|
| 2 | | Jacques Mazoyer:
A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem.
Theor. Comput. Sci. 50: 183-238 (1987) |
| 1986 |
|---|
| 1 | | Jacques Mazoyer:
An Overview of the Firing Squad Synchronization Problem.
Automata Networks 1986: 82-94 |
