default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacques Mazoyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[p3]Marianne Delorme, Jacques Mazoyer:
Algorithmic Tools on Cellular Automata. Handbook of Natural Computing 2012: 77-122- [p2]Jacques Mazoyer, Jean-Baptiste Yunès:
Computations on Cellular Automata. Handbook of Natural Computing 2012: 159-188 - 2011
- [j20]Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier:
Bulking I: An abstract theory of bulking. Theor. Comput. Sci. 412(30): 3866-3880 (2011) - [j19]Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier:
Bulking II: Classifications of cellular automata. Theor. Comput. Sci. 412(30): 3881-3905 (2011) - 2010
- [i1]Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier:
Bulking II: Classifications of Cellular Automata. CoRR abs/1001.5471 (2010)
2000 – 2009
- 2008
- [j18]Marianne Delorme, Jacques Mazoyer:
Exemples de classes d'automates cellulaires. RAIRO Theor. Informatics Appl. 42(1): 37-53 (2008) - [c8]Jacques Mazoyer:
Algorithms and computations on cellular automata. JAC 2008: 15-16 - 2007
- [j17]Anahí Gajardo
, Jacques Mazoyer:
One Head Machines from a symbolic approach. Theor. Comput. Sci. 370(1-3): 34-47 (2007) - 2004
- [j16]Jacques Demongeot, Jacques Mazoyer:
Discrete applied problems, cellular automata and lattices: florilegium for E. Goles. Theor. Comput. Sci. 322(2): 231-232 (2004) - [j15]Marianne Delorme, Jacques Mazoyer:
Real-time recognition of languages on an two-dimensional Archimedean thread. Theor. Comput. Sci. 322(2): 335-354 (2004) - 2002
- [j14]Marianne Delorme, Jacques Mazoyer:
Pebble Automata. Figures Families Recognition and Universality. Fundam. Informaticae 52(1-3): 81-132 (2002) - [j13]Marianne Delorme, Jacques Mazoyer:
Reconnaissance parallele des langages rationnels sur automates cellulaires plans. Theor. Comput. Sci. 281(1-2): 251-289 (2002) - [p1]Marianne Delorme, Jacques Mazoyer:
Signals on Cellular Automata. Collision-Based Computing 2002: 231-275 - 2001
- [j12]Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila:
Algorithms for Leader Election by Cellular Automata. J. Algorithms 41(2): 302-329 (2001) - [e1]Robert Cori, Jacques Mazoyer, Michel Morvan, Rémy Mosseri:
Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001. DMTCS Proceedings AA, 2001 [contents] - 2000
- [c7]Grégory Lafitte, Jacques Mazoyer:
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory. MFCS 2000: 508-517
1990 – 1999
- 1999
- [j11]Jacques Mazoyer, Ivan Rapaport:
Inducing an Order on Cellular Automata by a Grouping Operation. Discret. Appl. Math. 91(1-3): 177-196 (1999) - [j10]Jacques Mazoyer, Ivan Rapaport:
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. Discret. Math. 199(1-3): 103-122 (1999) - [j9]Jacques Mazoyer, Véronique Terrier:
Signals in One-Dimensional Cellular Automata. Theor. Comput. Sci. 217(1): 53-80 (1999) - [j8]Jacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud:
Avant Propos. Theor. Comput. Sci. 218(2): 217-218 (1999) - [j7]Marianne Delorme, Jacques Mazoyer, Laure Tougne:
Discrete Parabolas and Circles on 2D Cellular Automata. Theor. Comput. Sci. 218(2): 347-417 (1999) - [c6]Jacques Mazoyer, Codrin M. Nichitiu, Eric Rémila:
Compass Permits Leader Election. SODA 1999: 947-948 - 1998
- [c5]Jacques Mazoyer, Ivan Rapaport:
Additive Cellular Automata over Zp and the Bottom of (CA, <=). MFCS 1998: 834-843 - [c4]Jacques Mazoyer, Ivan Rapaport:
Inducing an Order on Cellular Automata by a Grouping Operation. STACS 1998: 116-127 - 1997
- [c3]Gianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer:
A Shift-Invariant Metric on Szz Inducing a Non-trivial Tolology. MFCS 1997: 179-188 - 1996
- [j6]Jacques Mazoyer:
Computations on One Dimensional Cellular Automata. Ann. Math. Artif. Intell. 16: 285-309 (1996) - [j5]Jacques Mazoyer:
On Optimal Solutions to the Firing Squad Synchronization Problem. Theor. Comput. Sci. 168(2): 367-404 (1996) - 1995
- [j4]Jacques Mazoyer:
Synchronization of Two Interacting Finite Automata. Int. J. Algebra Comput. 5(3): 289-308 (1995) - [c2]Bruno Durand, Jacques Mazoyer:
Growing Patterns in 1D Cellular Automata. FCT 1995: 211-220 - 1994
- [j3]Bruno Durand, Jacques Mazoyer:
Growing Patterns in One Dimensional Cellular Automata. Complex Syst. 8(6) (1994) - 1992
- [j2]Jacques Mazoyer, N. Reimen:
A Linear Speed-Up Theorem for Cellular Automata. Theor. Comput. Sci. 101(1): 59-98 (1992)
1980 – 1989
- 1987
- [j1]Jacques Mazoyer:
A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem. Theor. Comput. Sci. 50: 183-238 (1987) - 1986
- [c1]Jacques Mazoyer:
An Overview of the Firing Squad Synchronization Problem. Automata Networks 1986: 82-94
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 2024-04-24 22:54 CEST 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:
