Light-based string matching
From MaRDI portal
Publication:835975
DOI10.1007/s11047-007-9033-0zbMath1192.68203WikidataQ58609903 ScholiaQ58609903MaRDI QIDQ835975
Publication date: 31 August 2009
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-007-9033-0
68P10: Searching and sorting
Related Items
On the complexity of nonuniform wavelength-based machine, Solving the generalized subset sum problem with a light based device
Cites Work
- Unnamed Item
- Rainbow sort: Sorting at the speed of light
- Correctness and efficiency of pattern matching algorithms
- Leibniz's dynamics and optics
- Speeding up two string-matching algorithms
- An optical model of computation
- A fast string searching algorithm
- The Boyer–Moore–Galil String Searching Strategies Revisited
- A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
- On the Exact Complexity of String Matching: Lower Bounds
- On the Exact Complexity of String Matching: Upper Bounds
- Fast Pattern Matching in Strings
- Tighter Lower Bounds on the Exact Complexity of String Matching
- A Light-Based Device for Solving the Hamiltonian Path Problem