On the public citation graph

On alternation II

https://doi.org/10.1007/bf00286494
0 signed · 53 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-08353-7_135openalex-snapshot
Graph-theoretic arguments in low-level complexity
inferredcites →https://doi.org/10.1007/bf00264255openalex-snapshot
On alternation
inferredcites →https://doi.org/10.1007/bf00265223openalex-snapshot
The network complexity and the Turing machine complexity of finite functions
inferredcites →https://doi.org/10.1007/bf00289150openalex-snapshot
Time-space trade-offs in a pebble game
inferredcites →https://doi.org/10.1109/sfcs.1975.23openalex-snapshot
On time versus space and related problems
inferredcites →https://doi.org/10.1109/sfcs.1976.20openalex-snapshot
On parallelism in turing machines
inferredcites →https://doi.org/10.1145/322123.322138openalex-snapshot
Relations Among Complexity Measures
inferredcites →https://doi.org/10.1145/800113.803643openalex-snapshot
Space bounds for a game on graphs
inferredcites →https://doi.org/10.1145/800116.803752openalex-snapshot
On non-linear lower bounds in computational complexity

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-16078-7_72openalex-snapshot
Speeding up random access machines by few processors
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_104openalex-snapshot
Separation results for bounded alternation
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_110openalex-snapshot
Bounded oracles and complexity classes inside linear space
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_137openalex-snapshot
Are parallel machines always faster than sequential machines?
inferred← citeshttps://doi.org/10.1007/978-3-319-56617-7_1openalex-snapshot
Depth-Robust Graphs and Their Cumulative Memory Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_15openalex-snapshot
On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i
inferred← citeshttps://doi.org/10.1007/978-3-662-58387-6_18openalex-snapshot
On the Computational Complexity of Minimal Cumulative Cost Graph Pebbling
inferred← citeshttps://doi.org/10.1007/bf01301970openalex-snapshot
Alternating time versus deterministic time: A separation
inferred← citeshttps://doi.org/10.1007/bf01744432openalex-snapshot
Towards separating nondeterminism from determinism
inferred← citeshttps://doi.org/10.1007/bfb0012787openalex-snapshot
Advances in pebbling
inferred← citeshttps://doi.org/10.1007/bfb0015931openalex-snapshot
Some properties of space-bounded synchronized alternating turing machines with only universal states
inferred← citeshttps://doi.org/10.1007/bfb0017175openalex-snapshot
On the power of communication in alternating machines
inferred← citeshttps://doi.org/10.1007/bfb0020804openalex-snapshot
Interactive proof systems and alternating time-space complexity
inferred← citeshttps://doi.org/10.1007/bfb0045109openalex-snapshot
Tally languages accepted by alternating multitape finite automata
inferred← citeshttps://doi.org/10.1007/s00037-013-0069-5openalex-snapshot
Amplifying circuit lower bounds against polynomial time, with applications
inferred← citeshttps://doi.org/10.1007/s00224-009-9237-zopenalex-snapshot
Parallelizing Time with Polynomial Circuits
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90098-9openalex-snapshot
A note on alternating on-line Turing machines
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90011-xopenalex-snapshot
Speedups of deterministic machines by synchronous parallel machines
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90093-2openalex-snapshot
Two-dimensional alternating turing machines
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90165-3openalex-snapshot
On the structure of one-tape nondeterministic turing machine time hierarchy
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90210-kopenalex-snapshot
Interactive proof systems and alternating time—space complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90247-xopenalex-snapshot
Speedup of determinism by alternation for multidimensional Turing machines
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80042-xopenalex-snapshot
Fast probabilistic RAM simulation of single tape turing machine computations
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00124-7openalex-snapshot
Three-dimensional alternating Turing machines with only universal states
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1109/ccc.2001.933895openalex-snapshot
On separators, segregators and time versus space
inferred← citeshttps://doi.org/10.1109/ccc.2012.44openalex-snapshot
Amplifying Circuit Lower Bounds against Polynomial Time with Applications
inferred← citeshttps://doi.org/10.1109/icci.1992.227698openalex-snapshot
Nondeterministic and alternating computations
inferred← citeshttps://doi.org/10.1109/sct.1993.336520openalex-snapshot
Alternating time versus deterministic time: a separation
inferred← citeshttps://doi.org/10.1109/sfcs.1981.23openalex-snapshot
Non-existence of one-dimensional expanding graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1981.51openalex-snapshot
Towards separating nondeterministic time from deterministic time
inferred← citeshttps://doi.org/10.1109/sfcs.1983.38openalex-snapshot
On depth-reduction and grates
inferred← citeshttps://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814618openalex-snapshot
On the complexity of SAT
inferred← citeshttps://doi.org/10.1145/1073970.1073995openalex-snapshot
Parallelizing time with polynomial circuits
inferred← citeshttps://doi.org/10.1145/2422436.2422479openalex-snapshot
Publicly verifiable proofs of sequential work
inferred← citeshttps://doi.org/10.1145/2559903openalex-snapshot
Nonuniform ACC Circuit Lower Bounds
inferred← citeshttps://doi.org/10.1145/3717823.3718225openalex-snapshot
Simulating Time with Square-Root Space
inferred← citeshttps://doi.org/10.1145/65780.65782openalex-snapshot
Figures of merit
inferred← citeshttps://doi.org/10.1145/800061.808763openalex-snapshot
Speedups of deterministic machines by synchronous parallel machines
inferred← citeshttps://doi.org/10.1145/800061.808764openalex-snapshot
Alternation and the power of nondeterminism
inferred← citeshttps://doi.org/10.1145/800070.802175openalex-snapshot
Two-dimensional alternating Turing machines
inferred← citeshttps://doi.org/10.4036/iis.2022.r.06openalex-snapshot
Computational Complexity of Puzzles and Related Topics
inferred← citeshttps://doi.org/10.48550/arxiv.2011.09093openalex-snapshot
Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines
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.