On the public citation graph
A run-time efficient realization of Aho-Corasick pattern matching machines
0 signed · 22 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.1002/spe.4380120106openalex-snapshot
A comparison of three string matching algorithms
inferredcites →https://doi.org/10.1007/bf00288683openalex-snapshot
Organization and maintenance of large ordered indexes
inferredcites →https://doi.org/10.1007/bf00289509openalex-snapshot
Symmetric binary B-Trees: Data structure and maintenance algorithms
inferredcites →https://doi.org/10.1137/0209037openalex-snapshot
A Correct Preprocessing Algorithm for Boyer–Moore String-Searching
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/359810.359839openalex-snapshot
Pagination of B*-trees with variable-length records
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.5109/13149openalex-snapshot
ONE-WAY SEQUENTIAL SEARCH SYSTEMS AND THEIR POWERS
inferredcites →https://doi.org/10.5109/13339openalex-snapshot
SIGMA - AN INFORMATION SYSTEM FOR RESEARCHERS USE
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/spe.785openalex-snapshot
Efficient implementation of Aho–Corasick pattern matching automata using Unicode
inferred← citeshttps://doi.org/10.1007/3-540-45735-6_16openalex-snapshot
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts
inferred← citeshttps://doi.org/10.1007/3-540-49292-5_10openalex-snapshot
Toward Genomic Hypothesis Creator: View Designer for Discovery
inferred← citeshttps://doi.org/10.1007/978-3-319-11119-3_19openalex-snapshot
The Improved AC High-Performance Pattern-Matching Algorithm for Intrusion Detection
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_5openalex-snapshot
Context-Sensitive Grammar Transform: Compression and Pattern Matching
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1313-2.50027-5openalex-snapshot
SPECIAL HARDWARE FOR THE SUPPORT OF FILE MANAGEMENT AND QUERY FUNCTIONS
inferred← citeshttps://doi.org/10.1109/spire.2001.989753openalex-snapshot
Speed-up of Aho-Corasick pattern matching machines by rearranging states
inferred← citeshttps://doi.org/10.1147/rd.301.0102openalex-snapshot
An experimental computer architecture supporting expert systems and logic programming
inferred← citeshttps://doi.org/10.11606/d.55.2019.tde-31102019-181538openalex-snapshot
ALGORITMOS DE BUSCA EM TEXTO
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.219openalex-snapshot
Context-Sensitive Grammar Transform: Compression and Pattern Matching
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.