### Abstract

We present the first known (alphabet independent) algorithm for two-dimensional pattern matching which works in linear time and small space simultaneously. The searching phase of our algorithm works in O(1) space and is followed by pattern preprocessing performed in O(log m) space. Up to now there was not known even any efficient sublinear space algorithm for this problem. The main tools in our algorithm are several 2-dimensional variations of deterministic sampling, originally used in parallel pattern matching: small, frame and wide samples. Another novel idea used in our algorithm is the technique of zooming sequences: the sequences of nonperiodic decreasing parts of the pattern (samples) of similar regular shapes. Their regularity allows to encode the zooming sequences in small memory (logarithmic number of bits) while nonperiodicity allows to make shifts (kill positions as candidates for a match) in a way amortizing the work. The preprocessing phase is recursive, its structure is similar to the linear time algorithm for the selection problem. The stack of the recursion consists of logarithmic number of integers. Our algorithm is rather complicated, but all known alphabet-independent linear time algorithms (even with unrestricted space) for 2d-matching are quite complicated, too.

Original language | English (US) |
---|---|

Title of host publication | STACS 1995 - 12th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings |

Editors | Ernst W. Mayr, Claude Puech |

Publisher | Springer Verlag |

Pages | 181-192 |

Number of pages | 12 |

ISBN (Print) | 3540590420, 9783540590422 |

DOIs | |

State | Published - 1995 |

Externally published | Yes |

Event | 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995 - Munich, Germany Duration: Mar 2 1995 → Mar 4 1995 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 900 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 12th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1995 |
---|---|

Country | Germany |

City | Munich |

Period | 3/2/95 → 3/4/95 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Two-dimensional pattern matching in linear time and small space'. Together they form a unique fingerprint.

## Cite this

*STACS 1995 - 12th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings*(pp. 181-192). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 900). Springer Verlag. https://doi.org/10.1007/3-540-59042-0_72