On the public citation graph
The complexity of ranking simple languages
0 signed · 52 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-08138-0_11openalex-snapshot
On one-way Auxiliary pushdown automata
inferredcites →https://doi.org/10.1007/bfb0039604openalex-snapshot
Computing the counting function of context-free languages
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/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
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.1090/psapm/019/0235938openalex-snapshot
Context-free languages and Turing machine computations
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1137/0209029openalex-snapshot
Path Systems: Constructions, Solutions and Applications
inferredcites →https://doi.org/10.1137/0213027openalex-snapshot
Simulation of Parallel Random Access Machines by Circuits
inferredcites →https://doi.org/10.1145/28395.28409openalex-snapshot
The Boolean formula value problem is in ALOGTIME
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/800061.808733openalex-snapshot
Borel sets and circuit complexity
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1145/800161.805151openalex-snapshot
Path systems and language recognition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2000.2914openalex-snapshot
How Hard Is Computing the Edit Distance?
inferred← citeshttps://doi.org/10.1006/inco.2000.3023openalex-snapshot
Computing a Context-Free Grammar-Generating Series
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_70openalex-snapshot
On the structure and complexity of infinite sets with minimal perfect hash functions
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_16openalex-snapshot
Rational transductions and complexity of counting problems
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-58338-6_71openalex-snapshot
On languages accepted with simultaneous complexity bounds and their ranking problem
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_70openalex-snapshot
How hard is to compute the edit distance
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_13openalex-snapshot
Closure and Nonclosure Properties of the Compressible and Rankable Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_13openalex-snapshot
The Complexity of Finding Top-Toda-Equivalence-Class Members
inferred← citeshttps://doi.org/10.1007/978-3-642-77735-6_2openalex-snapshot
Applications of Time-Bounded Kolmogorov Complexity in Complexity Theory
inferred← citeshttps://doi.org/10.1007/bf01185866openalex-snapshot
Rational transductions and complexity of counting problems
inferred← citeshttps://doi.org/10.1007/bf01275489openalex-snapshot
The complexity of computing maximal word functions
inferred← citeshttps://doi.org/10.1007/s00224-005-1211-9openalex-snapshot
The Complexity of Finding Top-Toda-Equivalence-Class Members
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90038-jopenalex-snapshot
The effective entropies of some extensions of context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90388-iopenalex-snapshot
On sets polynomially enumerable by iteration
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.10.003openalex-snapshot
Recursion-theoretic ranking and compression
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.004openalex-snapshot
Closure and nonclosure properties of the classes of compressible and rankable sets
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00227-2openalex-snapshot
Non-commutative arithmetic circuits: depth reduction and size lower bounds
inferred← citeshttps://doi.org/10.1051/ita/1993270201351openalex-snapshot
On ranking 1-way finitely ambiguous NL languages and $\# P_1$-complete census functions
inferred← citeshttps://doi.org/10.1080/00207169808804677openalex-snapshot
Ranking and unranking left szilard languages
inferred← citeshttps://doi.org/10.1109/sct.1990.113964openalex-snapshot
A very hard log space counting class
inferred← citeshttps://doi.org/10.1109/sct.1991.160269openalex-snapshot
Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits
inferred← citeshttps://doi.org/10.21236/ada300061openalex-snapshot
Polynomial-Time Semi-Rankable Sets.
inferred← citeshttps://doi.org/10.48550/arxiv.1012.3000openalex-snapshot
Random Generation and Approximate Counting of Combinatorial Structures
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05032openalex-snapshot
Enumerating all the Irreducible Polynomials over Finite Field
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01696openalex-snapshot
Closure and Nonclosure Properties of the Compressible and Rankable Sets
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.