On the public citation graph

Fast Simulation of Turing Machines by Random Access Machines

https://doi.org/10.1137/0217005
0 signed · 31 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/bf01936140openalex-snapshot
Notes on the complexity of sorting in abstract machines
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0022-0000(83)90002-8openalex-snapshot
Time-space-optimal string matching
inferredcites →https://doi.org/10.1016/0022-0000(84)90019-9openalex-snapshot
Minimizing access pointers into trees and arrays
inferredcites →https://doi.org/10.1016/0022-0000(85)90011-xopenalex-snapshot
Speedups of deterministic machines by synchronous parallel machines
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(84)90112-5openalex-snapshot
An introduction to operating systems
inferredcites →https://doi.org/10.1016/s0019-9958(84)80042-xopenalex-snapshot
Fast probabilistic RAM simulation of single tape turing machine computations
inferredcites →https://doi.org/10.1016/s0022-0000(73)80029-7openalex-snapshot
Time bounded random access machines
inferredcites →https://doi.org/10.1109/sfcs.1975.23openalex-snapshot
On time versus space and related problems
inferredcites →https://doi.org/10.1137/0209036openalex-snapshot
Storage Modification Machines

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-54487-9_60openalex-snapshot
RAM with compact memory: a realistic and robust model of computation
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_16openalex-snapshot
Linear time algorithms and NP-complete problems
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_137openalex-snapshot
Are parallel machines always faster than sequential machines?
inferred← citeshttps://doi.org/10.1007/3-540-60609-2_1openalex-snapshot
Parallel machine models: How they are and where are they going
inferred← citeshttps://doi.org/10.1007/978-3-322-80139-5_2openalex-snapshot
Weitere Maschinenmodelle
inferred← citeshttps://doi.org/10.1007/bf00196726openalex-snapshot
Secure implementation of identification systems
inferred← citeshttps://doi.org/10.1007/bf01205055openalex-snapshot
Invariance properties of RAMS and linear time
inferred← citeshttps://doi.org/10.1007/bf01213861openalex-snapshot
The complexity of on-line simulations between multidimensional turing machines and random access machines
inferred← citeshttps://doi.org/10.1007/bf02127798openalex-snapshot
Sorting, linear time and the satisfiability problem
inferred← citeshttps://doi.org/10.1007/bfb0032027openalex-snapshot
Normalizing and accelerating RAM computations and the problem of reasonable space measures
inferred← citeshttps://doi.org/10.1007/bfb0037429openalex-snapshot
A seven-head dragon for optimal pattern searching
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90052-1openalex-snapshot
The problem of space invariance for sequential machines
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferred← citeshttps://doi.org/10.1109/icci.1993.315406openalex-snapshot
On the difference between Turing machine time and random-access machine time
inferred← citeshttps://doi.org/10.1137/0221056openalex-snapshot
Optimal On-Line Simulations of Tree Machines by Random Access Machines
inferred← citeshttps://doi.org/10.1137/s0097539791223206openalex-snapshot
Linear Time Algorithms and NP-Complete Problems
inferred← citeshttps://doi.org/10.1137/s0097539793251888openalex-snapshot
Linear Time and Memory-Efficient Computation
inferred← citeshttps://doi.org/10.1145/166589.166591openalex-snapshot
Machine models and linear time complexity
inferred← citeshttps://doi.org/10.1145/2422436.2422481openalex-snapshot
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/44483.44492openalex-snapshot
A nonlinear lower bound for random-access machines under logarithmic cost
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.