On the public citation graph

Reversible Cellular Automata

0 signed · 96 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.1006/jcss.1997.1535openalex-snapshot

Invertible Linear Cellular Automata overZm:

inferredcites →https://doi.org/10.1007/11523468_34openalex-snapshot

A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata

inferredcites →https://doi.org/10.1007/3-540-46541-3_9openalex-snapshot

Linear Cellular Automata with Multiple State Variables

inferredcites →https://doi.org/10.1007/3-540-57182-5_35openalex-snapshot

Global properties of 2D cellular automata: some complexity results

inferredcites →https://doi.org/10.1007/978-3-642-58117-5_29openalex-snapshot

On the Inverse Neighborhoods of Reversible Cellular Automata

inferredcites →https://doi.org/10.1007/bf01201813openalex-snapshot

Representation of Reversible Cellular Automata with Block Permutations

inferredcites →https://doi.org/10.1007/bf01691062openalex-snapshot

Endomorphisms and automorphisms of the shift dynamical system

inferredcites →https://doi.org/10.1007/bfb0029981openalex-snapshot

Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects

inferredcites →https://doi.org/10.1016/0020-0190(93)90061-dopenalex-snapshot

Decidability for some problems of linear cellular automata over finite commutative rings

inferredcites →https://doi.org/10.1016/0022-0000(83)90033-8openalex-snapshot

Linear cellular automata over Z

inferredcites →https://doi.org/10.1016/0031-8914(69)90265-1openalex-snapshot

Noise in optical mixing

inferredcites →https://doi.org/10.1016/0167-2789(84)90252-5openalex-snapshot

Physics-like models of computation

inferredcites →https://doi.org/10.1016/0167-2789(90)90185-ropenalex-snapshot

Invertible cellular automata: A review

inferredcites →https://doi.org/10.1016/0167-2789(90)90195-uopenalex-snapshot

Reversibility of 2D cellular automata is undecidable

inferredcites →https://doi.org/10.1016/0167-2789(90)90196-vopenalex-snapshot

Classifying circular cellular automata

inferredcites →https://doi.org/10.1016/0304-3975(95)00038-xopenalex-snapshot

Reversible simulation of one-dimensional irreversible cellular automata

inferredcites →https://doi.org/10.1016/s0022-0000(05)80025-xopenalex-snapshot

Reversibility and surjectivity problems of cellular automata

inferredcites →https://doi.org/10.1016/s0022-0000(72)80009-6openalex-snapshot

Tessellations with local transformations

inferredcites →https://doi.org/10.1016/s0022-0000(72)80013-8openalex-snapshot

Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

inferredcites →https://doi.org/10.1016/s0022-0000(77)80007-xopenalex-snapshot

Computation and construction universality of reversible cellular automata

inferredcites →https://doi.org/10.1090/procopenalex-snapshot

Proceedings of the American Mathematical Society

inferredcites →https://doi.org/10.1090/psapm/014/9961openalex-snapshot

Machines models of self-reproduction

inferredcites →https://doi.org/10.1090/s0002-9939-1963-0155764-9openalex-snapshot

The converse of Moore’s Garden-of-Eden theorem

inferredcites →https://doi.org/10.1142/9789812384683_0014openalex-snapshot

Cellular Automata and Complex Systems

inferredcites →https://doi.org/10.1147/rd.176.0525openalex-snapshot

Logical Reversibility of Computation

inferredcites →https://doi.org/10.3233/fi-1999-381208openalex-snapshot

On the Circuit Depth of Structurally Reversible Cellular Automata

inferredcites →https://doi.org/10.46298/dmtcs.2297openalex-snapshot

Representing Reversible Cellular Automata with Reversible Block Cellular Automata

inferredcites →https://doi.org/10.7551/mitpress/1763.001.0001openalex-snapshot

Cellular Automata Machines

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.200810008openalex-snapshot

Some applications of propositional logic to cellular automata

inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_1openalex-snapshot

Additive Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_21openalex-snapshot

Cellular Automata, Classification of

inferred← citeshttps://doi.org/10.1007/978-1-4939-6883-1_456openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_50openalex-snapshot

