Worst case efficient single and multiple string matching in the RAM model (Q3000497)
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: Worst case efficient single and multiple string matching in the RAM model |
scientific article; zbMATH DE number 5897202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case efficient single and multiple string matching in the RAM model |
scientific article; zbMATH DE number 5897202 |
Statements
Worst Case Efficient Single and Multiple String Matching in the RAM Model (English)
0 references
19 May 2011
0 references
0.9722298383712769
0 references
0.8463855981826782
0 references
0.8339214324951172
0 references
0.8309375643730164
0 references
0.8273115158081055
0 references
