Alphabet-Independent Two-Dimensional Witness Computation

DOI10.1137/S0097539792241941zbMATH Open0861.68032OpenAlexW2007283112MaRDI QIDQ4714552FDOQ4714552

Authors: Zvi Galil, Kunsoo Park 

Publication date: 7 November 1996

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

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

Recommendations

• On linear-time alphabet-independent 2-dimensional pattern matching
• Two-Dimensional Periodicity in Rectangular Arrays
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Parallel two dimensional witness computation

zbMATH Keywords

two-dimensional pattern matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)

Cited In (13)

• A multidimensional critical factorization theorem
• Generalizations of suffix arrays to multi-dimensional matrices.
• Closest periodic vectors in \(L_p\) spaces
• Parallel two dimensional witness computation
• Analysis of two-dimensional approximate pattern matching algorithms
• On a conjecture on bidimensional words.
• Inplace run-length 2d compressed search.
• Multidimensional period recovery
• Approximate periodicity
• THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
• Generalizations of suffix arrays to multi-dimensional matrices.
• Optimal discovery of repetitions in 2D
• Faster two-dimensional pattern matching with rotations

This page was built for publication: Alphabet-Independent Two-Dimensional Witness Computation

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