The maximal number of cubic runs in a word
type: Item
instance of: scholarly article
title: The maximal number of cubic runs in a word
zbMATH Open document ID: 1250.68217
author: Costas S. Iliopoulos
author: Jakub Radoszewski
author: Wojciech Rytter
author: Maxime Crochemore
author: Marcin Kubica
author: Tomasz Waleń
published in: Journal of Computer and System Sciences
publication date: 2012-11-06T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6102594
zbMATH Keywords: run in a word
zbMATH Keywords: Lyndon word
zbMATH Keywords: Fibonacci word
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.12.005
OpenAlex ID: W1973043305
Wikidata QID: Q61677877
cites work: The Number of Runs in Sturmian Words
cites work: Q3395963
cites work: Analysis of Maximal Repetitions in Strings
cites work: Maximal repetitions in strings
cites work: Repetitions in strings: algorithms and combinatorics
cites work: Towards a Solution to the “Runs” Conjecture
cites work: On the Maximal Number of Cubic Runs in a String
cites work: Squares, cubes, and time-space efficient string searching
cites work: AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING
cites work: Not So Many Runs in Strings
cites work: On the Maximal Number of Cubic Subwords in a String
cites work: Q3659988
cites work: Repetitions in the Fibonacci infinite word
cites work: How many runs can a string contain?
cites work: The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
cites work: The structure of subword graphs and suffix trees of Fibonacci words
cites work: The number of runs in a string
cites work: Q3565863
DOI: 10.1016/J.JCSS.2011.12.005
description: scientific article; zbMATH DE number 6102594