On the public citation graph

Two tapes versus one for off-line Turing machines

https://doi.org/10.1007/bf01275490
0 signed · 26 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-16486-3_101openalex-snapshot
The power of the queue
inferredcites →https://doi.org/10.1007/3-540-16486-3_103openalex-snapshot
An optimal lower bound for turing machines with one work tape and a two-way input tape
inferredcites →https://doi.org/10.1007/bf02759719openalex-snapshot
Real time computation
inferredcites →https://doi.org/10.1016/0020-0190(89)90160-9openalex-snapshot
The speed of copying on one-tape off-line Turing machines
inferredcites →https://doi.org/10.1016/0022-0000(84)90033-3openalex-snapshot
The performance of multilective VLSI algorithms
inferredcites →https://doi.org/10.1016/0022-0000(88)90002-5openalex-snapshot
Meanders and their applications in lower bounds arguments
inferredcites →https://doi.org/10.1016/0304-3975(90)90080-2openalex-snapshot
Lower bounds to the complexity of symmetric Boolean functions
inferredcites →https://doi.org/10.1016/0304-3975(93)90194-xopenalex-snapshot
The complexity of matrix transposition on one-tape off-line Turing machines with output tape
inferredcites →https://doi.org/10.1016/0890-5401(88)90003-xopenalex-snapshot
Tape versus queue and stacks: The lower bounds
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-1985-0808746-4openalex-snapshot
Combinatorial lower bound arguments for deterministic and nondeterministic Turing machines
inferredcites →https://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1145/28395.28406openalex-snapshot
Two tapes are better than one for off-line Turing machines
inferredcites →https://doi.org/10.1145/800061.808741openalex-snapshot
Two nonlinear lower bounds

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10703163_2openalex-snapshot
Descriptive Complexity, Lower Bounds and Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_13openalex-snapshot
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_111openalex-snapshot
Matching upper and lower bounds for simulations of several tapes on one multidimensional tape
inferred← citeshttps://doi.org/10.1007/978-3-322-80139-5_4openalex-snapshot
Vergleich von Speicherstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8openalex-snapshot
An irregular mind : Szemerédi is 70
inferred← citeshttps://doi.org/10.1007/bf01277954openalex-snapshot
On the complexity of planar Boolean circuits
inferred← citeshttps://doi.org/10.1007/bfb0029950openalex-snapshot
Communication complexity and sequential computation
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.020openalex-snapshot
A time lower bound for satisfiability
inferred← citeshttps://doi.org/10.1145/195058.195428openalex-snapshot
Two heads are better than two tapes
inferred← citeshttps://doi.org/10.1145/256303.256308openalex-snapshot
Two heads are better than two tapes
inferred← citeshttps://doi.org/10.2139/ssrn.3638937openalex-snapshot
A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory
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.