On the Comparison Complexity of the String Prefix-Matching Problem (Q4217300)
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: On the Comparison Complexity of the String Prefix-Matching Problem |
scientific article; zbMATH DE number 1221715
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Comparison Complexity of the String Prefix-Matching Problem |
scientific article; zbMATH DE number 1221715 |
Statements
On the Comparison Complexity of the String Prefix-Matching Problem (English)
0 references
18 May 1999
0 references
on-line prefix-matching algorithms
0 references
