Nested Counters in Bit-Parallel String Matching

Language and Automata Theory and Applications - Lecture Notes in Computer Science ◽

10.1007/978-3-642-00982-2_29 ◽

2009 ◽

pp. 338-349 ◽

Cited By ~ 3

Author(s):

Kimmo Fredriksson ◽

Szymon Grabowski

Keyword(s):

String Matching ◽

Parallel String Matching

A constant-time optimal parallel string-matching algorithm

Journal of the ACM ◽

10.1145/210332.210341 ◽

1995 ◽

Vol 42 (4) ◽

pp. 908-918 ◽

Cited By ~ 17

Author(s):

Zvi Galil

Keyword(s):

String Matching ◽

Constant Time ◽

Matching Algorithm ◽

Time Optimal ◽

Parallel String Matching

Parallel String Matching for Urdu Language Text

Communications in Computer and Information Science - Intelligent Technologies and Applications ◽

10.1007/978-981-13-6052-7_32 ◽

2019 ◽

pp. 369-378

Author(s):

Mirza Baber Baig ◽

Taoshen S. Li

Keyword(s):

String Matching ◽

Language Text ◽

Parallel String Matching

Derivation of a parallel string matching algorithm

Information Processing Letters ◽

10.1016/s0020-0190(02)00416-7 ◽

2003 ◽

Vol 85 (5) ◽

pp. 255-260 ◽

Cited By ~ 8

Author(s):

Jayadev Misra

Keyword(s):

String Matching ◽

Matching Algorithm ◽

Parallel String Matching

On the lower bound for parallel string matching

International Journal of Computer Mathematics ◽

10.1080/00207169408804319 ◽

1994 ◽

Vol 53 (3-4) ◽

pp. 129-133 ◽

Cited By ~ 1

Author(s):

Clive N. Galley

Keyword(s):

Lower Bound ◽

String Matching ◽

Parallel String Matching

A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection

IEICE Transactions on Communications ◽

10.1587/transcom.e93.b.1612 ◽

2010 ◽

Vol E93-B (6) ◽

pp. 1612-1614 ◽

Cited By ~ 5

Author(s):

HyunJin KIM ◽

Hyejeong HONG ◽

Dongmyoung BAEK ◽

Sungho KANG

Keyword(s):

String Matching ◽

Deep Packet Inspection ◽

Partitioning Algorithm ◽

Packet Inspection ◽

Parallel String Matching ◽

Memory Efficient

A Lower Bound for Parallel String Matching

SIAM Journal on Computing ◽

10.1137/0221050 ◽

1992 ◽

Vol 21 (5) ◽

pp. 856-862 ◽

Cited By ~ 23

Author(s):

Dany Breslauer ◽

Zvi Galil

Keyword(s):

Lower Bound ◽

String Matching ◽

Parallel String Matching

A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection

IEEE Journal on Selected Areas in Communications ◽

10.1109/jsac.2006.877221 ◽

2006 ◽

Vol 24 (10) ◽

pp. 1793-1804 ◽

Cited By ~ 52

Author(s):

H. Lu ◽

K. Zheng ◽

B. Liu ◽

X. Zhang ◽

Y. Liu

Keyword(s):

Intrusion Detection ◽

High Speed ◽

String Matching ◽

Parallel String Matching ◽

Memory Efficient

A bit-split byte-parallel string matching architecture

2009 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery ◽

10.1109/cyberc.2009.5342207 ◽

2009 ◽

Cited By ~ 1

Author(s):

Chuanpeng Chen ◽

Zhongping Qin

Keyword(s):

String Matching ◽

Parallel String Matching

Parallel String Matching with Variable Length Don′t Cares

Journal of Parallel and Distributed Computing ◽

10.1006/jpdc.1994.1083 ◽

1994 ◽

Vol 22 (2) ◽

pp. 229-234 ◽

Cited By ~ 13

Author(s):

A.A. Bertossi ◽

F. Logi

Keyword(s):

String Matching ◽

Variable Length ◽

Parallel String Matching

Parallel String Matching with Linear Array, Butterfly and Divide and Conquer Models

Annals of Data Science ◽

10.1007/s40745-017-0124-1 ◽

2017 ◽

Vol 5 (2) ◽

pp. 181-207 ◽

Cited By ~ 2

Author(s):

S. Viswanadha Raju ◽

K. K. V. V. S. Reddy ◽

Chinta Someswara Rao

Keyword(s):

Linear Array ◽

String Matching ◽

Divide And Conquer ◽

Parallel String Matching