On the public citation graph
On Boyer-Moore automata
0 signed · 25 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.1002/spe.4380100608openalex-snapshot
Practical fast searching in strings
inferredcites →https://doi.org/10.1007/3-540-51542-9_9openalex-snapshot
String searching algorithms revisited
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_1openalex-snapshot
Open Problems in Stringology
inferredcites →https://doi.org/10.1016/0304-3975(92)90133-zopenalex-snapshot
Average running time of the Boyer-Moore-Horspool algorithm
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferredcites →https://doi.org/10.1137/0206048openalex-snapshot
On the Worst-Case Behavior of String-Searching Algorithms
inferredcites →https://doi.org/10.1137/0208029openalex-snapshot
The Complexity of Pattern Matching for a Random String
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.1137/0215007openalex-snapshot
The Boyer–Moore–Galil String Searching Strategies Revisited
inferredcites →https://doi.org/10.1145/359146.359148openalex-snapshot
On improving the worst case running time of the Boyer-Moore string matching algorithm
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.5555/320176.320219openalex-snapshot
Analysis of Boyer-Moore-type string searching algorithms
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-36377-7_15openalex-snapshot
The Abstraction and Instantiation of String-Matching Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_9openalex-snapshot
Automata for Matching Patterns
inferred← citeshttps://doi.org/10.1007/bfb0030779openalex-snapshot
A dictionary matching algorithm fast on the average for terms of varying length
inferred← citeshttps://doi.org/10.1007/bfb0037393openalex-snapshot
A unified view to string matching algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.024openalex-snapshot
On the size of Boyer–Moore automata
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.004openalex-snapshot
Extended string matching
inferred← citeshttps://doi.org/10.1109/csci.2016.0244openalex-snapshot
Fast Regular Expression Matching in a Large Static Text
inferred← citeshttps://doi.org/10.1109/iccsnt.2013.6967187openalex-snapshot
Improvement on Wu-manber multi-pattern matching algorithm
inferred← citeshttps://doi.org/10.1145/773184.773190openalex-snapshot
Development reuse and the logic program derivation of two string-matching algorithms
inferred← citeshttps://doi.org/10.3115/993268.993378openalex-snapshot
Chinese string searching using the KMP algorithm
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1825openalex-snapshot
Reverse Engineering Prefix Tables
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.