Alphabet-Independent Two-Dimensional Witness Computation

DOI10.1137/S0097539792241941zbMath0861.68032OpenAlexW2007283112MaRDI QIDQ4714552

Zvi Galil, Kun Soo 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

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)

Related Items (13)

On a conjecture on bidimensional words. ⋮ Parallel two dimensional witness computation ⋮ Multidimensional period recovery ⋮ Faster two-dimensional pattern matching with rotations ⋮ Analysis of two-dimensional approximate pattern matching algorithms ⋮ Inplace run-length 2d compressed search. ⋮ Generalizations of suffix arrays to multi-dimensional matrices. ⋮ Closest periodic vectors in \(L_p\) spaces ⋮ 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 ⋮ A multidimensional critical factorization theorem ⋮ Approximate periodicity

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