An optimal algorithm for computing the repetitions in a word
type: Item
instance of: scholarly article
title: An optimal algorithm for computing the repetitions in a word
zbMATH Open document ID: 0467.68075
DOI: 10.1016/0020-0190(81)90024-7
published in: Information Processing Letters
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 3733290
zbMATH Keywords: analysis of algorithm
zbMATH Keywords: optimality
zbMATH Keywords: partitioning
zbMATH Keywords: repetition in words
zbMATH Keywords: squarefreeness
zbMATH Keywords: powerfreeness
zbMATH Keywords: Fibonacci words
Wikidata QID: Q61677999
author: Maxime Crochemore
MaRDI profile type: Publication
full work available at URL: 0020-0190(81)90024-7
OpenAlex ID: W2067787802
cites work: Q4091421
cites work: Partitioning a graph in \(O(|A|\log_ 2|V|)\)
cites work: Q4198075
cites work: Fast Pattern Matching in Strings
cites work: Q5625457
cites work: Q3951572
DBLP publication ID: journals/ipl/Crochemore81
description: scientific article; zbMATH DE number 3733290