Fast Regular Expression Matching Using FPGAs
By Reetinder P. S. Sidhu, Viktor K. Prasanna. IEEE Symposium on Field-Programmable Custom Computing Machines, 2001
622 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Hardware and Architecture, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/c2b36d79fe63363016611ffdd6383439de29ef95
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Hardware and Architecture
- Danielle N Carver
- Jonathan S. Turner
- T. V. Lakshman
- P. Crowley
- Brad L. Hutchings
- R. Franklin
- S. Sushanth Kumar
- Fang Yu
In Molecular Biology
Citations in the corpus
- Assisting network intrusion detection with reconfigurable hardware (2002, methodology): “For additional examples, please see the paper by Sidhu and Prasanna [ 11 ].”
- Algorithms to accelerate multiple regular expressions matching for deep packet inspection (2006, background): “Sindhu et al. [15] and Clark et al. [16] have implemented nondeterministic finite automata (NFAs) on FPGA devices to perform regular expression matching and were able to achieve very good space efficiency.”
- Gigabit rate packet pattern-matching using TCAM (2004, methodology): “proposed a Nondeterministic Finite Automaton (NFA) approach using FPGAs [7].”