Distinct squares in run-length encoded strings
type: Item
instance of: scholarly article
title: Distinct squares in run-length encoded strings
zbMATH Open document ID: 1208.68166
author: Sumit K. Garg
published in: Theoretical Computer Science
publication date: 2010-11-19T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5817529
zbMATH Keywords: squares
zbMATH Keywords: repetition
zbMATH Keywords: \(rc\)-occurrence
zbMATH Keywords: run-length encoding
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.08.031
OpenAlex ID: W2066290715
cites work: Squares, cubes, and time-space efficient string searching
cites work: Jewels of Stringology
cites work: Maximal repetitions in strings
cites work: How many squares can a string contain?
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
cites work: A note on the number of squares in a word
cites work: A fast algorithm for finding the positions of all squares in a run-length encoded string
cites work: Fast Pattern Matching in Strings
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: Detecting leftmost maximal periodicities
DOI: 10.1016/J.TCS.2010.08.031
description: scientific article; zbMATH DE number 5817529