Optimal two-dimensional compressed matching
From MaRDI portal
Recommendations
Cites work
- An Alphabet Independent Approach to Two-Dimensional Pattern Matching
- An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Fast Pattern Matching in Strings
- scientific article; zbMATH DE number 1003304 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 1256660 (Why is no real title available?)
- scientific article; zbMATH DE number 742992 (Why is no real title available?)
- Optimal parallel pattern matching in strings
- Optimal Two-Dimensional Compressed Matching
Cited in
(9)- Inplace run-length 2d compressed search.
- Small-Space 2D Compressed Dictionary Matching
- Optimal Two-Dimensional Compressed Matching
- Inplace 2D matching in compressed images
- scientific article; zbMATH DE number 2079423 (Why is no real title available?)
- scientific article; zbMATH DE number 742992 (Why is no real title available?)
- scientific article; zbMATH DE number 1445382 (Why is no real title available?)
- Efficient algorithms for Lempel-Ziv encoding
- Pattern-matching problems for 2-dimensional images described by finite automata
This page was built for publication: Optimal two-dimensional compressed matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632428)