scientific article; zbMATH DE number 1256660
From MaRDI portal
Publication:4230346
zbMath0942.68707MaRDI QIDQ4230346
Publication date: 22 April 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)
Related Items
On a conjecture on bidimensional words. ⋮ Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester ⋮ An index data structure for matrices, with applications to fast two-dimensional pattern matching ⋮ On linear-time alphabet-independent 2-dimensional pattern matching ⋮ Two-dimensional pattern matching on a dynamic library of texts ⋮ Efficient string matching on packed texts ⋮ Fine and Wilf words for any periods ⋮ Optimal two-dimensional compressed matching ⋮ Fast parallel string prefix-matching ⋮ Two-dimensional pattern matching by sampling ⋮ Plane digitization and related combinatorial problems ⋮ Two-dimensional comma-free and cylindric codes ⋮ Optimal parallel two dimensional text searching on a CREW PRAM ⋮ Alphabet-independent optimal parallel search for three-dimensional patterns ⋮ Fibonacci arrays and their two-dimensional repetitions ⋮ Optimal discovery of repetitions in 2D ⋮ Sequential and indexed two-dimensional combinatorial template matching allowing rotations ⋮ On Fine and Wilf's theorem for bidimensional words. ⋮ Optimal Parallel Searching an Array for Certain Repetitions
