×

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].

MSC:

68P10 Searching and sorting
PDFBibTeX XMLCite