On the public citation graph
Counting Complexity of Period-3 Orbits in Sequential Dynamical Systems and Their Relationship to Error-Correcting Codes over Ternary Fields
0 signed · 29 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/aama.1998.0595openalex-snapshot
Acyclic Orientations of Random Graphs
inferredcites →https://doi.org/10.1006/aama.2000.0717openalex-snapshot
Equivalence Relations on Finite Dynamical Systems
inferredcites →https://doi.org/10.1006/aama.2001.0761openalex-snapshot
On Acyclic Orientations and Sequential Dynamical Systems
inferredcites →https://doi.org/10.1007/bf02523189openalex-snapshot
Finding and counting given length cycles
inferredcites →https://doi.org/10.1007/s00022-023-00709-yopenalex-snapshot
On maximal cliques in the graph of simplex codes
inferredcites →https://doi.org/10.1007/s00373-025-03008-2openalex-snapshot
Period-3 Orbits of Sequential Dynamical Systems and Their Relationship to Error-Correcting Codes over Finite Fields
inferredcites →https://doi.org/10.1007/s13369-013-0757-0openalex-snapshot
Error Correcting Codes via Reversible Cellular Automata Over Finite Fields
inferredcites →https://doi.org/10.1016/0012-365x(94)00222-5openalex-snapshot
Acyclic orientations of complete bipartite graphs
inferredcites →https://doi.org/10.1016/0166-218x(93)90140-jopenalex-snapshot
The covering radius of the cycle code of a graph
inferredcites →https://doi.org/10.1016/j.ins.2017.05.002openalex-snapshot
On periods and equilibria of computational sequential systems
inferredcites →https://doi.org/10.1016/j.ipl.2015.07.001openalex-snapshot
A new binary code of length 16 and minimum distance 3
inferredcites →https://doi.org/10.1016/j.jcss.2022.01.004openalex-snapshot
Complexity of fixed point counting problems in Boolean networks
inferredcites →https://doi.org/10.1016/j.tcs.2014.06.042openalex-snapshot
Limit cycle structure for dynamic bi-threshold systems
inferredcites →https://doi.org/10.1016/s0012-365x(97)00201-xopenalex-snapshot
The connectivity of acyclic orientation graphs
inferredcites →https://doi.org/10.1088/0951-7715/22/2/010openalex-snapshot
Cycle equivalence of graph dynamical systems
inferredcites →https://doi.org/10.1088/1751-8113/45/21/215303openalex-snapshot
Graph states in phase space
inferredcites →https://doi.org/10.1142/s0129183112500660openalex-snapshot
REVERSIBLE CELLULAR AUTOMATA WITH PENTA-CYCLIC RULE AND ECCs
inferredcites →https://doi.org/10.1145/2543629openalex-snapshot
Listing All Maximal Cliques in Large Sparse Real-World Graphs
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.1587/transinf.e96.d.1286openalex-snapshot
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments
inferredcites →https://doi.org/10.3103/s0146411610070060openalex-snapshot
Relationships between the clique number, chromatic number, and the degree for some graphs
inferredcites →https://doi.org/10.3390/a5040545openalex-snapshot
Exact Algorithms for Maximum Clique: A Computational Study
inferredcites →https://doi.org/10.3390/e21111118openalex-snapshot
A Note on Graphs with Prescribed Orbit Structure
inferredcites →https://doi.org/10.3906/mat-1503-18openalex-snapshot
The reversibility problem for a family of two-dimensional cellular automata
inferredcites →https://doi.org/10.4153/cjm-1960-035-0openalex-snapshot
The Number of k-Coloured Graphs on Labelled Nodes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.