Efficient CRCW-PRAM algorithms for universal substring searching
From MaRDI portal
Publication:1208721
DOI10.1016/0304-3975(93)90197-2zbMath0779.68039OpenAlexW2088099407MaRDI QIDQ1208721
Publication date: 16 May 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90197-2
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Parallel construction of a suffix tree with applications
- Optimal canonization of all substrings of a string
- Optimal parallel detection of squares in strings
- On the computational power of pushdown automata
- Deterministic Sampling–A New Technique for Fast Pattern Matching
- Factorizing words over an ordered alphabet
- Optimal parallel algorithms for string matching
- Fast canonization of circular strings
- Bounds for the String Editing Problem
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- Fast parallel and serial approximate string matching
- Two-way string-matching
- Free differential calculus. IV: The quotient groups of the lower central series
This page was built for publication: Efficient CRCW-PRAM algorithms for universal substring searching
