On the public citation graph

Time optimal left to right construction of position trees

https://doi.org/10.1007/bf00292114
0 signed · 17 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.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0209061openalex-snapshot
Efficient On-Line Construction and Correction of Position Trees
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1996.0814openalex-snapshot
Dynamic Text Indexing under String Updates
inferred← citeshttps://doi.org/10.1007/3-540-60044-2_48openalex-snapshot
Genome analysis: Pattern search in biological macromolecules
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_1openalex-snapshot
Forty Years of Text Indexing
inferred← citeshttps://doi.org/10.1007/bf01206331openalex-snapshot
On-line construction of suffix trees
inferred← citeshttps://doi.org/10.1007/bf01769703openalex-snapshot
Approximate string matching with suffix automata
inferred← citeshttps://doi.org/10.1007/bfb0049434openalex-snapshot
Incremental text editing: a new data structure
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00003-8openalex-snapshot
A comparison of imperative and purely functional suffix tree constructions
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492590openalex-snapshot
Optimal on-line search and sublinear time update in string matching
inferred← citeshttps://doi.org/10.1137/s0097539795286119openalex-snapshot
Optimal On-Line Search and Sublinear Time Update in String Matching
inferred← citeshttps://doi.org/10.1145/63334.63341openalex-snapshot
Data compression with finite windows
inferred← citeshttps://doi.org/10.1145/74697.74700openalex-snapshot
Algorithms for string searching
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02224openalex-snapshot
Space-efficient K-MER algorithm for generalized suffix tree
inferred← citeshttps://doi.org/10.5121/ijitcs.2017.7101openalex-snapshot
Space Efficient K-MER Algorithm for Generalised Suffix Tree
inferred← citeshttps://doi.org/10.5353/th_b3105973openalex-snapshot
On the construction and application of compressed text indexes
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.