On the public citation graph
Automata, Languages and Programming
0 signed · 43 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90170-xopenalex-snapshot
Cyclotomic polynomials and unions of groups
inferred← citeshttps://doi.org/10.1016/0022-0000(81)90073-8openalex-snapshot
An efficient interpreter for the lambda-calculus
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90016-6openalex-snapshot
Elementary data structures in ALGOL-like languages
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90027-0openalex-snapshot
Generating function versions with rational strictness patterns
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90032-xopenalex-snapshot
Simple chain grammars and languages
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90060-8openalex-snapshot
Programs as partial graphs I: Flow equivalence and correctness
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90067-0openalex-snapshot
A parsing automata approach to LR theory
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90028-2openalex-snapshot
Completing biprefix codes
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90018-5openalex-snapshot
Hierarchies of primitive recursive wordsequence functions: Comparisons and decision problems
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90088-4openalex-snapshot
Expressive power of typed and type-free programming languages
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90053-2openalex-snapshot
The complexity of counting homeomorphs
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90172-6openalex-snapshot
Relational algebraic semantics of deterministic and nondeterministic programs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90081-4openalex-snapshot
A short scientific biography of Corrado Böhm
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.07.004openalex-snapshot
Polygon guarding with orientation
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.11.006openalex-snapshot
The L(h,1,1) -labelling problem for trees
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.05.001openalex-snapshot
Semi-automated verification of security proofs of quantum cryptographic protocols
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/s0004-3702(02)00378-8openalex-snapshot
On the undecidability of probabilistic planning and related stochastic optimization problems
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80020-0openalex-snapshot
Unbounded program memory adds to the expressive power of first-order programming logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00225-3openalex-snapshot
On projective and separable properties
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00321-0openalex-snapshot
Makanin's algorithm is not primitive recursive
inferred← citeshttps://doi.org/10.1080/17445760.2016.1188927openalex-snapshot
A bigraphical model for specifying cloud-based elastic systems and their behaviour
inferred← citeshttps://doi.org/10.1103/physreva.103.032224openalex-snapshot
Coarse-grained quantum cellular automata
inferred← citeshttps://doi.org/10.1103/physrevlett.112.140504openalex-snapshot
Asymptotically Optimal Topological Quantum Compiling
inferred← citeshttps://doi.org/10.1117/12.2078857openalex-snapshot
Exploring hierarchical visualization designs using phylogenetic trees
inferred← citeshttps://doi.org/10.1145/3409964.3461811openalex-snapshot
Supervised Average Consensus in Anonymous Dynamic Networks
inferred← citeshttps://doi.org/10.18653/v1/w17-34openalex-snapshot
Proceedings of the 15th Meeting on the Mathematics of Language
inferred← citeshttps://doi.org/10.18653/v1/w17-3410openalex-snapshot
(Re)introducing Regular Graph Languages
inferred← citeshttps://doi.org/10.2140/obs.2013.1.235openalex-snapshot
Counting value sets: algorithm and complexity
inferred← citeshttps://doi.org/10.31577/cai_2020_5_952openalex-snapshot
A MapReduce Algorithm for Minimum Vertex Cover Problems and Its Randomization
inferred← citeshttps://doi.org/10.3311/ccc2022-027openalex-snapshot
The Role of Friction in Complex Organization Networks
inferred← citeshttps://doi.org/10.3390/axioms13120838openalex-snapshot
Simultaneous Method for Solving Certain Systems of Matrix Equations with Two Unknowns
inferred← citeshttps://doi.org/10.3390/jsan14030062openalex-snapshot
An Adaptive PSO Approach with Modified Position Equation for Optimizing Critical Node Detection in Large-Scale Networks: Application to Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3390/s20174769openalex-snapshot
A Novel Simulated Annealing Based Strategy for Balanced UAV Task Assignment and Path Planning
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.