On the public citation graph

On time versus space III

https://doi.org/10.1007/bf01704903
0 signed · 28 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/bf01752397openalex-snapshot
Space-bounded simulation of multitape turing machines
inferredcites →https://doi.org/10.1016/0022-0000(79)90042-4openalex-snapshot
A class of algorithms which require nonlinear time to maintain disjoint sets
inferredcites →https://doi.org/10.1016/0022-0000(80)90056-2openalex-snapshot
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
inferredcites →https://doi.org/10.1016/0022-0000(81)90035-0openalex-snapshot
On time versus space II
inferredcites →https://doi.org/10.1016/0022-0000(82)90005-8openalex-snapshot
A general class of resource tradeoffs
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/0304-3975(81)90084-0openalex-snapshot
A space bound for one-tape multidimensional Turing machines
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-0-12-389450-2.50014-1openalex-snapshot
Time and Space††This research was supported in part under N S F grant GJ 43634X, contract number DCR 7412997 A01.
inferredcites →https://doi.org/10.1016/s0022-0000(72)80017-5openalex-snapshot
Tape bounds for time-bounded turing machines
inferredcites →https://doi.org/10.1137/0209036openalex-snapshot
Storage Modification Machines
inferredcites →https://doi.org/10.1137/0211022openalex-snapshot
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
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

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-322-80139-5_5openalex-snapshot
Zeit- versus Platzkomplexität
inferred← citeshttps://doi.org/10.1007/978-3-322-95233-2_15openalex-snapshot
Communication Complexity and Lower Bounds for Sequential Computation
inferred← citeshttps://doi.org/10.1007/s00224-009-9237-zopenalex-snapshot
Parallelizing Time with Polynomial Circuits
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90117-8openalex-snapshot
Space measures for storage modification machines
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00082-3openalex-snapshot
On parallel Turing machines with multi-head control units
inferred← citeshttps://doi.org/10.1109/ccc.2001.933895openalex-snapshot
On separators, segregators and time versus space
inferred← citeshttps://doi.org/10.1145/1073970.1073995openalex-snapshot
Parallelizing time with polynomial circuits
inferred← citeshttps://doi.org/10.1145/2493246.2493249openalex-snapshot
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
inferred← citeshttps://doi.org/10.1145/3717823.3718225openalex-snapshot
Simulating Time with Square-Root Space
inferred← citeshttps://doi.org/10.1145/72935.72946openalex-snapshot
The power of parallel pointer manipulation
inferred← citeshttps://doi.org/10.4204/eptcs.374.4openalex-snapshot
Time and Space Measures for a Complete Graph Computation Model
inferred← citeshttps://doi.org/10.48550/arxiv.1001.0746openalex-snapshot
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
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.