Optimal parallel algorithms for string matching

DOI10.1016/S0019-9958(85)80031-0zbMath0588.68022MaRDI QIDQ3716298

Zvi Galil

Publication date: 1985

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

parallel computation; PRAM; WRAM

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

Related Items

Fast parallel Lyndon factorization with applications, On the lower bound for parallel string matching, Efficient string matching on packed texts, Optimal parallel algorithms for Prefix Matching, Forty Years of Text Indexing, Parallel String Matching, Finding the cyclic covers of a string, Parallel detection of all palindromes in a string, Fast parallel string prefix-matching, A string-matching algorithm for the CREW PRAM, Parallel tree pattern matching, Fast string matching with k differences, Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, Efficient CRCW-PRAM algorithms for universal substring searching, Parallel finding all initial palindromes and periods of a string on reconfigurable meshes, Alphabet-independent optimal parallel search for three-dimensional patterns, On two-dimensional pattern matching by optimal parallel algorithms, Finding approximate palindromes in strings, Finding all periods and initial palindromes of a string in parallel, Multidimensional period recovery, Fast parallel and serial multidimensional approximate array matching, Approximate periodicity, Towards optimal packed string matching, Closest periodic vectors in \(L_p\) spaces, Real-Time Streaming String-Matching