Inplace run-length 2d compressed search

Amihood Amir, Gad M. Landau, Dina Sokol

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations


An algorithm to solve the 2D compressed matching problem for the runlength compression is presented. The algorithm is the first known inplace 2D compressed search algorithm. A formal definition of the problem and a high level description of the algorithm is discussed.

Original languageEnglish
Number of pages2
StatePublished - 2000
Event11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 9 Jan 200011 Jan 2000


Conference11th Annual ACM-SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA


Dive into the research topics of 'Inplace run-length 2d compressed search'. Together they form a unique fingerprint.

Cite this