On the public citation graph
Saving Space in Fast String-Matching
0 signed · 40 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/bf01694010openalex-snapshot
Real-time solutions of the origin-crossing problem
inferredcites →https://doi.org/10.1007/bf01694011openalex-snapshot
Counter machines and counter languages
inferredcites →https://doi.org/10.1007/bf01768472openalex-snapshot
Real-time recognition of substring repetition and reversal
inferredcites →https://doi.org/10.1016/0022-0000(78)90042-9openalex-snapshot
Palindrome recognition in real time by a multitape turing machine
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1145/322234.322246openalex-snapshot
New Real-Time Simulations of Multihead Tape Units
inferredcites →https://doi.org/10.1145/360933.360975openalex-snapshot
Guarded commands, nondeterminacy and formal derivation of programs
inferredcites →https://doi.org/10.1307/mmj/1028998766openalex-snapshot
The equation $a^M=b^Nc^P$ in a free group.
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.1995.1105openalex-snapshot
Algorithms for Detecting Morphic Images of a Word
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_50openalex-snapshot
New algorithms for detecting morphic images of a word
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_44openalex-snapshot
Saving comparisons in the Crochemore-Perrin string matching algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_10openalex-snapshot
Parallel string matching algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_12openalex-snapshot
Periodic Prefixes in Texts
inferred← citeshttps://doi.org/10.1007/978-3-031-43980-3_22openalex-snapshot
Efficient Parameterized Pattern Matching in Sublinear Space
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_16openalex-snapshot
Simple Real-Time Constant-Space String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-82456-2_19openalex-snapshot
Discovering Repetitions in Strings
inferred← citeshttps://doi.org/10.1007/bf01190846openalex-snapshot
Squares, cubes, and time-space efficient string searching
inferred← citeshttps://doi.org/10.1007/bf01213080openalex-snapshot
Detecting morphic images of a word On the rank of a pattern
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90002-8openalex-snapshot
Time-space-optimal string matching
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90031-8openalex-snapshot
The complexity of Dehn's algorithm for word problems in groups
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00068-2openalex-snapshot
Saving comparisons in the Crochemore-Perrin string-matching algorithm
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90046-5openalex-snapshot
Correctness and efficiency of pattern matching algorithms
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.tcs.2012.11.040openalex-snapshot
Simple real-time constant-space string matching
inferred← citeshttps://doi.org/10.1016/s0304-3975(81)80006-0openalex-snapshot
Linear-time string-matching using only a fixed number of local storage locations
inferred← citeshttps://doi.org/10.1051/ita/1997310100011openalex-snapshot
Detecting the morphic images of a word : improving the general algorithm
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267791openalex-snapshot
Tighter bounds on the exact complexity of string matching
inferred← citeshttps://doi.org/10.1137/0221050openalex-snapshot
A Lower Bound for Parallel String Matching
inferred← citeshttps://doi.org/10.1137/s009753979324694xopenalex-snapshot
Tighter Upper Bounds on the Exact Complexity of String Matching
inferred← citeshttps://doi.org/10.1145/103418.103465openalex-snapshot
A lower bound for parallel string matching
inferred← citeshttps://doi.org/10.1145/322234.322246openalex-snapshot
New Real-Time Simulations of Multihead Tape Units
inferred← citeshttps://doi.org/10.1145/800076.802463openalex-snapshot
Time-space-optimal string matching (Preliminary Report)
inferred← citeshttps://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching algorithms
inferred← citeshttps://doi.org/10.36045/bbms/1103408549openalex-snapshot
Equations in words: an algorithmic contribution
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.