An efficient algorithm for online square detection (Q860815): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q538469
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2006.06.011 / rank
Normal rank
 
Property / author
 
Property / author: Zeshan Peng / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TROLL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084844607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel detection of squares in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal off-line detection of repetitions in a string / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of noncounting events / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for computing the repetitions in a word / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transducers and repetitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms to test square-freeness and factorize strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / 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: An infinite square-free co-CFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of an infinite square-free co-CFL / 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: Q3690246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3951572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly primitive word of arbitrary length and its application † / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and flexible detection of contiguous repeats using a suffix tree / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2006.06.011 / rank
 
Normal rank

Latest revision as of 05:45, 10 December 2024

scientific article
Language Label Description Also known as
English
An efficient algorithm for online square detection
scientific article

    Statements

    An efficient algorithm for online square detection (English)
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    online algorithms
    0 references
    squares
    0 references
    square-free detection
    0 references
    string processing
    0 references

    Identifiers