On the public citation graph
Detection of periodicities and string-matching in real time
0 signed · 45 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-08921-7_97openalex-snapshot
String-matching in real time: Some properties of the data structure
inferredcites →https://doi.org/10.1016/0022-0000(79)90045-xopenalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0174934-9openalex-snapshot
Uniqueness Theorems for Periodic Functions
inferredcites →https://doi.org/10.1109/sfcs.1977.27openalex-snapshot
Saving space in fast string-matching
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1137/0209051openalex-snapshot
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/800105.803393openalex-snapshot
Fast probabilistic algorithms for hamiltonian circuits and matchings
inferredcites →https://doi.org/10.1145/800113.803644openalex-snapshot
Real-time algorithms for string-matching and palindrome 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/jcom.1998.0495openalex-snapshot
On-line Construction of Two-Dimensional Suffix Trees
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_9openalex-snapshot
Building the minimal DFA for the set of all subwords of a word on-line in linear time
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_45openalex-snapshot
Longest common factor of two words
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_26openalex-snapshot
Parallel construction of a suffix tree
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_14openalex-snapshot
Finding Approximate Repetitions under Hamming Distance
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_31openalex-snapshot
On maximal repetitions in words
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_72openalex-snapshot
Constant-space string-matching
inferred← citeshttps://doi.org/10.1007/3-540-58094-8_13openalex-snapshot
Computation of squares in a string
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_17openalex-snapshot
On-line construction of two-dimensional suffix trees
inferred← citeshttps://doi.org/10.1007/978-1-4612-3352-7_3openalex-snapshot
Constant-Space String-Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_6openalex-snapshot
A Minimal Periods Algorithm with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-24583-1_16openalex-snapshot
Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-38905-4_1openalex-snapshot
Forty Years of Text Indexing
inferred← citeshttps://doi.org/10.1007/978-3-642-82456-2_1openalex-snapshot
Open Problems in Stringology
inferred← citeshttps://doi.org/10.1007/978-3-642-82456-2_6openalex-snapshot
The Myriad Virtues of Subword Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-82456-2_7openalex-snapshot
Efficient and Elegant Subword-Tree Construction
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90051-6openalex-snapshot
Detecting leftmost maximal periodicities
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90157-4openalex-snapshot
The smallest automation recognizing the subwords of a text
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferred← citeshttps://doi.org/10.1016/j.dam.2013.05.009openalex-snapshot
New simple efficient algorithms computing powers and runs in strings
inferred← citeshttps://doi.org/10.1016/j.jda.2012.07.003openalex-snapshot
Near real-time suffix tree construction via the fringe marked ancestor problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.05.032openalex-snapshot
A fast algorithm for finding the positions of all squares in a run-length encoded string
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00448-6openalex-snapshot
Finding approximate repetitions under Hamming distance
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814634openalex-snapshot
Finding maximal repetitions in a word in linear time
inferred← citeshttps://doi.org/10.1109/spire.2000.878192openalex-snapshot
Finding repeats with fixed gap
inferred← citeshttps://doi.org/10.1137/0222058openalex-snapshot
Suffix Arrays: A New Method for On-Line String Searches
inferred← citeshttps://doi.org/10.1145/28869.28873openalex-snapshot
Complete inverted files for efficient text retrieval and analysis
inferred← citeshttps://doi.org/10.1145/800057.808700openalex-snapshot
Building a complete inverted file for a set of text files in linear time
inferred← citeshttps://doi.org/10.48550/arxiv.2108.10865openalex-snapshot
On Specialization of a Program Model of Naive Pattern Matching in Strings (Extended Abstract)
inferred← citeshttps://doi.org/10.5555/320176.320218openalex-snapshot
Suffix arrays: a new method for on-line string searches
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.