On the public citation graph

On relativizing auxiliary pushdown machines

https://doi.org/10.1007/bf01744301
0 signed · 22 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/bf01683260openalex-snapshot
Relativization of questions about log space computability
inferredcites →https://doi.org/10.1016/0304-3975(78)90003-8openalex-snapshot
Log space machines with multiple oracle tapes
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
inferredcites →https://doi.org/10.1145/322077.322083openalex-snapshot
On the Tape Complexity of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.1145/800135.804426openalex-snapshot
Deterministic CFL's are accepted simultaneously in polynomial time and log squared 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/3-540-16486-3_111openalex-snapshot
Parallel computation and the NC hierarchy relativized
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_54openalex-snapshot
Oracles versus proof techniques that do not relativize
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_66openalex-snapshot
Properties of probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1007/bf01692056openalex-snapshot
RelativizedNC
inferred← citeshttps://doi.org/10.1007/bf01744581openalex-snapshot
A note on relativized log space
inferred← citeshttps://doi.org/10.1007/bfb0036938openalex-snapshot
Complexity classes of alternating machines with oracles
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90017-5openalex-snapshot
Consistency in nondeterministic storage
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90066-7openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90031-1openalex-snapshot
A measure of relativized space which is faithful with respect to depth
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90034-7openalex-snapshot
Relativized alternation and space-bounded computation
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00059-0openalex-snapshot
Properties of probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1109/sfcs.1981.39openalex-snapshot
Relativizing time and space
inferred← citeshttps://doi.org/10.1137/0211048openalex-snapshot
Relativizing Time, Space, and Time-Space
inferred← citeshttps://doi.org/10.1137/0213030openalex-snapshot
Quantitative Relativizations of Complexity Classes
inferred← citeshttps://doi.org/10.1145/800070.802194openalex-snapshot
Space-bounded hierarchies and probabilistic computations
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.