Optimal parallel algorithms for periods, palindromes and squares (Q5204325): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q673782
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Zvi Galil / 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.1007/3-540-55719-9_82 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1519893856 / 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: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for Parallel String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all periods and initial palindromes of a string in parallel / 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: Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays / 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: Relations between Concurrent-Write Models of Parallel Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(a_ M=b^ Nc^ P\) in a free group / 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: Optimal parallel pattern matching in strings / rank
 
Normal rank

Latest revision as of 05:01, 21 July 2024

scientific article; zbMATH DE number 7139639
Language Label Description Also known as
English
Optimal parallel algorithms for periods, palindromes and squares
scientific article; zbMATH DE number 7139639

    Statements

    Optimal parallel algorithms for periods, palindromes and squares (English)
    0 references
    0 references
    0 references
    0 references
    4 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithm
    0 references
    string matching
    0 references
    input string
    0 references
    periods of a words
    0 references
    palindromes
    0 references
    square-free words
    0 references
    0 references