On the Comparison Complexity of the String Prefix-Matching Problem (Q4217300): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088323993 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:29, 19 March 2024
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
