On the public citation graph
A Partition-Based Efficient Algorithm for Large Scale Multiple-Strings Matching
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.1007/3-540-09510-1_10openalex-snapshot
A string matching algorithm fast on the average
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-48194-x_5openalex-snapshot
Efficient Experimental String Matching by Weak Factor Recognition*
inferredcites →https://doi.org/10.1007/bf01185427openalex-snapshot
Speeding up two string-matching algorithms
inferredcites →https://doi.org/10.1016/j.tcs.2004.03.058openalex-snapshot
Average complexity of exact and approximate multiple string matching
inferredcites →https://doi.org/10.1145/28869.28873openalex-snapshot
Complete inverted files for efficient text retrieval and analysis
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11390-011-0185-0openalex-snapshot
Revisiting Multiple Pattern Matching Algorithms for Multi-Core Architecture
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.022openalex-snapshot
An aggressive algorithm for multiple string matching
inferred← citeshttps://doi.org/10.1109/bdcloud.2018.00113openalex-snapshot
Tearing Down the Face of Algorithmic Complexity Attacks for DPI Engines
inferred← citeshttps://doi.org/10.1109/iceee.2010.5660608openalex-snapshot
Analysis of the Affection of Hash Function on the Performance of WM Algorithm
inferred← citeshttps://doi.org/10.1109/icicse.2009.37openalex-snapshot
A Memory-Efficient Multi-pattern Matching Algorithm Based on the Bitmap
inferred← citeshttps://doi.org/10.1145/1187436.1187438openalex-snapshot
Multipattern string matching with q -grams
inferred← citeshttps://doi.org/10.1145/2513148openalex-snapshot
Exact online two-dimensional pattern matching using multiple pattern matching algorithms
inferred← citeshttps://doi.org/10.1155/2018/9809345openalex-snapshot
An Efficient Security System for Mobile Data Monitoring
inferred← citeshttps://doi.org/10.12681/eadd/29868openalex-snapshot
Parallel and distributed implementations of multiple and two-dimensional pattern matching algorithms
inferred← citeshttps://doi.org/10.12694/scpe.v16i2.1085openalex-snapshot
Multiple String Matching on a GPU using CUDAs
inferred← citeshttps://doi.org/10.14257/ijsia.2016.10.4.25openalex-snapshot
A Parallel Algorithm of Multiple String Matching Based on Set-Partition in Multi-core Architecture
inferred← citeshttps://doi.org/10.3390/s141224188openalex-snapshot
A Malicious Pattern Detection Engine for Embedded Security Systems in the Internet of Things
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.