Classification of Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-31578-8_24openalex-snapshot

Distributed Multi-authority Attribute-Based Encryption Using Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_21openalex-snapshot

Reversible Top-Down Syntax Analysis

inferred← citeshttps://doi.org/10.1007/978-3-031-37940-6_10openalex-snapshot

Synthesis of Elementary Cellular Automata for Targeted Cache Applications

inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_7openalex-snapshot

Aspects of Reversibility for Classical Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-33924-5_21openalex-snapshot

Universality of Asynchronous Circuits Composed of Locally Reversible Elements

inferred← citeshttps://doi.org/10.1007/978-3-540-31834-7_4openalex-snapshot

Universality and Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_7openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_455-6openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-35482-3_17openalex-snapshot

Wolfram’s Classification and Computation in Cellular Automata Classes III and IV

inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_53openalex-snapshot

Reversibility of Computations in Graph-Walking Automata

inferred← citeshttps://doi.org/10.1007/978-3-662-47221-7_12openalex-snapshot

Universal Time-Symmetric Number-Conserving Cellular Automaton

inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_3openalex-snapshot

Reversible and Irreversible Computations of Deterministic Finite-State Devices

inferred← citeshttps://doi.org/10.1007/978-4-431-56606-9_10openalex-snapshot

Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-981-10-2738-3_3openalex-snapshot

On the Use of Asynchronous Cellular Automata in Symmetric-Key Cryptography

inferred← citeshttps://doi.org/10.1007/s00354-018-0034-6openalex-snapshot

Reversible Cellular Automata: From Fundamental Classical Results to Recent Developments

inferred← citeshttps://doi.org/10.1007/s10955-011-0202-2openalex-snapshot

Reversibility of 1D Cellular Automata with Periodic Boundary over Finite Fields $\pmb{ {\mathbb{Z}}}_{p}$

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/s11047-023-09949-yopenalex-snapshot

An exploration of reversible septenary number-conserving cellular automata: a survey of known methods

inferred← citeshttps://doi.org/10.1007/s41870-024-01904-zopenalex-snapshot

Wolfram’s cellular automata model for unhealthy gas leakage detection

inferred← citeshttps://doi.org/10.1016/j.amc.2006.12.058openalex-snapshot

Inverse rules of ECA with rule number 150

inferred← citeshttps://doi.org/10.1016/j.amc.2011.03.033openalex-snapshot

Reversibility of linear cellular automata

inferred← citeshttps://doi.org/10.1016/j.amc.2012.11.036openalex-snapshot

On the invertible cellular automata 150 over

inferred← citeshttps://doi.org/10.1016/j.amc.2019.03.060openalex-snapshot

A closed formula for the inverse of a reversible cellular automaton with (2R+1) -cyclic rule

inferred← citeshttps://doi.org/10.1016/j.ic.2020.104534openalex-snapshot

Efficient enumeration of three-state two-dimensional number-conserving cellular automata

inferred← citeshttps://doi.org/10.1016/j.ins.2012.02.063openalex-snapshot

Invertible behavior in elementary cellular automata with memory

inferred← citeshttps://doi.org/10.1016/j.ins.2016.01.062openalex-snapshot

On the Bernoulli automorphism of reversible linear cellular automata

inferred← citeshttps://doi.org/10.1016/j.jcss.2012.01.006openalex-snapshot

On time-symmetry in cellular automata

inferred← citeshttps://doi.org/10.1016/j.physa.2019.01.059openalex-snapshot

Modeling and simulating the matching behavior of pedestrian flow at training school during the pickup period after class

inferred← citeshttps://doi.org/10.1016/j.physd.2005.01.018openalex-snapshot

Procedures for calculating reversible one-dimensional cellular automata

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/j.tcs.2004.06.011openalex-snapshot

The complexity of reversible cellular automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.052openalex-snapshot

A tight linear bound on the synchronization delay of bijective automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.046openalex-snapshot

Three research directions in non-uniform cellular automata

inferred← citeshttps://doi.org/10.1016/j.topol.2020.107061openalex-snapshot

On entropy and reversibility of pushdown dynamical systems

