Bounds on Powers in Strings
type: Item
instance of: scholarly article
title: Bounds on Powers in Strings
zbMATH Open document ID: 1159.68014
DOI: 10.1007/978-3-540-85780-8_16
author: Maxime Crochemore
author: Szilárd Zsolt Fazekas
author: Costas S. Iliopoulos
author: Inuka Jayasekera
published in: Developments in Language Theory
publication date: 2008-10-30T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5359028
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-540-85780-8 16
OpenAlex ID: W1706995980
cites work: Optimal off-line detection of repetitions in a string
cites work: An optimal algorithm for computing the repetitions in a word
cites work: Analysis of Maximal Repetitions in Strings
cites work: Squares, cubes, and time-space efficient string searching
cites work: Not So Many Runs in Strings
cites work: A characterization of the squares in a Fibonacci string
cites work: Q4681771
cites work: Detecting leftmost maximal periodicities
cites work: An O(n log n) algorithm for finding all repetitions in a string
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 number of runs in a string
Recommended article: NUMBER OF OCCURRENCES OF POWERS IN STRINGS
Recommended article: String powers in trees
Recommended article: String Powers in Trees
Recommended article: How many runs can a string contain?
Recommended article: Maximal repetitions in strings
description: scientific article; zbMATH DE number 5359028