An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm (Q3495651)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm |
scientific article |
Statements
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm (English)
0 references
1990
0 references
period
0 references
parallel algorithm
0 references
string
0 references
