Jacques Mazoyer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2011

Bulking II: Classifications of cellular automataMarianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier. TCS, 412(30):3881-3905, 2011. [doi]

Bulking I: An abstract theory of bulkingMarianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier. TCS, 412(30):3866-3880, 2011. [doi]

2008

Exemples de classes d automates cellulairesMarianne Delorme, Jacques Mazoyer. ita, 42(1):37-53, 2008. [doi]

Algorithms and computations on cellular automataJacques Mazoyer. jac 2009: 15-16

2007

One Head Machines from a symbolic approachAnahí Gajardo, Jacques Mazoyer. TCS, 370(1-3):34-47, 2007. [doi]

2004

Real-time recognition of languages on an two-dimensional Archimedean threadMarianne Delorme, Jacques Mazoyer. TCS, 322(2):335-354, 2004. [doi]

Discrete applied problems, cellular automata and lattices: florilegium for E. GolesJacques Demongeot, Jacques Mazoyer. TCS, 322(2):231-232, 2004. [doi]

2002

Pebble Automata. Figures Families Recognition and UniversalityMarianne Delorme, Jacques Mazoyer. FUIN, 52(1-3):81-132, 2002. [doi]

Reconnaissance parallele des langages rationnels sur automates cellulaires plansMarianne Delorme, Jacques Mazoyer. TCS, 281(1-2):251-289, 2002. [doi]

Signals on Cellular AutomataMarianne Delorme, Jacques Mazoyer. In Andrew Adamatzky, editor, Collision-Based Computing. pages 231-275, Springer, 2002. [doi]

2001

Algorithms for Leader Election by Cellular AutomataCodrin M. Nichitiu, Jacques Mazoyer, Eric Rémila. jal, 41(2):302-329, 2001. [doi]

2000

The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set TheoryGrégory Lafitte, Jacques Mazoyer. mfcs 2000: 508-517 [doi]

1999

Discrete Parabolas and Circles on 2D Cellular AutomataMarianne Delorme, Jacques Mazoyer, Laure Tougne. TCS, 218(2):347-417, 1999. [doi]

Avant ProposJacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud. TCS, 218(2):217-218, 1999. [doi]

Signals in One-Dimensional Cellular AutomataJacques Mazoyer, Véronique Terrier. TCS, 217(1):53-80, 1999. [doi]

Compass Permits Leader ElectionJacques Mazoyer, Codrin M. Nichitiu, Eric Rémila. soda 1999: 947-948 [doi]

Inducing an Order on Cellular Automata by a Grouping OperationJacques Mazoyer, Ivan Rapaport. DAM, 91(1-3):177-196, 1999. [doi]

Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability resultsJacques Mazoyer, Ivan Rapaport. DM, 199(1-3):103-122, 1999. [doi]

1998

Inducing an Order on Cellular Automata by a Grouping OperationJacques Mazoyer, Ivan Rapaport. STACS 1998: 116-127

Additive Cellular Automata over Z::p:: and the Bottom of (CA, <=)Jacques Mazoyer, Ivan Rapaport. mfcs 1998: 834-843 [doi]

1997

A Shift-Invariant Metric on S:::zz::: Inducing a Non-trivial TolologyGianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer. mfcs 1997: 179-188

1996

Computations on One Dimensional Cellular AutomataJacques Mazoyer. AMAI, 16:285-309, 1996.

On Optimal Solutions to the Firing Squad Synchronization ProblemJacques Mazoyer. TCS, 168(2):367-404, 1996. [doi]

1995

Growing Patterns in 1D Cellular AutomataBruno Durand, Jacques Mazoyer. fct 1995: 211-220

Synchronization of Two Interacting Finite AutomataJacques Mazoyer. ijac, 5(3):289-308, 1995. [doi]

1994

Growing Patterns in One Dimensional Cellular AutomataBruno Durand, Jacques Mazoyer. compsys, 8(6), 1994. [doi]

1992

A Linear Speed-Up Theorem for Cellular AutomataJacques Mazoyer, N. Reimen. TCS, 101(1):59-98, 1992.

1987

A Six-State Minimal Time Solution to the Firing Squad Synchronization ProblemJacques Mazoyer. TCS, 50:183-238, 1987.

1986

An Overview of the Firing Squad Synchronization ProblemJacques Mazoyer. litp 1988: 82-94

Sign in or sign up to see more results.

runs on WebDSL