On the public citation graph

Computational complexity of random access stored program machines

https://doi.org/10.1007/bf01694180
0 signed · 50 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/bf02759719openalex-snapshot
Real time computation
inferredcites →https://doi.org/10.1016/s0019-9958(65)90399-2openalex-snapshot
One-tape, off-line Turing machine computations
inferredcites →https://doi.org/10.1016/s0022-0000(68)80027-3openalex-snapshot
Tape-reversal bounded turing machine computations
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1109/swat.1968.33openalex-snapshot
Tape reversal complexity hierarchies
inferredcites →https://doi.org/10.1145/321239.321240openalex-snapshot
Random-Access Stored-Program Machines, an Approach to Programming Languages
inferredcites →https://doi.org/10.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing Machines
inferredcites →https://doi.org/10.1145/321386.321395openalex-snapshot
A Machine-Independent Theory of the Complexity of Recursive Functions
inferredcites →https://doi.org/10.1145/321450.321464openalex-snapshot
Computational Complexity of One-Tape Turing Machine Computations
inferredcites →https://doi.org/10.1145/800169.805423openalex-snapshot
Classes of computable functions defined by bounds on computation

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-06859-7_138openalex-snapshot
Non-existence of program optimizers in an abstract setting
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_148openalex-snapshot
Optimal rasp programs for arbitrarily complex 0–1 valued functions
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_108openalex-snapshot
Complexity of Sequence Encodings
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_31openalex-snapshot
Parallel and nondeterministic time complexity classes
inferred← citeshttps://doi.org/10.1007/978-1-4899-3797-1_3openalex-snapshot
C
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_41openalex-snapshot
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-41284-4_10openalex-snapshot
Detecting Traditional Packers, Decisively
inferred← citeshttps://doi.org/10.1007/978-94-009-6000-8_1openalex-snapshot
C
inferred← citeshttps://doi.org/10.1007/bf00289513openalex-snapshot
On non-determinancy in simple computing devices
inferred← citeshttps://doi.org/10.1007/bf00571464openalex-snapshot
Berechnung und Programm. II
inferred← citeshttps://doi.org/10.1007/bf01786979openalex-snapshot
Parallel random access machines with powerful instruction sets
inferred← citeshttps://doi.org/10.1007/s002360000038openalex-snapshot
Computational complexity via programming languages: constant factors do matter
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90001-0openalex-snapshot
Priority queues with update and finding minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.003openalex-snapshot
A survey of state vectors
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.12.009openalex-snapshot
BSF: A parallel computation model for scalability estimation of iterative numerical algorithms on cluster computing systems
inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80029-7openalex-snapshot
Time bounded random access machines
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80055-3openalex-snapshot
Predecessor machines
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80008-6openalex-snapshot
Nonexistence of program optimizers in several abstract settings
inferred← citeshttps://doi.org/10.1016/s0022-0000(76)80037-2openalex-snapshot
A characterization of the power of vector machines
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1098/rsta.2011.0332openalex-snapshot
From Turing machines to computer viruses
inferred← citeshttps://doi.org/10.1109/fpga.1993.279470openalex-snapshot
High performance analysis and control of complex systems using dynamically reconfigurable silicon and optical fiber memory
inferred← citeshttps://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferred← citeshttps://doi.org/10.1137/0205018openalex-snapshot
On Families of Languages Defined by Time-Bounded Random Access Machines
inferred← citeshttps://doi.org/10.1137/0205034openalex-snapshot
Computational Complexity of Multiple Recursive Schemata
inferred← citeshttps://doi.org/10.1137/0211042openalex-snapshot
The Hamiltonian Circuit Problem is Polynomial for 4-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1145/1008311.1008315openalex-snapshot
Microprogrammed random access stored program machines
inferred← citeshttps://doi.org/10.1145/322108.322119openalex-snapshot
Time Bounded Random Access Machines with Parallel Processing
inferred← citeshttps://doi.org/10.1145/800152.804898openalex-snapshot
Time-bounded random access machines
inferred← citeshttps://doi.org/10.1145/800152.804899openalex-snapshot
Predecessor machines and regressing functions
inferred← citeshttps://doi.org/10.1145/873661.873663openalex-snapshot
Some thoughts on graduate education in computer science
inferred← citeshttps://doi.org/10.1186/2194-3206-2-3openalex-snapshot
A theoretical formalism for analyzing agent-based models
inferred← citeshttps://doi.org/10.14232/phd.1891openalex-snapshot
Applications of Support Vector-Based Learning
inferred← citeshttps://doi.org/10.14529/cmse190304openalex-snapshot
Survey of Parallel Computation Models
inferred← citeshttps://doi.org/10.18419/opus-2447openalex-snapshot
AIDA II - Abschlußbericht
inferred← citeshttps://doi.org/10.31144/bncc.cs.2542-1972.2013.n35.p39-56openalex-snapshot
FORMAL VERIFICATION OF PROGRAMS FOR ABSTRACT REGISTER MACHINES
inferred← citeshttps://doi.org/10.3233/com-180090openalex-snapshot
Expressiveness, meanings and machines
inferred← citeshttps://doi.org/10.3389/fncom.2016.00065openalex-snapshot
Computational Modeling of Single Neuron Extracellular Electric Potentials and Network Local Field Potentials using LFPsim
inferred← citeshttps://doi.org/10.4324/9781351001885-2openalex-snapshot
Intelligence Without Reason
inferred← citeshttps://doi.org/10.7282/t34m9501openalex-snapshot
What algorithms could not be
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.