Optimal two-dimensional compressed matching

DOI10.1007/3-540-58201-0_70zbMath1418.68084OpenAlexW1520688336MaRDI QIDQ4632428

Martin Farach, Amihood Amir, Gary Benson

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_70

zbMATH Keywords

pattern matchingrectangular arraycandidate listbasis vectortext character

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)

Related Items (2)

Efficient algorithms for Lempel-Ziv encoding ⋮ Pattern-matching problems for 2-dimensional images described by finite automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
• Optimal parallel pattern matching in strings
• Design and Analysis of a Data Structure for Representing Sorted Lists
• Fast Pattern Matching in Strings
• An Alphabet Independent Approach to Two-Dimensional Pattern Matching
• Optimal Two-Dimensional Compressed Matching

This page was built for publication: Optimal two-dimensional compressed matching