Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
The C programming language
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Extended path expressions of XML
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
NR-grep: a fast and flexible pattern-matching tool
Software—Practice & Experience
Indexing and Querying XML Data for Regular Path Expressions
Proceedings of the 27th International Conference on Very Large Data Bases
Fast and memory-efficient regular expression matching for deep packet inspection
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Fast and compact regular expression matching
Theoretical Computer Science
Faster Regular Expression Matching
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Faster Regular Expression Matching
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Regular expression matching with multi-strings and intervals
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fast bit-parallel matching for network and regular expressions
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
String matching with variable length gaps
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Fast searching in packed strings
Journal of Discrete Algorithms
Bit-coded regular expression parsing
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Approximate regular expression matching with multi-strings
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Simplifying regular expressions: a quantitative perspective
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Deterministic regular expressions in linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
String matching with variable length gaps
Theoretical Computer Science
Approximate regular expression matching with multi-strings
Journal of Discrete Algorithms
| Hi-index | 0.00 |
Regular expression matching is a key task (and often the computational bottleneck) in a variety of widely used software tools and applications, for instance, the unix grep and sed commands, scripting languages such as awk and perl , programs for analyzing massive data streams, etc. We show how to solve this ubiquitous task in linear space and O (nm (loglogn )/(logn )3/2 + n + m ) time where m is the length of the expression and n the length of the string. This is the first improvement for the dominant O (nm /logn ) term in Myers' O (nm /logn + (n + m )logn ) bound [JACM 1992]. We also get improved bounds for external memory.