Jacques Mazoyer

33 papers A* 1A 1B 4Journal 21Unranked 2
YearRankTypeTitle / Venue / Authors
2012 — ch.
Algorithmic Tools on Cellular Automata.
Handbook of Natural Computing
Marianne Delorme, Jacques Mazoyer
2012 — ch.
Computations on Cellular Automata.
Handbook of Natural Computing
Jacques Mazoyer, Jean-Baptiste Yunès
2011 J jnl
Bulking I: An abstract theory of bulking.
Theor. Comput. Sci.
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
2011 J jnl
Bulking II: Classifications of cellular automata.
Theor. Comput. Sci.
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
2010 J jnl
Bulking II: Classifications of Cellular Automata
CoRR
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinger, Guillaume Theyssier
2008 — conf
Algorithms and computations on cellular automata.
JAC
Jacques Mazoyer
2008 J jnl
Exemples de classes d'automates cellulaires.
RAIRO Theor. Informatics Appl.
Marianne Delorme, Jacques Mazoyer
2007 J jnl
One Head Machines from a symbolic approach.
Theor. Comput. Sci.
Anahí Gajardo, Jacques Mazoyer
2004 J jnl
Discrete applied problems, cellular automata and lattices: florilegium for E. Goles.
Theor. Comput. Sci.
Jacques Demongeot, Jacques Mazoyer
2004 J jnl
Real-time recognition of languages on an two-dimensional Archimedean thread.
Theor. Comput. Sci.
Marianne Delorme, Jacques Mazoyer
2002 J jnl
Pebble Automata. Figures Families Recognition and Universality.
Fundam. Informaticae
Marianne Delorme, Jacques Mazoyer
2002 J jnl
Reconnaissance parallele des langages rationnels sur automates cellulaires plans.
Theor. Comput. Sci.
Marianne Delorme, Jacques Mazoyer
2002 — ch.
Signals on Cellular Automata.
Collision-Based Computing
Marianne Delorme, Jacques Mazoyer
2001 J jnl
Algorithms for Leader Election by Cellular Automata.
J. Algorithms
Codrin M. Nichitiu, Jacques Mazoyer, Eric Rémila
2001 — ed.
Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001
DM-CCG
Robert Cori, Jacques Mazoyer, Michel Morvan, Rémy Mosseri
2000 B conf
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory.
MFCS
Grégory Lafitte, Jacques Mazoyer
1999 J jnl
Avant Propos.
Theor. Comput. Sci.
Jacques Mazoyer, Renzo Pinzani, Jean-Guy Penaud
1999 A* conf
Compass Permits Leader Election.
SODA
Jacques Mazoyer, Codrin M. Nichitiu, Eric Rémila
1999 J jnl
Discrete Parabolas and Circles on 2D Cellular Automata.
Theor. Comput. Sci.
Marianne Delorme, Jacques Mazoyer, Laure Tougne
1999 J jnl
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results.
Discret. Math.
Jacques Mazoyer, Ivan Rapaport
1999 J jnl
Inducing an Order on Cellular Automata by a Grouping Operation.
Discret. Appl. Math.
Jacques Mazoyer, Ivan Rapaport
1999 J jnl
Signals in One-Dimensional Cellular Automata.
Theor. Comput. Sci.
Jacques Mazoyer, Véronique Terrier
1998 B conf
Additive Cellular Automata over Z
MFCS
Jacques Mazoyer, Ivan Rapaport
1998 A conf
Inducing an Order on Cellular Automata by a Grouping Operation.
STACS
Jacques Mazoyer, Ivan Rapaport
1997 B conf
A Shift-Invariant Metric on S
MFCS
Gianpiero Cattaneo, Enrico Formenti, Luciano Margara, Jacques Mazoyer
1996 J jnl
Computations on One Dimensional Cellular Automata.
Ann. Math. Artif. Intell.
Jacques Mazoyer
1996 J jnl
On Optimal Solutions to the Firing Squad Synchronization Problem.
Theor. Comput. Sci.
Jacques Mazoyer
1995 B conf
Growing Patterns in 1D Cellular Automata.
FCT
Bruno Durand, Jacques Mazoyer
1995 J jnl
Synchronization of Two Interacting Finite Automata.
Int. J. Algebra Comput.
Jacques Mazoyer
1994 J jnl
Growing Patterns in One Dimensional Cellular Automata.
Complex Syst.
Bruno Durand, Jacques Mazoyer
1992 J jnl
A Linear Speed-Up Theorem for Cellular Automata.
Theor. Comput. Sci.
Jacques Mazoyer, N. Reimen
1987 J jnl
A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem.
Theor. Comput. Sci.
Jacques Mazoyer
1986 — conf
An Overview of the Firing Squad Synchronization Problem.
Automata Networks
Jacques Mazoyer
redb/extractors/enum.py
← Index redb/extractors/enum.py python 
from enum import Enum


class Tag(Enum):
    BASIC_PROPERTIES = "basic_properties"
    DIEC = "detect_it_easy"
    CAPA = "capa"
    MALCONTENT = "malcontent"
    DECOMPILED = "decompiled"
    HASH = "hash"
    STRINGS = "strings"
    RELATED = "relatedness" # unused
    PE_FEATURES = "pe_features"
    PE_IMPORT = "pe_import"
    PE_OVERLAY = "pe_overlay"
    PE_SECTION = "pe_section"
    PE_RESOURCE = "pe_resource"
    PE_SIGNATURE = "pe_signature"
    PE_CERTIFICATE = "pe_certificate"
    PE_SIGNER = "pe_signer"
    PE_DOTNET = "pe_dotnet"
    PE_EMBEDDED_EXTRAS = "pe_embedded_extras"
    PE_INCONSISTENCY_TESTS = "pe_inconsistency_tests"
    DOTNET_INCONSISTENCY_TESTS = "dotnet_inconsistency_tests"
    YARA = "yara"
    # Mach-O
    MACHO_FEATURES = "macho_features"
    MACHO_IMPORT = "macho_import"
    MACHO_EXPORT = "macho_export"
    MACHO_DYLIB = "macho_dylib"
    MACHO_SEGMENT = "macho_segment"
    MACHO_SIGNATURE = "macho_signature"
    MACHO_CERTIFICATE = "macho_certificate"
    MACHO_ENTITLEMENT = "macho_entitlement"
    MACHO_UNIVERSAL = "macho_universal"
    MACHO_HASHES = "macho_hashes"
    # ELF
    ELF_FEATURES = "elf_features"
    ELF_IMPORT = "elf_import"
    ELF_EXPORT = "elf_export"
    ELF_SECTION = "elf_section"
    ELF_SEGMENT = "elf_segment"
    ELF_SYMBOL = "elf_symbol"
    ELF_RELOCATION = "elf_relocation"
    ELF_NOTE = "elf_note"
    ELF_DEPENDENCY = "elf_dependency"
    # APK
    APK_FEATURES = "apk_features"
    APK_MANIFEST = "apk_manifest"
    APK_PERMISSIONS = "apk_permissions"
    APK_SIGNATURE = "apk_signature"
    APK_DEX = "apk_dex"
    APK_RESOURCES = "apk_resources"
    APK_NATIVE_LIBS = "apk_native_libs"
    APK_INCONSISTENCY_TESTS = "apk_inconsistency_tests"
    APK_DECOMPILED = "apk_decompiled"
    # JavaScript
    JS_FEATURES = "js_features"
    JS_SUSPICIOUS_APIS = "js_suspicious_apis"
    JS_STRINGS = "js_strings"
    JS_DEOBFUSCATION = "js_deobfuscation"
    JS_CONTENT = "js_content"