✦ LIBER ✦

A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching

✍ Scribed by Crochemore, Maxime; Gasieniec, Leszek; Hariharan, Ramesh; Muthukrishnan, S.; Rytter, Wojciech

Book ID: 118178160
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 359 KB
Volume: 27
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539795280068

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On two-dimensional pattern matching by o

On two-dimensional pattern matching by optimal parallel algorithms

✍ Maxime Crochemore; Wojciech Rytter 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 781 KB

Two- and Higher-Dimensional Pattern Matc

Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time

✍ Kärkkäinen, Juha; Ukkonen, Esko 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 415 KB

A parallel algorithm for tree pattern ma

A parallel algorithm for tree pattern matching

✍ Koji Tarora; Tomio Hirata; Yasuyoshi Inagaki 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

## Abstract Given a text tree __t__ and a pattern tree __p__, tree pattern matching involves finding subtrees of __t__ which match __p.__ This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in __O__(log __n__) parallel time using __mn__/log__n__ proc

A time-optimal parallel algorithm for th

A time-optimal parallel algorithm for three-dimensional convex hulls

✍ N. M. Amato; F. P. Preparata 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 937 KB

An Optimal $O(\log\log n)$ Time Parallel

An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm

✍ Breslauer, Dany; Galil, Zvi 📂 Article 📅 1990 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 960 KB

A sublinear algorithm for two-dimensiona

A sublinear algorithm for two-dimensional string matching

✍ Jorma Tarhio 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 386 KB