On the public citation graph
Efficient implementation of Aho–Corasick pattern matching automata using Unicode
0 signed · 29 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/(sici)1097-024x(19980425)28:5<561::aid-spe170>3.0.co;2-wopenalex-snapshot
Experiments on string matching in memory structures
inferredcites →https://doi.org/10.1007/3-540-09510-1_10openalex-snapshot
A string matching algorithm fast on the average
inferredcites →https://doi.org/10.1007/978-3-031-26212-8_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/bf03037101openalex-snapshot
A run-time efficient realization of Aho-Corasick pattern matching machines
inferredcites →https://doi.org/10.1016/0020-0255(92)90113-mopenalex-snapshot
A practical method for implementing string pattern matching machines
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1017/cbo9780511574931openalex-snapshot
Algorithms on Strings, Trees and Sequences
inferredcites →https://doi.org/10.1017/cbo9781316135228openalex-snapshot
Flexible Pattern Matching in Strings
inferredcites →https://doi.org/10.1080/00401706.1994.10485810openalex-snapshot
How to Detect and Handle Outliers
inferredcites →https://doi.org/10.1109/sfcs.1988.21968openalex-snapshot
Dynamic Perfect Hashing: Upper and Lower Bounds
inferredcites →https://doi.org/10.1142/s0129054105003753openalex-snapshot
A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
inferredcites →https://doi.org/10.1145/358808.358813openalex-snapshot
Minimal perfect hash functions made simple
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
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.2314openalex-snapshot
Practically efficient array initialization
inferred← citeshttps://doi.org/10.1002/spe.3190openalex-snapshot
Engineering faster double‐array Aho–Corasick automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_12openalex-snapshot
A Table Compression Method for Extended Aho-Corasick Automaton
inferred← citeshttps://doi.org/10.1007/s11432-011-4363-zopenalex-snapshot
Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm
inferred← citeshttps://doi.org/10.1109/iccis.2012.13openalex-snapshot
A Dedicated Computer Architecture Framework for Large Scale Multi-string-matching Complete Automaton
inferred← citeshttps://doi.org/10.1109/icfcc.2010.5497448openalex-snapshot
A fast algorithm for multi-string matching based on automata optimization
inferred← citeshttps://doi.org/10.1109/icnidc.2009.5360944openalex-snapshot
Efficient multiple pattern matching algorithms for Network Intrusion Detection Systems
inferred← citeshttps://doi.org/10.1109/pci.2011.41openalex-snapshot
A Performance Evaluation of the Preprocessing Phase of Multiple Keyword Matching Algorithms
inferred← citeshttps://doi.org/10.18178/wcse.2017.06.012openalex-snapshot
The Optimization of Aho-Corasick Automaton with Large-scale Pattern Sets
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.