On the public citation graph

Real-time recognition of the inclusion relation

https://doi.org/10.1007/bf01117471
0 signed · 18 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/978-1-4899-5327-8_24openalex-snapshot
A Definition of Recursive-Predicate Complexity Which does not Depend on the Standardization of the Concept of Algorithm

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119771579.ch3openalex-snapshot
Intrusion Detection Systems
inferred← citeshttps://doi.org/10.1007/11753728_15openalex-snapshot
Window Subsequence Problems for Compressed Texts
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_3openalex-snapshot
A Note on Monitors and Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13182-0_13openalex-snapshot
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
inferred← citeshttps://doi.org/10.1007/bf01075212openalex-snapshot
Complexity of common subsequence and supersequence problems and related problems
inferred← citeshttps://doi.org/10.1007/s00224-013-9522-8openalex-snapshot
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.02.008openalex-snapshot
Multiple serial episodes matching
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102417openalex-snapshot
Quadratic equations in the lamplighter group
inferred← citeshttps://doi.org/10.1016/s0168-0072(01)00051-3openalex-snapshot
Window-accumulated subsequence matching problem is linear
inferred← citeshttps://doi.org/10.1142/s0218196718500698openalex-snapshot
Low complexity algorithms in knot theory
inferred← citeshttps://doi.org/10.1145/322234.322244openalex-snapshot
String Matching in Real Time
inferred← citeshttps://doi.org/10.1515/gcc-2012-0020openalex-snapshot
Cyclic rewriting and conjugacy problems
inferred← citeshttps://doi.org/10.15407/pp2022.02.057openalex-snapshot
60 Years of Databases (part four)
inferred← citeshttps://doi.org/10.18419/opus-3538openalex-snapshot
On the complexity of conjugacy in amalgamated products and HNN extensions
inferred← citeshttps://doi.org/10.3390/quantum7020024openalex-snapshot
Theory and Applications of Quantum Hashing
inferred← citeshttps://doi.org/10.48550/arxiv.1507.01020openalex-snapshot
A Note on Monitors and Büchi automata
inferred← citeshttps://doi.org/10.48550/arxiv.1905.09761openalex-snapshot
An Efficient Approach for Super and Nested Term Indexing and Retrieval
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.