Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

97

CCR
2008

131views more CCR 2008»

An improved DFA for fast regular expression matching

15 years 2 months ago

An improved DFA for fast regular expression matching

Download www.nchovy.kr

Domenico Ficara, Stefano Giordano, Gregorio Procis

Real-time Traffic

CCR 2008 |

claim paper

Related Content

» Curing regular expressions matching algorithms from insomnia amnesia and acalculia

» Reorganized and Compact DFA for Efficient Regular Expression Matching

» Algorithms to accelerate multiple regular expressions matching for deep packet inspection

» Advanced algorithms for fast and scalable deep packet inspection

» A Regular Expression Matching Circuit Based on a Decomposed Automaton

» Compact DFA Representation for Fast Regular Expression Search

» An improved algorithm to accelerate regular expression evaluation

» Spacetime tradeoff in regular expression matching with semideterministic finite automata

» CacheBased Scalable Deep Packet Inspection with Predictive Automaton

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	CCR
Authors	Domenico Ficara, Stefano Giordano, Gregorio Procissi, Fabio Vitucci, Gianni Antichi, Andrea Di Pietro

Comments (0)