Amir, Amihood; Landau, Gad M.; Sokol, Dina Inplace run-length 2D compressed search. (English) Zbl 0958.68508 Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 9-11, 2000. Philadelphia, PA: SIAM. 817-818 (2000). Summary: We present an algorithm to solve the two-dimensional compressed matching problem for the run-length compression (used by fax transmission). The algorithm is, to our knowledge, the first known inplace 2D compressed search algorithm.For the entire collection see [Zbl 0933.00039]. Cited in 1 Document MSC: 68P10 Searching and sorting Keywords:two-dimensional compressed matching problem; run-length compression PDFBibTeX XMLCite \textit{A. Amir} et al., in: Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms, SODA 2000, San Francisco, CA, USA, January 9--11, 2000. Philadelphia, PA: SIAM. 817--818 (2000; Zbl 0958.68508)