Jacques Mazoyer

According to our database, Jacques Mazoyer authored at least 30 papers between 1986 and 2012.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2012

Computations on Cellular Automata.

Jacques Mazoyer, Jean-Baptiste Yunès

Proceedings of the Handbook of Natural Computing, 2012

Algorithmic Tools on Cellular Automata.

Marianne Delorme, Jacques Mazoyer

Proceedings of the Handbook of Natural Computing, 2012

2011

Bulking II: Classifications of cellular automata.

Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier

Theor. Comput. Sci., 2011

Bulking I: An abstract theory of bulking.

Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier

Theor. Comput. Sci., 2011

2008

Exemples de classes d'automates cellulaires.

Marianne Delorme, Jacques Mazoyer

RAIRO Theor. Informatics Appl., 2008

Algorithms and computations on cellular automata.

Jacques Mazoyer

Proceedings of the First Symposium on Cellular Automata "Journées Automates Cellulaires" (JAC 2008), 2008

2007

One Head Machines from a symbolic approach.

Anahí Gajardo, Jacques Mazoyer

Theor. Comput. Sci., 2007

2004

Discrete applied problems, cellular automata and lattices: florilegium for E. Goles.

Jacques Demongeot, Jacques Mazoyer

Theor. Comput. Sci., 2004

Real-time recognition of languages on an two-dimensional Archimedean thread.

Marianne Delorme, Jacques Mazoyer

Theor. Comput. Sci., 2004

2002

Reconnaissance parallele des langages rationnels sur automates cellulaires plans.

Marianne Delorme, Jacques Mazoyer

Theor. Comput. Sci., 2002

Pebble Automata. Figures Families Recognition and Universality.

Marianne Delorme, Jacques Mazoyer

Fundam. Informaticae, 2002

Signals on Cellular Automata.

Marianne Delorme, Jacques Mazoyer

Proceedings of the Collision-Based Computing, 2002

2001

Algorithms for Leader Election by Cellular Automata.

Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila

J. Algorithms, 2001

2000

The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory.

Grégory Lafitte, Jacques Mazoyer

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

Signals in One-Dimensional Cellular Automata.

Jacques Mazoyer, Véronique Terrier

Theor. Comput. Sci., 1999

Avant Propos.

Jacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud

Theor. Comput. Sci., 1999

Discrete Parabolas and Circles on 2D Cellular Automata.

Marianne Delorme, Jacques Mazoyer, Laure Tougne

Theor. Comput. Sci., 1999

Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results.

Jacques Mazoyer, Ivan Rapaport

Discret. Math., 1999

Inducing an Order on Cellular Automata by a Grouping Operation.

Jacques Mazoyer, Ivan Rapaport

Discret. Appl. Math., 1999

Compass Permits Leader Election.

Jacques Mazoyer, Codrin M. Nichitiu, Eric Rémila

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Additive Cellular Automata over Z_p and the Bottom of (CA, <=).

Jacques Mazoyer, Ivan Rapaport

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

A Shift-Invariant Metric on S^zz Inducing a Non-trivial Tolology.

Gianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

On Optimal Solutions to the Firing Squad Synchronization Problem.

Jacques Mazoyer

Theor. Comput. Sci., 1996

Computations on One Dimensional Cellular Automata.

Jacques Mazoyer

Ann. Math. Artif. Intell., 1996

1995

Synchronization of Two Interacting Finite Automata.

Jacques Mazoyer

Int. J. Algebra Comput., 1995

Growing Patterns in 1D Cellular Automata.

Bruno Durand, Jacques Mazoyer

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

Growing Patterns in One Dimensional Cellular Automata.

Bruno Durand, Jacques Mazoyer

Complex Syst., 1994

1992

A Linear Speed-Up Theorem for Cellular Automata.

Jacques Mazoyer, N. Reimen

Theor. Comput. Sci., 1992

1987

A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem.

Jacques Mazoyer

Theor. Comput. Sci., 1987

1986

An Overview of the Firing Squad Synchronization Problem.

Jacques Mazoyer

Proceedings of the Automata Networks, LITP Spring School on Theoretical Computer Science, 1986