On the public citation graph

A time-space tradeoff for language recognition

https://doi.org/10.1007/bf01744430
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/0022-0000(83)90002-8openalex-snapshot
Time-space-optimal string matching
inferredcites →https://doi.org/10.1016/0304-3975(82)90087-1openalex-snapshot
Fooling a two way automation or one pushdown store is better than one counter for two way machines
inferredcites →https://doi.org/10.1109/sfcs.1979.4openalex-snapshot
A time-space tradeoff for sorting on non-oblivious machines
inferredcites →https://doi.org/10.1109/swat.1966.30openalex-snapshot
The recognition problem for the set of perfect squares
inferredcites →https://doi.org/10.1145/322063.322065openalex-snapshot
Optimal Arrangement of Keys in a Hash Table
inferredcites →https://doi.org/10.1145/322063.322076openalex-snapshot
k + 1 Heads Are Better than k
inferredcites →https://doi.org/10.1145/800141.804677openalex-snapshot
A time-space tradeoff for sorting on a general sequential model of computation

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1999.1671openalex-snapshot
Time–Space Tradeoffs for Satisfiability
inferred← citeshttps://doi.org/10.1006/jcss.2001.1767openalex-snapshot
Time–Space Tradeoffs for SAT on Nonuniform Machines
inferred← citeshttps://doi.org/10.1007/3-540-16761-7_65openalex-snapshot
Tradeoffs for language recognition on parallel computing models
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_32openalex-snapshot
Multi-party Finite Computations
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-642-40273-9_9openalex-snapshot
Computing (and Life) Is All about Tradeoffs
inferred← citeshttps://doi.org/10.1007/bf00267046openalex-snapshot
Fooling a two-way nondeterministic multihead automaton with reversal number restriction
inferred← citeshttps://doi.org/10.1007/bfb0039603openalex-snapshot
Reversal complexity of multicounter and multihead machines
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90029-1openalex-snapshot
Time-space tradeoffs for matrix multiplication and the discrete fourier transform on any general sequential random-access computer
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90010-xopenalex-snapshot
Lower bounds for language recognition on two-dimensional alternating multihead machines
inferred← citeshttps://doi.org/10.1016/0022-0000(91)90014-vopenalex-snapshot
Time-space tradeoffs for algebraic problems on general sequential machines
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90047-mopenalex-snapshot
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90150-7openalex-snapshot
Two time-space tradeoffs for element distinctness
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90078-9openalex-snapshot
Tradeoffs for language recognition on alternating machines
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90379-gopenalex-snapshot
Separation of deterministic, nondeterministic and alternating complexity classes
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104744openalex-snapshot
Constant-space, constant-randomness verifiers with arbitrarily small error
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00227-1openalex-snapshot
Lower bounds on the complexity of recognizing SAT by Turing machines
inferred← citeshttps://doi.org/10.1109/ccc.1997.612300openalex-snapshot
Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21925openalex-snapshot
Near-optimal time-space tradeoff for element distinctness
inferred← citeshttps://doi.org/10.1137/s0097539788148959openalex-snapshot
Near-Optimal Time-Space Tradeoff for Element Distinctness
inferred← citeshttps://doi.org/10.1145/1101821.1101822openalex-snapshot
Time-space lower bounds for satisfiability
inferred← citeshttps://doi.org/10.1145/62212.62239openalex-snapshot
Nondeterministic linear tasks may require substantially nonlinear deterministic time in the case of sublinear work space
inferred← citeshttps://doi.org/10.1145/73007.73008openalex-snapshot
Multiparty protocols and logspace-hard pseudorandom sequences
inferred← citeshttps://doi.org/10.1145/79147.214070openalex-snapshot
Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space
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.