An 0(1) time algorithm for string matching (Q3989790): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207169208804061 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148751491 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast string searching algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Time-space-optimal string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Latest revision as of 15:14, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An 0(1) time algorithm for string matching |
scientific article |
Statements
An 0(1) time algorithm for string matching (English)
0 references
28 June 1992
0 references
string matching
0 references
processor array
0 references
reconfigurable bus system
0 references
