On the public citation graph

k-Band-Simulation von k-Kopf-Turing-Maschinen

https://doi.org/10.1007/bf02238815
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.1016/s0019-9958(65)90399-2openalex-snapshot
One-tape, off-line 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.1145/321356.321362openalex-snapshot
Two-Tape Simulation of Multitape Turing 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-07389-2_193openalex-snapshot
Non-linear speed-up theorem for two register minsky machines
inferred← citeshttps://doi.org/10.1007/3-540-07805-3_11openalex-snapshot
X. Simulation von Turingmaschinen mit logischen Netzen
inferred← citeshttps://doi.org/10.1007/3-540-08342-1_35openalex-snapshot
Linear time simulation of multihead turing machines with head — To-head jumps
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_24openalex-snapshot
Stacks versus Deques
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_49openalex-snapshot
Cellular Automata as Models of Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_20openalex-snapshot
Cellular Automata as Models of Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_49openalex-snapshot
Cellular Automata as Models of Parallel Computation
inferred← citeshttps://doi.org/10.1007/bf01084283openalex-snapshot
Complexity of algorithms and computations
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90030-2openalex-snapshot
Real-time queue operations in pure LISP
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90001-1openalex-snapshot
On two-tape real-time computation and queues
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90063-4openalex-snapshot
On heads versus tapes
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90037-0openalex-snapshot
Linear-time simulation of multihead turing machines
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80019-4openalex-snapshot
Two nonlinear lower bounds for on-line computations
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00148-0openalex-snapshot
Parallel turing machines with one-head control units and cellular automata
inferred← citeshttps://doi.org/10.1017/cbo9780511530104openalex-snapshot
Purely Functional Data Structures
inferred← citeshttps://doi.org/10.1017/s0956796800001489openalex-snapshot
Simple and efficient purely functional queues and deques
inferred← citeshttps://doi.org/10.1070/im1985v024n03abeh001245openalex-snapshot
RECOGNITION OF AN APPROXIMATE OCCURRENCE OF WORDS ON A TURING MACHINE IN REAL TIME
inferred← citeshttps://doi.org/10.1109/sfcs.1981.25openalex-snapshot
On heads versus tapes
inferred← citeshttps://doi.org/10.1145/195058.195428openalex-snapshot
Two heads are better than two tapes
inferred← citeshttps://doi.org/10.1145/225058.225090openalex-snapshot
Persistent lists with catenation via recursive slow-down
inferred← citeshttps://doi.org/10.1145/256303.256308openalex-snapshot
Two heads are better than two tapes
inferred← citeshttps://doi.org/10.1145/321724.321726openalex-snapshot
Real-Time Simulation of Multihead Tape Units
inferred← citeshttps://doi.org/10.1145/322234.322246openalex-snapshot
New Real-Time Simulations of Multihead Tape Units
inferred← citeshttps://doi.org/10.1145/324133.324139openalex-snapshot
Purely functional, real-time deques with catenation
inferred← citeshttps://doi.org/10.1145/800061.808741openalex-snapshot
Two nonlinear lower bounds
inferred← citeshttps://doi.org/10.1145/800105.803414openalex-snapshot
New real-time simulations of multihead tape units
inferred← citeshttps://doi.org/10.1515/1569392031905557openalex-snapshot
Simulation of circuits of functional elements by the universal Turing machine
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110039openalex-snapshot
Two heads are better than two tapes
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.