On the public citation graph
On the Efficient Generation of Language Instances
0 signed · 28 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.1016/0020-0190(76)90097-1openalex-snapshot
Relative complexity of checking and evaluating
inferredcites →https://doi.org/10.1016/0022-0000(84)90068-0openalex-snapshot
The complexity of facets (and some facets of 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/0196-6774(84)90030-0openalex-snapshot
Generating random regular graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90061-xopenalex-snapshot
The polynomial-time hierarchy
inferredcites →https://doi.org/10.1016/0304-3975(86)90174-xopenalex-snapshot
Random generation of combinatorial structures from a uniform distribution
inferredcites →https://doi.org/10.1016/s0019-9958(74)90473-2openalex-snapshot
Tally languages and complexity classes
inferredcites →https://doi.org/10.1090/s0002-9904-1929-04793-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1137/0204018openalex-snapshot
Every Prime Has a Succinct Certificate
inferredcites →https://doi.org/10.1137/0204037openalex-snapshot
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
inferredcites →https://doi.org/10.1137/0215027openalex-snapshot
Optimal Approximations and Polynomially Levelable Sets
inferredcites →https://doi.org/10.1137/0217012openalex-snapshot
How to Generate Factored Random Numbers
inferredcites →https://doi.org/10.1137/0217018openalex-snapshot
Complexity Measures for Public-Key Cryptosystems
inferredcites →https://doi.org/10.1137/0217078openalex-snapshot
The Boolean Hierarchy I: Structural Properties
inferredcites →https://doi.org/10.1137/0218007openalex-snapshot
The Boolean Hierarchy II: Applications
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_60openalex-snapshot
The complexity of computing maximal word functions
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-59042-0_60openalex-snapshot
Communication complexity of key agreement on small ranges
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/bf01189853openalex-snapshot
On the effective generation of set elements within specified ranges
inferred← citeshttps://doi.org/10.1007/bf01275489openalex-snapshot
The complexity of computing maximal word functions
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90082-9openalex-snapshot
On the complexity of test case generation for NP-hard problems
inferred← citeshttps://doi.org/10.1109/sct.1989.41824openalex-snapshot
The generalized Kolmogorov complexity of sets
inferred← citeshttps://doi.org/10.1109/sct.1991.160257openalex-snapshot
The complexity of malign ensembles
inferred← citeshttps://doi.org/10.62056/a0iv4fe-3openalex-snapshot
Folding Schemes with Privacy Preserving Selective Verification
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.