Work

Optimal parallel algorithms for string matching

Year: 1984

Type: conference-paper

Abstract: Let WRAM [PRAM] be a parallel computer with p processors (RAM's) which share a common memory and are allowed simultaneous reads and writes [only simultaneous reads]. The only type of simultaneous writes allowed is a simultaneous AND: several processors may write O simultaneously into the same memory cell. Let t be the time bound of the computer. We design below families of parallel algorithms that solve the string matching problem with inputs of size n (n is the sum of lengths of the pattern and the text) and have the following performance in terms of p, t and n:

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/800057.808687

Author: Zvi Galil*

Institutions: Tel Aviv University, Columbia University

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1986597203

FWCI: 14.93

Cites: 12

Cited by: 62

Related to: 10