On the public citation graph
Characterizing unambiguous augmented pushdown automata by circuits
0 signed · 26 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-16761-7_59openalex-snapshot
Parallel RAMs with owned global memory and deterministic context-free language recognition
inferredcites →https://doi.org/10.1016/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
inferredcites →https://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferredcites →https://doi.org/10.1016/0890-5401(87)90041-1openalex-snapshot
Parallel time O(log n) recognition of unambiguous context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1137/0213027openalex-snapshot
Simulation of Parallel Random Access Machines by Circuits
inferredcites →https://doi.org/10.1145/28395.28411openalex-snapshot
Properties that characterize LOGCFL
inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
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-54458-5_61openalex-snapshot
Unambiguity and fewness for logarithmic space
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_77openalex-snapshot
Uniform circuits and exclusive read PRAMs
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_3openalex-snapshot
Parallel recognition and ranking of context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_47openalex-snapshot
Extended locally definable acceptance types
inferred← citeshttps://doi.org/10.1007/bf01374526openalex-snapshot
Structure and importance of logspace-MOD class
inferred← citeshttps://doi.org/10.1007/bfb0020812openalex-snapshot
Structure and importance of logspace-MOD-classes
inferred← citeshttps://doi.org/10.1007/bfb0023843openalex-snapshot
Unambiguous simulations of auxiliary pushdown automata and circuits
inferred← citeshttps://doi.org/10.1007/bfb0029607openalex-snapshot
Using inductive counting to simulate nondeterministic computation
inferred← citeshttps://doi.org/10.1007/s00236-022-00425-1openalex-snapshot
Depth-first search in directed planar graphs, revisited
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90212-eopenalex-snapshot
Observations on log (n) time parallel recognition of unambiguous cfl's
inferred← citeshttps://doi.org/10.1109/sct.1993.336523openalex-snapshot
Complexity and structure in formal language theory
inferred← citeshttps://doi.org/10.1109/sct.1994.315812openalex-snapshot
Unambiguous polynomial hierarchies and exponential size
inferred← citeshttps://doi.org/10.3233/fi-1996-253408openalex-snapshot
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY
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.