Work

A constant-time optimal parallel string-matching algorithm

Year: 1992

Type: conference-paper

Abstract: Given a pattern string, we describe a way to preprocess it. We design a constant-time optimal parallel algorithm for finding all occurences of the (preprocessed) pattern in any given text.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/129712.129720

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: bronze

OpenAlex ID: W2073697541

FWCI: 3.205

Cites: 19

Cited by: 24

Related to: 10