On the public citation graph

On the Computational Complexity of Program Scheme Equivalence

0 signed · 25 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/bf00264025openalex-snapshot
Describing an algorithm by Hopcroft
inferredcites →https://doi.org/10.1016/s0022-0000(69)80027-9openalex-snapshot
Regular expressions and the equivalence of programs
inferredcites →https://doi.org/10.1016/s0022-0000(70)80022-8openalex-snapshot
On formalised computer programs
inferredcites →https://doi.org/10.1016/s0022-0000(73)80040-6openalex-snapshot
Program schemes, recursion schemes, and formal languages
inferredcites →https://doi.org/10.1145/321607.321621openalex-snapshot
The Equivalence Problem of Simple Programs
inferredcites →https://doi.org/10.1145/321765.321780openalex-snapshot
Decidable Properties of Monadic Functional Schemas
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-10843-2_24openalex-snapshot
On the complexity of simple arithmetic expressions
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_83openalex-snapshot
Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report)
inferred← citeshttps://doi.org/10.1007/bf01744435openalex-snapshot
A note on the complexity of program evaluation
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90016-3openalex-snapshot
Weak equivalence in a class of structured program schemes
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90021-7openalex-snapshot
The complexity of monadic recursion schemes: exponential time bounds
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90012-3openalex-snapshot
On the complexity of simple arithmetic expressions
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90091-9openalex-snapshot
The complexity of monadic recursion schemes: Executability problems, nesting depth, and applications
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.08.001openalex-snapshot
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
inferred← citeshttps://doi.org/10.1016/j.jlap.2011.04.009openalex-snapshot
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
inferred← citeshttps://doi.org/10.1017/s0960129511000223openalex-snapshot
On the computational complexity of dynamic slicing problems for program schemas
inferred← citeshttps://doi.org/10.1109/icalt.2017.147openalex-snapshot
Automated Personalized Assessment of Computational Thinking MOOC Assignments
inferred← citeshttps://doi.org/10.1109/sfcs.1980.45openalex-snapshot
The complexity of recursion schemes and recursive programming languages
inferred← citeshttps://doi.org/10.1109/tps-isa58951.2023.00019openalex-snapshot
Metamorphic Malware Evolution: The Potential and Peril of Large Language Models
inferred← citeshttps://doi.org/10.1137/0219003openalex-snapshot
The Complexity of Very Simple Boolean Formulas with Applications
inferred← citeshttps://doi.org/10.1145/1634.1639openalex-snapshot
Algebraic Structures with Hard Equivalence and Minimization Problems
inferred← citeshttps://doi.org/10.1145/322290.322304openalex-snapshot
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
inferred← citeshttps://doi.org/10.21468/scipostphys.14.6.173openalex-snapshot
Many bounded versions of undecidable problems are NP-hard
inferred← citeshttps://doi.org/10.3233/fi-2016-1410openalex-snapshot
An Efficient Equivalence-checking Algorithm for a Model of Programs with Commutative and Absorptive Statements
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.