Alphabet-Independent Two-Dimensional Witness Computation

DOI10.1137/S0097539792241941MaRDI QIDQ4714552zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(16)

• Analysis of two-dimensional approximate pattern matching algorithms
• Inplace run-length 2d compressed search.
• Generalizations of suffix arrays to multi-dimensional matrices.
• On a conjecture on bidimensional words.
• Parallel two dimensional witness computation
• Multidimensional period recovery
• Approximate periodicity
• Closest periodic vectors in \(L_p\) spaces
• Optimal discovery of repetitions in 2D
• A multidimensional critical factorization theorem
• Two-Dimensional Periodicity in Rectangular Arrays
• THEORETICAL ISSUES OF SEARCHING AERIAL PHOTOGRAPHS: A BIRD'S EYE VIEW
• Generalizations of suffix arrays to multi-dimensional matrices.
• Optimal bounds for distinct quartics
• Better indexing for rectangular pattern matching
• 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)