Distinct squares in run-length encoded strings (Q606988): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Squares, cubes, and time-space efficient string searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal repetitions in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many squares can a string contain? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding and representing all the tandem repeats in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof that a word of length \(n\) has at most \(2n\) distinct squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of squares in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for finding the positions of all squares in a run-length encoded string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for finding all repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting leftmost maximal periodicities / rank
 
Normal rank

Revision as of 12:28, 3 July 2024

scientific article
Language Label Description Also known as
English
Distinct squares in run-length encoded strings
scientific article

    Statements

    Identifiers