An optimal algorithm for computing the repetitions in a word (Q1155963): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/ipl/Crochemore81, #quickstatements; #temporary_batch_1731468600454 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(81)90024-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067787802 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4091421 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning a graph in \(O(|A|\log_ 2|V|)\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5625457 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3951572 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/ipl/Crochemore81 / rank | |||
Normal rank | |||
Latest revision as of 04:44, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for computing the repetitions in a word |
scientific article |
Statements
An optimal algorithm for computing the repetitions in a word (English)
0 references
1981
0 references
analysis of algorithm
0 references
optimality
0 references
partitioning
0 references
repetition in words
0 references
squarefreeness
0 references
powerfreeness
0 references
Fibonacci words
0 references
