A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching

DOI10.1137/S0097539795280068zbMath0912.68067OpenAlexW2069275576WikidataQ61677974 ScholiaQ61677974MaRDI QIDQ4388892

No author found.

Publication date: 10 May 1998

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

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

zbMATH Keywords

periodicitypattern matchingPRAMtwo-dimensionalwitnessesduelling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items (7)

Parallel two dimensional witness computation ⋮ Multidimensional period recovery ⋮ Succinct 2D dictionary matching ⋮ Unnamed Item ⋮ Efficient string matching on packed texts ⋮ 2D Lyndon words and applications ⋮ Two-dimensional maximal repetitions

This page was built for publication: A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching