On the public citation graph
On alternation
0 signed · 76 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-08342-1_26openalex-snapshot
About the derivation languages of grammars and machines
inferredcites →https://doi.org/10.1016/s0019-9958(65)90399-2openalex-snapshot
One-tape, off-line Turing machine computations
inferredcites →https://doi.org/10.1016/s0022-0000(70)80031-9openalex-snapshot
Time- and tape-bounded turing acceptors and AFLs
inferredcites →https://doi.org/10.1016/s0022-0000(72)80017-5openalex-snapshot
Tape bounds for time-bounded turing machines
inferredcites →https://doi.org/10.1109/focs.1965.11openalex-snapshot
Hierarchies of memory limited computations
inferredcites →https://doi.org/10.1109/sfcs.1976.20openalex-snapshot
On parallelism in turing machines
inferredcites →https://doi.org/10.1109/sfcs.1977.23openalex-snapshot
Precise bounds for presburger arithmetic and the reals with addition: Preliminary report
inferredcites →https://doi.org/10.1109/sfcs.1977.6openalex-snapshot
Applications of a planar separator theorem
inferredcites →https://doi.org/10.1145/322123.322138openalex-snapshot
Relations Among Complexity Measures
inferredcites →https://doi.org/10.1145/800105.803418openalex-snapshot
Propositional modal logic of programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11537311_27openalex-snapshot
Shrinking Multi-pushdown Automata
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_24openalex-snapshot
A graph theoretic approach to determinism versus non-determinism
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-45132-3_16openalex-snapshot
Speeding-Up Cellular Automata by Alternations
inferred← citeshttps://doi.org/10.1007/3-540-55210-3_194openalex-snapshot
New time hierarchy results for deterministic TMS
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_149openalex-snapshot
A new parallel vector model, with exact characterization of NCk
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_144openalex-snapshot
Speeding-up single-tape nondeterministic computations by single alternation, with separation results
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_29openalex-snapshot
Theory of One Tape Linear Time Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_46openalex-snapshot
A Time Hierarchy Theorem for Nondeterministic Cellular Automata
inferred← citeshttps://doi.org/10.1007/bf01193576openalex-snapshot
Communication for alternating machines
inferred← citeshttps://doi.org/10.1007/bf01301970openalex-snapshot
Alternating time versus deterministic time: A separation
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/bfb0017167openalex-snapshot
Two applications of fürer's counter to one-tape nondeterministic TMs
inferred← citeshttps://doi.org/10.1007/bfb0017175openalex-snapshot
On the power of communication in alternating machines
inferred← citeshttps://doi.org/10.1007/bfb0045109openalex-snapshot
Tally languages accepted by alternating multitape finite automata
inferred← citeshttps://doi.org/10.1007/bfb0055811openalex-snapshot
Speeding-up nondeterministic single-tape off-line computations by one alternation
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/s002360200092openalex-snapshot
A quadratic speedup theorem for iterative arrays
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/0020-0190(88)90179-2openalex-snapshot
Alternating real-time computations
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)90048-9openalex-snapshot
Alternating simple multihead finite automata
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90080-5openalex-snapshot
Alternating on-line turing machines with only universal states and small space bounds
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(87)90138-1openalex-snapshot
On reversal bounded alternating Turing machines
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90025-xopenalex-snapshot
A leaf-size hierarchy of two-dimensional alternating turing machines
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90054-6openalex-snapshot
An NP-complete language accepted in linear time by a one-tape Turing machine
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90378-fopenalex-snapshot
A note on real-time one-way alternating multicounter machines
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)90105-8openalex-snapshot
On 1-inkdot alternating Turing machines with small space
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50027-7openalex-snapshot
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.031openalex-snapshot
Theory of one-tape linear-time Turing machines
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)90572-1openalex-snapshot
Two-dimensional alternating turing machines with only universal states
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80043-6openalex-snapshot
Complexity of the first-order theory of almost all finite structures
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.1016/s0049-237x(08)70471-3openalex-snapshot
Bounded Arithmetic Formulas and Turing Machines of Constant Alternation
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70690-1openalex-snapshot
Are Recursion Theoretic Arguments Useful in Complexity Theory?
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00333-3openalex-snapshot
Lower bounds for multiplayer noncooperative games of incomplete information
inferred← citeshttps://doi.org/10.1017/9781316135167.033openalex-snapshot
Combinatorial Games: Selected Bibliography With A Succinct Gourmet Introduction
inferred← citeshttps://doi.org/10.1080/00207169008803893openalex-snapshot
Constructions for alternating finite automata ∗
inferred← citeshttps://doi.org/10.1109/ccc.2000.856730openalex-snapshot
Time-space tradeoffs for nondeterministic computation
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/sct.1993.336520openalex-snapshot
Alternating time versus deterministic time: a separation
inferred← citeshttps://doi.org/10.1109/sfcs.1983.39openalex-snapshot
On determinism versus non-determinism and related problems
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63544openalex-snapshot
On reversal complexity for alternating Turing machines
inferred← citeshttps://doi.org/10.1137/0216016openalex-snapshot
Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape
inferred← citeshttps://doi.org/10.1137/0219014openalex-snapshot
Reversal Complexity Classes for Alternating Turing Machines
inferred← citeshttps://doi.org/10.1145/1101821.1101822openalex-snapshot
Time-space lower bounds for satisfiability
inferred← citeshttps://doi.org/10.1145/3465384openalex-snapshot
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces
inferred← citeshttps://doi.org/10.1145/800070.802175openalex-snapshot
Two-dimensional alternating Turing machines
inferred← citeshttps://doi.org/10.2307/421141openalex-snapshot
1998 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.4036/iis.2022.r.06openalex-snapshot
Computational Complexity of Puzzles and Related Topics
inferred← citeshttps://doi.org/10.4086/cjtcs.1999.007openalex-snapshot
The Permanent Requires Large Uniform Threshold Circuits.
inferred← citeshttps://doi.org/10.48550/arxiv.1309.7457openalex-snapshot
On the Tape-Number Problem for Deterministic Time Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1602.04781openalex-snapshot
On Alternation and the Union Theorem
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0310046openalex-snapshot
Theory of One Tape Linear Time 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.