inferred← citeshttps://doi.org/10.1051/ita/2016016openalex-snapshot

When input-driven pushdown automata meet reversiblity

inferred← citeshttps://doi.org/10.1080/00207721.2022.2064556openalex-snapshot

Observability and reconstructibility of bounded cellular automata

inferred← citeshttps://doi.org/10.1080/03081079.2012.695897openalex-snapshot

Computation in reversible cellular automata

inferred← citeshttps://doi.org/10.1109/dcc.2009.41openalex-snapshot

Lossy to Lossless Spatially Scalable Depth Map Coding with Cellular Automata

inferred← citeshttps://doi.org/10.1109/icnc.2012.10openalex-snapshot

Reversible Computing Systems, Logic Circuits, and Cellular Automata

inferred← citeshttps://doi.org/10.1109/roedunet-renam.2014.6955296openalex-snapshot

Pattern encryption with cellular automata - A LabVIEW implementation on FPGA

inferred← citeshttps://doi.org/10.1109/synasc.2010.28openalex-snapshot

Dilatability to Quantum Linear Cellular Automata

inferred← citeshttps://doi.org/10.1109/tip.2010.2090531openalex-snapshot

Resolution Scalable Image Coding With Reversible Cellular Automata

inferred← citeshttps://doi.org/10.1109/tla.2015.7350065openalex-snapshot

Petri Nets Representing the Evolution of Elementary Cellular Automata

inferred← citeshttps://doi.org/10.1140/epjd/e2005-00251-1openalex-snapshot

Quantum information processing and communication

inferred← citeshttps://doi.org/10.1142/9781860948534_0020openalex-snapshot

CASE: CELLULAR AUTOMATA BASED SYMMETRIC ENCRYPTION

inferred← citeshttps://doi.org/10.1142/s012905412244004xopenalex-snapshot

Reversible Top-Down Syntax Analysis

inferred← citeshttps://doi.org/10.1142/s0219878911002434openalex-snapshot

SELF-ADAPTIVE IMAGE ENCRYPTION BASED ON MEMORY CELLULAR AUTOMATA

inferred← citeshttps://doi.org/10.1155/2015/594294openalex-snapshot

Parallel Dynamical Systems over Graphs and Related Topics: A Survey

inferred← citeshttps://doi.org/10.1155/2016/5408529openalex-snapshot

An Image Encryption Scheme Based on DNA Computing and 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.14569/ijacsa.2014.050531openalex-snapshot

A fast cryptosystem using reversible cellular automata

inferred← citeshttps://doi.org/10.15760/etd.129openalex-snapshot

Design of Regular Reversible Quantum Circuits

inferred← citeshttps://doi.org/10.18297/etd/863openalex-snapshot

Cellular automata for dynamic S-boxes in cryptography.

inferred← citeshttps://doi.org/10.20381/ruor-5412openalex-snapshot

Network Decontamination with Temporal Immunity

inferred← citeshttps://doi.org/10.20381/ruor-5787openalex-snapshot

Properties and Behaviours of Fuzzy Cellular Automata

inferred← citeshttps://doi.org/10.25088/complexsystems.22.1.1openalex-snapshot

Exploring the Space of Substitution Systems

inferred← citeshttps://doi.org/10.3233/fi-2013-876openalex-snapshot

On Completeness and Decidability of Phase Space Invertible Asynchronous Cellular Automata

inferred← citeshttps://doi.org/10.3934/math.2024371openalex-snapshot

Reversibility of linear cellular automata with intermediate boundary condition

inferred← citeshttps://doi.org/10.4204/eptcs.90.19openalex-snapshot

Phase Space Invertible Asynchronous Cellular Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1304.1242openalex-snapshot

Computation and Universality: Class IV versus Class III Cellular Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1306.3546openalex-snapshot

Cellular Automata in Cryptographic Random Generators

inferred← citeshttps://doi.org/10.5772/16030openalex-snapshot

Propositional Proof Complexity and Cellular Automata

inferred← citeshttps://doi.org/10.5772/16155openalex-snapshot

Conservative Reversible Elementary Cellular Automata and their Quantum Computations

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.