scientific article; zbMATH DE number 742992
From MaRDI portal
Publication:4763432
zbMath0829.68062MaRDI QIDQ4763432
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Related Items (22)
Collage system: A unifying framework for compressed pattern matching. ⋮ On a conjecture on bidimensional words. ⋮ A general compression algorithm that supports fast searching ⋮ Periodicity in rectangular arrays ⋮ On linear-time alphabet-independent 2-dimensional pattern matching ⋮ Inplace run-length 2d compressed search. ⋮ Bidirectional adaptive compression ⋮ Efficient retrieval of approximate palindromes in a run-length encoded string ⋮ Optimal two-dimensional compressed matching ⋮ 2D Lyndon words and applications ⋮ Motif patterns in 2D ⋮ Two-dimensional pattern matching by sampling ⋮ Fast searching in packed strings ⋮ Plane digitization and related combinatorial problems ⋮ Hardness of comparing two run-length encoded strings ⋮ Fast Searching in Packed Strings ⋮ Alphabet-independent optimal parallel search for three-dimensional patterns ⋮ Fibonacci arrays and their two-dimensional repetitions ⋮ Optimal discovery of repetitions in 2D ⋮ On Fine and Wilf's theorem for bidimensional words. ⋮ A multidimensional critical factorization theorem ⋮ Optimal Parallel Searching an Array for Certain Repetitions
This page was built for publication:
