Constant-Time Randomized Parallel String Matching

DOI10.1137/S009753979528007XzbMath0885.68078OpenAlexW2014251352MaRDI QIDQ4376173

Maxime Crochemore, Kun Soo Park, Zvi Galil, Leszek Gąsieniec, Wojciech Rytter

Publication date: 10 February 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979528007x

zbMATH Keywords

randomized algorithmsparallel string matchingdeterministic samples

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Distributed algorithms (68W15)

Related Items (4)

Parallel two dimensional witness computation ⋮ Towards optimal packed string matching ⋮ Efficient string matching on packed texts ⋮ Boolean circuit programming: A new paradigm to design parallel algorithms

This page was built for publication: Constant-Time Randomized Parallel String Matching