The Boyer Moore Galil string searching strategies revisited
SIAM Journal on Computing
Optical computing: a survey for computer scientists
Optical computing: a survey for computer scientists
Introduction to algorithms
On the exact complexity of string matching: lower bounds
SIAM Journal on Computing
Correctness and efficiency of pattern matching algorithms
Information and Computation
On the exact complexity of string matching: upper bounds
SIAM Journal on Computing
Tighter Lower Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing
A fast string searching algorithm
Communications of the ACM
An optical model of computation
Theoretical Computer Science
Rainbow Sort: Sorting at the Speed of Light
Natural Computing: an international journal
A light-based device for solving the hamiltonian path problem
UC'06 Proceedings of the 5th international conference on Unconventional Computation
The silicon solution [silicon photonics]
IEEE Spectrum
Computing a Solution for the Subset Sum Problem with a Light Based Device
OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing
Solving the generalized Subset Sum problem with a light based device
Natural Computing: an international journal
An optical solution to the 3-SAT problem using wavelength based selectors
The Journal of Supercomputing
| Hi-index | 0.00 |
String matching is a very important problem in computer science. The problem consists in finding all the occurrences of a pattern P of length m in a text T of length n. We describe a special device which can do string matching by performing n−m + 1 text-to-pattern comparisons. The proposed device uses light and optical filters for performing computations. Two physical implementations are proposed. One of them uses colored glass and the other one uses polarizing filters. The strengths and the weaknesses of each method are deeply discussed.