共 68 条
- [1] Aho AV(1975)Efficient string matching: an aid to bibliographic search Commun ACM 18 333-340
- [2] Corasick MJ(2015)Design and optimizations for efficient regular expression matching in DPI systems Comput Commun 61 103-120
- [3] Antonello R(1977)A fast string searching algorithm Commun ACM 20 762-772
- [4] Fernandes S(2015)A memory efficient DFA using compression and pattern segmentation Procedia Comput Sci 56 292-299
- [5] Sadok D(2008)An improved DFA for fast regular expression matching ACM SIGCOMM Comput Commun Rev 38 29-40
- [6] Kelner J(2011)Differential encoding of DFAs for fast regular expression matching IEEE/ACM Trans Netw 19 683-694
- [7] Szabó G(2014)Towards fast and optimal grouping of regular expressions via DFA size estimation IEEE J Sel Areas Commun 32 1797-1809
- [8] Boyer RS(2015)Speculative parallel pattern matching using stride-k DFA for deep packet inspection J Netw Comput Appl 54 78-87
- [9] Moore JS(2006)Fast string matching by using probabilities: on an optimal mismatch variant of Horspool’s algorithm Theor Comput Sci 359 329-343
- [10] Chang YK(2014)Bypassing space explosion in high-speed regular expression matching IEEE/ACM Trans Netw 22 1701-1714