Revisiting multiple pattern matching algorithms for multi-core architecture
From MaRDI portal
Publication:2434550
DOI10.1007/S11390-011-0185-0zbMATH Open1280.68059OpenAlexW2004875427MaRDI QIDQ2434550FDOQ2434550
Authors: Guang-Ming Tan, Ping Liu, Dongbo Bu, Yanbing Liu
Publication date: 6 February 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-011-0185-0
Recommendations
- Multi-pattern matching algorithms and hardware based implementation
- Parallel algorithms for combinatorial pattern matching
- Simple Optimal Parallel Multiple Pattern Matching
- Multi-pattern matching algorithm with wildcards based on bit-parallelism
- Accelerating Pattern Matching Using a Novel Parallel Algorithm on GPUs
Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)
Cites Work
- Introduction to algorithms.
- Efficient string matching
- Title not available (Why is that?)
- Complexity of Scheduling under Precedence Constraints
- An algorithm for approximate membership checking with application to password security
- Title not available (Why is that?)
- From regular expressions to DFA's using compressed NFA's
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Revisiting multiple pattern matching algorithms for multi-core architecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434550)