An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm (Q3495651): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0219072 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086273045 / rank | |||
Normal rank | |||
Revision as of 19:46, 19 March 2024
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
