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

DOI10.1137/S0097539795280068MaRDI QIDQ4388892zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

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

duellingpattern matchingperiodicityPRAMtwo-dimensionalwitnesses

Mathematics Subject Classification ID

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

Recommendations

• Optimal parallel two dimensional text searching on a CREW PRAM
• Parallel two dimensional witness computation
• scientific article; zbMATH DE number 826061

Cited in

(17)

• Optimal parallel two dimensional text searching on a CREW PRAM
• Parallel two dimensional witness computation
• Multidimensional period recovery
• Two-dimensional maximal repetitions
• Succinct 2D dictionary matching
• Optimal Parallel Searching an Array for Certain Repetitions
• scientific article; zbMATH DE number 1308942 (Why is no real title available?)
• Efficient string matching on packed texts
• Two-dimensional pattern matching in linear time and small space
• scientific article; zbMATH DE number 826061 (Why is no real title available?)
• Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
• Two-dimensional maximal repetitions
• On linear-time alphabet-independent 2-dimensional pattern matching
• 2D Lyndon words and applications
• Parallel algorithms for combinatorial pattern matching
• Exact and inexact search for 2d side-sharing tandems
• Optimal bounds for distinct quartics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4388892)