On the public citation graph

Regular Expression Matching using Bit Vector Automata

https://doi.org/10.1145/3586044
0 signed · 57 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.
Claim with ORCID
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.
See reference health

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/978-3-030-17462-0_24openalex-snapshot
Symbolic Regex Matcher
inferredcites →https://doi.org/10.1007/978-3-030-34175-6_24openalex-snapshot
Succinct Determinisation of Counting Automata via Sphere Construction
inferredcites →https://doi.org/10.1007/978-3-030-60508-7_21openalex-snapshot
A Verified Online Monitor for Metric Temporal Logic with Quantitative Semantics
inferredcites →https://doi.org/10.1007/978-3-030-72016-2_18openalex-snapshot
Algebraic Quantitative Semantics for Efficient Online Temporal Monitoring
inferredcites →https://doi.org/10.1007/978-3-030-88494-9_8openalex-snapshot
A Compositional Framework for Quantitative Online Monitoring over Continuous-Time Signals
inferredcites →https://doi.org/10.1007/978-3-319-75632-5_5openalex-snapshot
Specification-Based Monitoring of Cyber-Physical Systems: A Survey on Theory, Tools and Applications
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_5openalex-snapshot
Rule-Based Runtime Verification
inferredcites →https://doi.org/10.1007/978-3-642-03466-4_15openalex-snapshot
Regular Expressions with Numerical Constraints and Automata with Counters
inferredcites →https://doi.org/10.1007/978-3-642-03816-7_32openalex-snapshot
Regular Expressions with Counting: Weak versus Strong Determinism
inferredcites →https://doi.org/10.1016/0304-3975(95)00182-4openalex-snapshot
Partial derivatives of regular expressions and finite automaton constructions
inferredcites →https://doi.org/10.1070/rm1961v016n05abeh004112openalex-snapshot
THE ABSTRACT THEORY OF AUTOMATA
inferredcites →https://doi.org/10.1093/nar/gkp885openalex-snapshot
PROSITE, a protein domain database for functional characterization and annotation
inferredcites →https://doi.org/10.1109/fpt.2006.270302openalex-snapshot
Regular expression matching for reconfigurable packet inspection
inferredcites →https://doi.org/10.1109/hpca.2018.00068openalex-snapshot
Searching for Potential gRNA Off-Target Sites for CRISPR/Cas9 Using Automata Processing Across Different Platforms
inferredcites →https://doi.org/10.1109/isca.2006.7openalex-snapshot
A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching
inferredcites →https://doi.org/10.1109/sp.2008.14openalex-snapshot
XFA: Faster Signature Matching with Extended Automata
inferredcites →https://doi.org/10.1109/swat.1971.11openalex-snapshot
Economy of description by automata, grammars, and formal systems
inferredcites →https://doi.org/10.1109/swat.1972.29openalex-snapshot
The equivalence problem for regular expressions with squaring requires exponential space
inferredcites →https://doi.org/10.1109/tcad.2020.3013053openalex-snapshot
Online Signal Monitoring With Bounded Lag
inferredcites →https://doi.org/10.1109/tcbb.2015.2430313openalex-snapshot
Discovering Motifs in Biological Sequences Using the Micron Automata Processor
inferredcites →https://doi.org/10.1109/tpds.2014.8openalex-snapshot
An Efficient and Scalable Semiconductor Architecture for Parallel Automata Processing
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/1185347.1185360openalex-snapshot
Fast and memory-efficient regular expression matching for deep packet inspection
inferredcites →https://doi.org/10.1145/135239.135243openalex-snapshot
A new approach to text searching
inferredcites →https://doi.org/10.1145/1544012.1544037openalex-snapshot
Extending finite automata to efficiently match Perl-compatible regular expressions
inferredcites →https://doi.org/10.1145/321239.321249openalex-snapshot
Derivatives of Regular Expressions
inferredcites →https://doi.org/10.1145/3338906.3342509openalex-snapshot
Rethinking Regex engines to address ReDoS
inferredcites →https://doi.org/10.1145/3428286openalex-snapshot
Regex matching with counting-set automata
inferredcites →https://doi.org/10.1145/3519939.3523456openalex-snapshot
Software-hardware codesign for efficient in-memory regular pattern matching
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/360825.360855openalex-snapshot
Efficient string matching
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1147/rd.312.0249openalex-snapshot
Efficient randomized pattern-matching 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/978-3-031-47963-2_14openalex-snapshot
Algorithms for Checking Intersection Non-emptiness of Regular Expressions
inferred← citeshttps://doi.org/10.1007/978-3-031-74234-7_8openalex-snapshot
Efficient Offline Monitoring for Dynamic Metric Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-981-99-8664-4_1openalex-snapshot
String Constraints with Regex-Counting and String-Length Solved More Efficiently
inferred← citeshttps://doi.org/10.1016/j.sysarc.2025.103340openalex-snapshot
An efficient string solver for string constraints with regex-counting and string-length
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115249openalex-snapshot
Incremental algorithms for solving regular expression intersection non-emptiness
inferred← citeshttps://doi.org/10.1109/access.2026.3725911openalex-snapshot
ZDPI: Zero-Copy Deep Packet Inspection via Compressed Finite State Automata in eBPF/XDP With BPF Arena
inferred← citeshttps://doi.org/10.1109/cgo57630.2024.10444810openalex-snapshot
One Automaton to Rule Them All: Beyond Multiple Regular Expressions Execution
inferred← citeshttps://doi.org/10.1109/pact65351.2025.00023openalex-snapshot
ANG: Accelerating NFA processing on GPUs via Exploring Multi-Level Fine-Grained Parallelism
inferred← citeshttps://doi.org/10.1145/3620665.3640412openalex-snapshot
BVAP: Energy and Memory Efficient Automata Processing for Regular Expressions with Bounded Repetitions
inferred← citeshttps://doi.org/10.1145/3632934openalex-snapshot
Efficient Matching of Regular Expressions with Lookaround Assertions
inferred← citeshttps://doi.org/10.1145/3656431openalex-snapshot
Linear Matching of JavaScript Regular Expressions
inferred← citeshttps://doi.org/10.1145/3656461openalex-snapshot
Static Analysis for Checking the Disambiguation Robustness of Regular Expressions
inferred← citeshttps://doi.org/10.1145/3689771openalex-snapshot
HybridSA: GPU Acceleration of Multi-pattern Regex Matching using Bit Parallelism
inferred← citeshttps://doi.org/10.1145/3695053.3731106openalex-snapshot
RAP: Reconfigurable Automata Processor
inferred← citeshttps://doi.org/10.1145/3703595.3705884openalex-snapshot
Verified and Efficient Matching of Regular Expressions with Lookaround
inferred← citeshttps://doi.org/10.1145/3704837openalex-snapshot
RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement, and Restricted Lookarounds
inferred← citeshttps://doi.org/10.1145/3720498openalex-snapshot
Efficient Algorithms for the Uniform Tokenization Problem
inferred← citeshttps://doi.org/10.1145/3725843.3756052openalex-snapshot
Interleaved Bitstream Execution for Multi-Pattern Regex Matching on GPUs
inferred← citeshttps://doi.org/10.1145/3729300openalex-snapshot
Membership Testing for Semantic Regular Expressions
inferred← citeshttps://doi.org/10.1145/3779212.3790227openalex-snapshot
Static Analysis for Efficient Streaming Tokenization
inferred← citeshttps://doi.org/10.14778/3778092.3778109openalex-snapshot
Streaming Validation of JSON Documents against Schemas
inferred← citeshttps://doi.org/10.3390/electronics13091635openalex-snapshot
Enhancing Regular Expression Processing through Field-Programmable Gate Array-Based Multi-Character Non-Deterministic Finite Automata
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.