On the public citation graph
Decidable problems for powerful programs
0 signed · 21 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.1007/3-540-08353-7_152openalex-snapshot
Decidability (undecidability) of equivalence of Minsky machines with components consisting of at most seven (eight) instructions
inferredcites →https://doi.org/10.1016/0304-3975(82)90131-1openalex-snapshot
Some simplified undecidable and NP-hard problems for simple programs
inferredcites →https://doi.org/10.1137/0205045openalex-snapshot
Simple Programs Realize Exactly Presburger Formulas
inferredcites →https://doi.org/10.1145/321607.321621openalex-snapshot
The Equivalence Problem of Simple Programs
inferredcites →https://doi.org/10.1145/322003.322016openalex-snapshot
Even Simple Programs Are Hard To Analyze
inferredcites →https://doi.org/10.1145/322047.322058openalex-snapshot
Reversal-Bounded Multicounter Machines and Their Decision Problems
inferredcites →https://doi.org/10.1145/322063.322074openalex-snapshot
The Complexity of Finite Memory Programs with Recursion
inferredcites →https://doi.org/10.1145/322108.322120openalex-snapshot
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
inferredcites →https://doi.org/10.1145/322261.322270openalex-snapshot
The Complexity of the Equivalence Problem for Simple Programs
inferredcites →https://doi.org/10.1145/800196.806014openalex-snapshot
The complexity of loop programs
inferredcites →https://doi.org/10.2140/pjm.1966.16.285openalex-snapshot
Semigroups, Presburger formulas, and languages
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_4openalex-snapshot
Computation Paradigms in Light of Hilbert's Tenth Problem
inferred← citeshttps://doi.org/10.1007/bf01069487openalex-snapshot
Program testing technology based on specification language
inferred← citeshttps://doi.org/10.1007/bfb0030314openalex-snapshot
The equivalence problem and correctness formulas for a simple class of programs
inferred← citeshttps://doi.org/10.1007/bfb0055058openalex-snapshot
An efficient and unified approach to the decidability of equivalence of propositional programs
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80018-8openalex-snapshot
The equivalence problem and correctness formulas for a simple class of programs
inferred← citeshttps://doi.org/10.1051/ita:2000112openalex-snapshot
On the Decidability of the Equivalence Problem for Monadic Recursive Programs
inferred← citeshttps://doi.org/10.1142/s0129054112400588openalex-snapshot
ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS
inferred← citeshttps://doi.org/10.1145/258726.258746openalex-snapshot
Complexity and uniformity of elimination in Presburger arithmetic
inferred← citeshttps://doi.org/10.1145/2629686openalex-snapshot
Temporal Specifications with Accumulative Values
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.