On the public citation graph

Efficient characterisation of cellular automata

0 signed · 56 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01223745openalex-snapshot
Algebraic properties of cellular automata
inferredcites →https://doi.org/10.1103/revmodphys.55.601openalex-snapshot
Statistical mechanics of cellular automata
inferredcites →https://doi.org/10.1109/tc.1986.1676709openalex-snapshot
Group Properties of Cellular Automata and VLSI Applications
inferredcites →https://doi.org/10.1142/9361openalex-snapshot
Shift Register Sequences
inferredcites →https://doi.org/10.2307/2005041openalex-snapshot
Theory of Self-Reproducing Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/ffta.1998.0212openalex-snapshot
An Explicit Similarity Transform between Cellular Automata and LFSR Matrices
inferred← citeshttps://doi.org/10.1007/11576259_39openalex-snapshot
Encryption Based on Reversible Second-Order Cellular Automata
inferred← citeshttps://doi.org/10.1007/11599463_41openalex-snapshot
Low-Complexity Authentication Scheme Based on Cellular Automata in Wireless Network
inferred← citeshttps://doi.org/10.1007/11758532_46openalex-snapshot
Efficient Application of Hybrid 150/90 Cellular Automata to Symmetric Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_20openalex-snapshot
Security examination of a cellular automata based pseudorandom bit generator using an algebraic replica approach
inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_28openalex-snapshot
Mixed-Neighborhood, Multi-speed Cellular Automata for Safety-Aware Pedestrian Prediction
inferred← citeshttps://doi.org/10.1007/978-3-032-00257-0_3openalex-snapshot
Characterization Tools
inferred← citeshttps://doi.org/10.1007/978-3-032-00257-0_4openalex-snapshot
Reversibility
inferred← citeshttps://doi.org/10.1007/978-3-319-11520-7_40openalex-snapshot
Highly Compact Automated Implementation of Linear CA on FPGAs
inferred← citeshttps://doi.org/10.1007/978-3-319-20071-2_2openalex-snapshot
A Fabric Component Based Approach to the Architecture and Design Automation of High-Performance Integer Arithmetic Circuits on FPGA
inferred← citeshttps://doi.org/10.1007/978-3-319-27340-2_2openalex-snapshot
A Simple Linearisation of the Self-shrinking Generator
inferred← citeshttps://doi.org/10.1007/978-3-540-30479-1_63openalex-snapshot
Cellular Automata Application to the Linearization of Stream Cipher Generators
inferred← citeshttps://doi.org/10.1007/978-3-540-45224-9_162openalex-snapshot
Keystream Generator Analysis in Terms of Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-81-322-2520-1_6openalex-snapshot
Compact FPGA Implementation of Linear Cellular Automata
inferred← citeshttps://doi.org/10.1007/bf00995314openalex-snapshot
Quantitative analysis for linear hybrid cellular automata and LFSR as built-in self-test generators for sequential faults
inferred← citeshttps://doi.org/10.1007/bfb0028474openalex-snapshot
An improved key stream generator based on the programmable cellular automata
inferred← citeshttps://doi.org/10.1007/bfb0054027openalex-snapshot
A cellular automaton based fast one-way hash function suitable for hardware implementation
inferred← citeshttps://doi.org/10.1007/s11047-018-9696-8openalex-snapshot
A survey of cellular automata: types, dynamics, non-uniformity and applications
inferred← citeshttps://doi.org/10.1007/s13369-013-0757-0openalex-snapshot
Error Correcting Codes via Reversible Cellular Automata Over Finite Fields
inferred← citeshttps://doi.org/10.1016/j.apm.2005.08.013openalex-snapshot
Modelling nonlinear sequence generators in terms of linear cellular automata
inferred← citeshttps://doi.org/10.1016/j.ins.2019.10.068openalex-snapshot
Ternary reversible number-conserving cellular automata are trivial
inferred← citeshttps://doi.org/10.1016/j.nancom.2019.100278openalex-snapshot
Cellular automata-based byte error correction in QCA
inferred← citeshttps://doi.org/10.1016/j.physd.2021.133075openalex-snapshot
Reversibility of number-conserving 1D cellular automata: Unlocking insights into the dynamics for larger state sets
inferred← citeshttps://doi.org/10.1016/s0165-1684(97)00017-0openalex-snapshot
Maximum length cellular automaton sequences and its application
inferred← citeshttps://doi.org/10.1023/a:1008226724350openalex-snapshot
Partial Symmetry in Cellular Automata Rule Vectors
inferred← citeshttps://doi.org/10.1023/a:1008314320628openalex-snapshot
A Method for Designing a Deterministic Test Pattern Generator Based on Cellular Automata
inferred← citeshttps://doi.org/10.1063/5.0031535openalex-snapshot
Reversibility of non-saturated linear cellular automata on finite triangular grids
inferred← citeshttps://doi.org/10.1090/conm/477/09301openalex-snapshot
Cellular automata in stream ciphers
inferred← citeshttps://doi.org/10.1109/12.210176openalex-snapshot
Vector space theoretic analysis of additive cellular automata and its application for pseudoexhaustive test pattern generation
inferred← citeshttps://doi.org/10.1109/12.286310openalex-snapshot
Design of CAECC - cellular automata based error correcting code
inferred← citeshttps://doi.org/10.1109/12.338094openalex-snapshot
Theory and applications of cellular automata in cryptography
inferred← citeshttps://doi.org/10.1109/12.372030openalex-snapshot
CA-based byte error-correcting code
inferred← citeshttps://doi.org/10.1109/12.467703openalex-snapshot
A low-cost high-capacity associative memory design using cellular automata
inferred← citeshttps://doi.org/10.1109/12.481481openalex-snapshot
Analysis of periodic and intermediate boundary 90/150 cellular automata
inferred← citeshttps://doi.org/10.1109/12.754995openalex-snapshot
2-by-n hybrid cellular automata with regular configuration: theory and application
inferred← citeshttps://doi.org/10.1109/ats.1992.224403openalex-snapshot
Exhaustive two-pattern generation with cellular automata
inferred← citeshttps://doi.org/10.1109/ccst.1999.797940openalex-snapshot
Pseudorandom number generation based on nongroup cellular automata
inferred← citeshttps://doi.org/10.1109/cisp.2012.6469688openalex-snapshot
A novel image security system based on cellular automata and improved chaotic system
inferred← citeshttps://doi.org/10.1109/icccas.2002.1179001openalex-snapshot
Reconfigurable pipelined cellular automata array for cryptography
inferred← citeshttps://doi.org/10.1109/icics.1997.652157openalex-snapshot
Some properties of maximum length cellular automaton sequences
inferred← citeshttps://doi.org/10.1109/itw.2003.1216715openalex-snapshot
Simple cellular automata-based linear models for the shrinking generator
inferred← citeshttps://doi.org/10.1109/micai.2007.30openalex-snapshot
Cellular Mathematical Morphology
inferred← citeshttps://doi.org/10.1142/s0218126699000219openalex-snapshot
PROGRAMMABLE CELLULAR AUTOMATA
inferred← citeshttps://doi.org/10.1155/2019/2108014openalex-snapshot
Binomial Representation of Cryptographic Binary Sequences and Its Relation to Cellular Automata
inferred← citeshttps://doi.org/10.13140/rg.2.2.35585.61283openalex-snapshot
Cellular Automata: Reversibility, Semi-reversibility and Randomness
inferred← citeshttps://doi.org/10.14403/jcms.2015.28.4.545openalex-snapshot
CHARACTERISTIC MATRICES OF CELLULAR AUTOMATA WITH RULE 60 AND INTERMEDIATE BOUNDARY CONDITION
inferred← citeshttps://doi.org/10.18280/mmep.120726openalex-snapshot
Algebraic Structure of Moore Cellular Automata - Finite Triangular Lattice
inferred← citeshttps://doi.org/10.25088/complexsystems.21.1.57openalex-snapshot
Evolving Interesting Initial Conditions for Cellular Automata of the Game of Life Type
inferred← citeshttps://doi.org/10.3934/amc.2016041openalex-snapshot
Modelling the shrinking generator in terms of linear CA
inferred← citeshttps://doi.org/10.7858/eamj.2011.27.1.067openalex-snapshot
ON HYBRID GROUP CELLULAR AUTOMATA
inferred← citeshttps://doi.org/10.7858/eamj.2015.002openalex-snapshot
PERIODICITIES OF SOME ADDITIVE CELLULAR AUTOMATA
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.