A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185)
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: A fast algorithm for finding the positions of all squares in a run-length encoded string |
scientific article; zbMATH DE number 5602751
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for finding the positions of all squares in a run-length encoded string |
scientific article; zbMATH DE number 5602751 |
Statements
A fast algorithm for finding the positions of all squares in a run-length encoded string (English)
0 references
10 September 2009
0 references
squares
0 references
divide-and-conquer
0 references
repetition
0 references
run-length encoding
0 references
0.7855195999145508
0 references
0.7803376913070679
0 references
0.7685154676437378
0 references
0.7683369517326355
0 references
