Abstract
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 language | English |
|---|---|
| Pages | 817-818 |
| Number of pages | 2 |
| State | Published - 2000 |
| Externally published | Yes |
| Event | 11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: 9 Jan 2000 → 11 Jan 2000 |
Conference
| Conference | 11th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | San Francisco, CA, USA |
| Period | 9/01/00 → 11/01/00 |
ASJC Scopus subject areas
- Software
- General Mathematics