An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String (Q5691298)
From MaRDI portal
scientific article; zbMATH DE number 971588
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String |
scientific article; zbMATH DE number 971588 |
Statements
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String (English)
0 references
24 February 1997
0 references
parallel string-matching algorithm
0 references
