On the public citation graph

?-productions in context-free grammars

https://doi.org/10.1007/bf00289308
0 signed · 24 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/bf00263744openalex-snapshot
Hierarchies of complete problems
inferredcites →https://doi.org/10.1016/0020-0190(79)90152-2openalex-snapshot
Linear programming is log-space hard for P
inferredcites →https://doi.org/10.1016/0020-0190(80)90117-9openalex-snapshot
A space efficient algorithm for the monotone planar circuit value problem
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/s0022-0000(74)80046-2openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1109/focs.1965.14openalex-snapshot
Memory bounds for recognition of context-free and context-sensitive languages
inferredcites →https://doi.org/10.1145/1008354.1008356openalex-snapshot
The monotone and planar circuit value problems are log space complete for P
inferredcites →https://doi.org/10.1145/800133.804336openalex-snapshot
A unified approach to models of synchronous parallel machines
inferredcites →https://doi.org/10.1145/990518.990519openalex-snapshot
The circuit value problem is log space complete for P
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata

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-57785-8_174openalex-snapshot
The variable membership problem: Succinctness versus complexity
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_20openalex-snapshot
Parallel complexity in the design and analysis of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_13openalex-snapshot
Unary Pushdown Automata and Straight-Line Programs
inferred← citeshttps://doi.org/10.1007/bf01275489openalex-snapshot
The complexity of computing maximal word functions
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90224-6openalex-snapshot
The parallel complexity of two problems on concurrency
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferred← citeshttps://doi.org/10.1093/logcom/11.6.933openalex-snapshot
The Complexity of Regularity in Grammar Logics and Related Modal Logics
inferred← citeshttps://doi.org/10.1109/12.24282openalex-snapshot
A note on nondeterminism in small, fast parallel computers
inferred← citeshttps://doi.org/10.1137/s0097539704445950openalex-snapshot
Word Problems and Membership Problems on Compressed Words
inferred← citeshttps://doi.org/10.1145/8312.8317openalex-snapshot
Parallel speedup of sequential machines: a defense of parallel computation thesis
inferred← citeshttps://doi.org/10.1515/gcc-2012-0016openalex-snapshot
Algorithmics on SLP-compressed strings: A survey
inferred← citeshttps://doi.org/10.48550/arxiv.1403.0509openalex-snapshot
Unary Pushdown Automata and Straight-Line Programs
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness 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.