-
1
-
-
0016518897
-
Efficient string matching: An aid to bibliographic search
-
A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18(6): 333-340, 1975.
-
(1975)
Commun. ACM
, vol.18
, Issue.6
, pp. 333-340
-
-
Aho, A.V.1
Corasick, M.J.2
-
2
-
-
0004072686
-
-
Addison Wesley
-
A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, principles, techniques, and tools. Addison Wesley, 1985.
-
(1985)
Compilers, Principles, Techniques, and Tools.
-
-
Aho, A.V.1
Sethi, R.2
Ullman, J.D.3
-
4
-
-
34548322723
-
Memory-efficient regular expression search using state merging
-
May
-
M. Becchi and S. Cadambi. Memory-efficient regular expression search using state merging. In Proc. of INFOCOM 2007, May 2007.
-
(2007)
Proc. of INFOCOM 2007
-
-
Becchi, M.1
Cadambi, S.2
-
5
-
-
56749186238
-
A hybrid finite automaton for practical deep packet inspection
-
ACM
-
M. Becchi and P. Crowley. A hybrid finite automaton for practical deep packet inspection. In Proc. of CoNEXT '07, pages 1-12. ACM, 2007.
-
(2007)
Proc. of CoNEXT '07
, pp. 1-12
-
-
Becchi, M.1
Crowley, P.2
-
6
-
-
77954026099
-
An improved algorithm to accelerate regular expression evaluation
-
M. Becchi and P. Crowley. An improved algorithm to accelerate regular expression evaluation. In Proc. of ANCS '07, pages 145-154, 2007.
-
(2007)
Proc. of ANCS '07
, pp. 145-154
-
-
Becchi, M.1
Crowley, P.2
-
7
-
-
33845908990
-
A scalable architecture for high-throughput regular-expression pattern matching
-
June
-
B. C. Brodie, D. E. Taylor, and R. K. Cytron. A scalable architecture for high-throughput regular-expression pattern matching. In Proc. of ISCA '06, June 2006.
-
(2006)
Proc. of ISCA '06
-
-
Brodie, B.C.1
Taylor, D.E.2
Cytron, R.K.3
-
9
-
-
84976228809
-
A string matching algorithm fast on the average
-
Springer-Verlag.
-
B. Commentz-Walter. A string matching algorithm fast on the average. In Proc. of ICALP '79, pages 118-132. Springer-Verlag.
-
Proc. of ICALP '79
, pp. 118-132
-
-
Commentz-Walter, B.1
-
11
-
-
0033204142
-
Packet classification on multiple fields
-
P. Gupta and N. McKeown. Packet classification on multiple fields. In Sigcomm, pages 147-160, 1999.
-
(1999)
Sigcomm
, pp. 147-160
-
-
Gupta, P.1
McKeown, N.2
-
13
-
-
77954013621
-
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
-
ACM.
-
S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In Proc. of ANCS '07, pages 155-164. ACM.
-
Proc. of ANCS '07
, pp. 155-164
-
-
Kumar, S.1
Chandrasekaran, B.2
Turner, J.3
Varghese, G.4
-
14
-
-
33750368839
-
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
-
ACM.
-
S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In Proc. of SIGCOMM '06, pages 339-350. ACM.
-
Proc. of SIGCOMM '06
, pp. 339-350
-
-
Kumar, S.1
Dharmapurikar, S.2
Yu, F.3
Crowley, P.4
Turner, J.5
-
15
-
-
34547683816
-
Advanced algorithms for fast and scalable deep packet inspection
-
ACM.
-
S. Kumar, J. Turner, and J. Williams. Advanced algorithms for fast and scalable deep packet inspection. In Proc. of ANCS '06, pages 81-92. ACM.
-
Proc. of ANCS '06
, pp. 81-92
-
-
Kumar, S.1
Turner, J.2
Williams, J.3
-
16
-
-
0032178150
-
High-speed policy-based packet forwarding using efficient multi-dimensional range matching
-
T. V. Lakshman and D. Stiliadis. High-speed policy-based packet forwarding using efficient multi-dimensional range matching. In Sigcomm, pages 203-214, 1998.
-
(1998)
Sigcomm
, pp. 203-214
-
-
Lakshman, T.V.1
Stiliadis, D.2
-
18
-
-
84874528870
-
-
Michela Becchi, regex tool
-
Michela Becchi, regex tool, http://regex.wustl.edu/.
-
-
-
-
21
-
-
71749108579
-
Xfas: Fast and compact signature matching
-
University of Wisconsin, Madison, August
-
R. Smith, C. Estan, and S. Jha. Xfas: Fast and compact signature matching. Technical report, University of Wisconsin, Madison, August 2007.
-
(2007)
Technical Report
-
-
Smith, R.1
Estan, C.2
Jha, S.3
-
22
-
-
14844324904
-
Enhancing byte-level network intrusion detection signatures with context
-
ACM.
-
R. Sommer and V. Paxson. Enhancing byte-level network intrusion detection signatures with context. In Proc. of CCS '03, pages 262-271. ACM.
-
Proc. of CCS '03
, pp. 262-271
-
-
Sommer, R.1
Paxson, V.2
-
24
-
-
8344251916
-
Deterministic memory-efficient string matching algorithms for intrusion detection
-
N. Tuck, T. Sherwood, B. Calder, and G. Varghese. Deterministic memory-efficient string matching algorithms for intrusion detection. In Proc. of INFOCOM 2004, pages 333-340.
-
(2004)
Proc. of INFOCOM
, pp. 333-340
-
-
Tuck, N.1
Sherwood, T.2
Calder, B.3
Varghese, G.4
-
25
-
-
34547676339
-
-
Morgan Kaufmann Publishers Inc., San Francisco, CA, USA
-
G. Varghese. Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2004.
-
(2004)
Network Algorithmics,: An Interdisciplinary Approach to Designing Fast Networked Devices.
-
-
Varghese, G.1
-
27
-
-
0012405865
-
A fast algorithm for multi-pattern searching
-
Dept. of Computer Science, University of Arizona.
-
S. Wu and U. Manber. A fast algorithm for multi-pattern searching. Technical Report TR-94-17, Dept. of Computer Science, University of Arizona.
-
Technical Report TR-94-17
-
-
Wu, S.1
Manber, U.2
-
28
-
-
34547662263
-
Fast and memory-efficient regular expression matching for deep packet inspection
-
F. Yu, Z. Chen, Y. Diao, T. V. Lakshman, and R. H. Katz. Fast and memory-efficient regular expression matching for deep packet inspection. In Proc. of ANCS '06, pages 93-102.
-
Proc. of ANCS '06
, pp. 93-102
-
-
Yu, F.1
Chen, Z.2
Diao, Y.3
Lakshman, T.V.4
Katz, R.H.5
|