On the public citation graph

Space-bounded simulation of multitape turing machines

https://doi.org/10.1007/bf01752397
0 signed · 16 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/3-540-10003-2_96openalex-snapshot
A "fast implementation" of a multidimensional storage into a tree storage
inferredcites →https://doi.org/10.1016/s0022-0000(72)80017-5openalex-snapshot
Tape bounds for time-bounded turing machines
inferredcites →https://doi.org/10.1109/sfcs.1979.30openalex-snapshot
On time versus space II
inferredcites →https://doi.org/10.1145/321466.321474openalex-snapshot
Relations Between Time and Tape Complexities
inferredcites →https://doi.org/10.1145/322003.322015openalex-snapshot
On Time Versus Space
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.1006/inco.1994.1053openalex-snapshot
A Guide for New Referees in Theoretical Computer Science
inferred← citeshttps://doi.org/10.1007/3-540-51498-8_29openalex-snapshot
Some time-space bounds for one-tape deterministic turing machines
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_33openalex-snapshot
The Size and Depth of Layered Boolean Circuits
inferred← citeshttps://doi.org/10.1007/bf01704903openalex-snapshot
On time versus space III
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90034-7openalex-snapshot
Relativized alternation and space-bounded computation
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.11.023openalex-snapshot
The size and depth of layered Boolean circuits
inferred← citeshttps://doi.org/10.1109/icci.1992.227698openalex-snapshot
Nondeterministic and alternating computations
inferred← citeshttps://doi.org/10.1137/0219034openalex-snapshot
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones
inferred← citeshttps://doi.org/10.1145/3717823.3718225openalex-snapshot
Simulating Time with Square-Root Space
inferred← citeshttps://doi.org/10.1145/74074.74090openalex-snapshot
A guide for new referees in theoretical computer science
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.