scientific article; zbMATH DE number 4205980

MaRDI QIDQ3355232zbMATH OpenFDO

Authors Maxime Crochemore, Wojciech Rytter

Publication date 1990

zbMATH Keywords

building pattern matching automatacomputing Lyndon factorizationsfinding squareslongest commonlongest repeated subarraylongest symmetric subarraypattern matching in arraysPRAMtesting even

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Distributed algorithms (68W15)

Recommendations

• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• scientific article; zbMATH DE number 826061
• scientific article; zbMATH DE number 3911754
• Optimal parallel algorithms for string matching
• Optimal parallel pattern matching in strings

Cited in

(15)

• Parallel processing of encoded bit strings
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Efficient parallel algorithms to test square-freeness and factorize strings
• The derivation of on-line algorithms, with an application to finding palindromes
• Testing string superprimitivity in parallel
• On two-dimensional pattern matching by optimal parallel algorithms
• Finding all periods and initial palindromes of a string in parallel
• Improved linear systolic algorithms for substring statistics
• Algorithms in the ultra-wide word model
• Optimal Parallel Searching an Array for Certain Repetitions
• scientific article; zbMATH DE number 4155884 (Why is no real title available?)
• Optimal parallel algorithms for string matching
• Parallel detection of all palindromes in a string
• Efficient constructions of test sets for regular and context-free languages
• Parallel construction of minimal suffix and factor automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355232)