On the public citation graph
An efficient implementation of static string pattern matching machines
0 signed · 41 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.1080/00207168208803329openalex-snapshot
A practical method for reducing sparse matrices with invariant entries
inferredcites →https://doi.org/10.1109/tse.1983.236167openalex-snapshot
A Practical Method for Reducing Weak Precedence Parsers
inferredcites →https://doi.org/10.1109/tse.1984.5010205openalex-snapshot
A Method for Improving String Pattern Matching Machines
inferredcites →https://doi.org/10.1145/357094.357097openalex-snapshot
Automatic Derivation of Code Generators from Machine Descriptions
inferredcites →https://doi.org/10.1145/357094.357098openalex-snapshot
The Design and Application of a Retargetable Peephole Optimizer
inferredcites →https://doi.org/10.1145/357153.357155openalex-snapshot
Using Peephole Optimization on Intermediate Code
inferredcites →https://doi.org/10.1145/358808.358813openalex-snapshot
Minimal perfect hash functions made simple
inferredcites →https://doi.org/10.17226/9512openalex-snapshot
Japanese to English Machine Translation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(199703)28:3<43::aid-scj5>3.0.co;2-qopenalex-snapshot
An efficient method for storing and retrieving graph structures
inferred← citeshttps://doi.org/10.1002/scj.4690200710openalex-snapshot
A fast digital search algorithm using a double‐array structure
inferred← citeshttps://doi.org/10.1002/sec.1115openalex-snapshot
An efficient parallel algorithm for exact multi‐pattern matching
inferred← citeshttps://doi.org/10.1002/spe.4380220902openalex-snapshot
An efficient implementation of trie structures
inferred← citeshttps://doi.org/10.1007/11554028_85openalex-snapshot
A New Technique of Determining Speaker’s Intention for Sentences in Conversation
inferred← citeshttps://doi.org/10.1007/978-3-540-30132-5_79openalex-snapshot
A Method of Extracting and Evaluating Popularity and Unpopularity for Natural Language Expressions
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/978-3-642-35795-4_72openalex-snapshot
Speeding Up Double-Array Trie Construction for String Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-41674-3_122openalex-snapshot
A Multi-pattern Matching Algorithm Based on Double Array Trie
inferred← citeshttps://doi.org/10.1007/978-981-10-8476-8_12openalex-snapshot
BWT: An Index Structure to Speed-Up Both Exact and Inexact String Matching
inferred← citeshttps://doi.org/10.1016/0020-0255(92)90113-mopenalex-snapshot
A practical method for implementing string pattern matching machines
inferred← citeshttps://doi.org/10.1016/0306-4379(90)90067-yopenalex-snapshot
Building efficient and flexible feature-based indices
inferred← citeshttps://doi.org/10.1016/0895-7177(92)90166-iopenalex-snapshot
A bibliography on computational molecular biology and genetics
inferred← citeshttps://doi.org/10.1016/s0306-4573(98)00012-0openalex-snapshot
A fast method of determining weighted compound keywords from text databases
inferred← citeshttps://doi.org/10.1080/00207160412331336071openalex-snapshot
A sentence classification technique using intention association expressions
inferred← citeshttps://doi.org/10.1080/00207169608804487openalex-snapshot
A fast retrieval technique for large graph structures
inferred← citeshttps://doi.org/10.1109/32.31365openalex-snapshot
An efficient digital search algorithm by using a double-array structure
inferred← citeshttps://doi.org/10.1109/cmpsac.1988.17222openalex-snapshot
An efficient digital search algorithm by using a double-array structure
inferred← citeshttps://doi.org/10.1109/icc.2014.6883393openalex-snapshot
A factor-searching-based multiple string matching algorithm for intrusion detection
inferred← citeshttps://doi.org/10.1109/icdar.1993.395677openalex-snapshot
Document image retrieval system using character candidates generated by character recognition process
inferred← citeshttps://doi.org/10.1109/icsi.1990.138686openalex-snapshot
Feature extraction based design retrieval
inferred← citeshttps://doi.org/10.1109/waim.2008.80openalex-snapshot
Accelerating Multiple String Matching by Using Cache-Efficient Strategy
inferred← citeshttps://doi.org/10.1142/s0219622005001477openalex-snapshot
A METHOD OF EXTRACTING AND EVALUATING GOOD AND BAD REPUTATIONS FOR NATURAL LANGUAGE EXPRESSIONS
inferred← citeshttps://doi.org/10.1145/595576.595579openalex-snapshot
Meaningful term extraction and discriminative term selection in text categorization via unknown-word methodology
inferred← citeshttps://doi.org/10.3115/1072133.1072196openalex-snapshot
Japanese text input system with digits
inferred← citeshttps://doi.org/10.4236/jcc.2016.44012openalex-snapshot
Prime Box Parallel Search Algorithm: Searching Dynamic Dictionary in O(lg m) Time
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.