scientific article; zbMATH DE number 4205980

zbMATH Open0729.68024MaRDI QIDQ3355232FDOQ3355232

Authors: Maxime Crochemore, Wojciech Rytter 

Publication date: 1990

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

PRAMbuilding pattern matching automatacomputing Lyndon factorizationsfinding squareslongest commonlongest repeated subarraylongest symmetric subarraypattern matching in arraystesting even

Mathematics Subject Classification ID

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

Cited In (12)

• Efficient constructions of test sets for regular and context-free languages
• Testing string superprimitivity in parallel
• Algorithms in the ultra-wide word model
• Parallel processing of encoded bit strings
• Title not available (Why is that?)
• Improved linear systolic algorithms for substring statistics
• The derivation of on-line algorithms, with an application to finding palindromes
• Efficient parallel algorithms to test square-freeness and factorize strings
• Optimal parallel algorithms for string matching
• On two-dimensional pattern matching by optimal parallel algorithms
• Parallel construction of minimal suffix and factor automata
• Optimal Parallel Searching an Array for Certain Repetitions

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)