A Lower Bound for Parallel String Matching
From MaRDI portal
Publication:4015971
DOI10.1137/0221050zbMath0756.68048MaRDI QIDQ4015971
Publication date: 6 December 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221050
68Q25: Analysis of algorithms and problem complexity
68W10: Parallel algorithms in computer science
68W15: Distributed algorithms
Related Items
On the lower bound for parallel string matching, Efficient string matching on packed texts, Optimal parallel algorithms for Prefix Matching, On the lower bound for parallel string matching, Optimal parallel algorithms for periods, palindromes and squares, Transforming comparison model lower bounds to the parallel-random-access-machine, A work-time optimal algorithm for computing all string covers, Fast parallel string prefix-matching, Quasiperiodicity and string covering, Testing string superprimitivity in parallel, Parallel two dimensional witness computation, Finding all periods and initial palindromes of a string in parallel, Towards optimal packed string matching