Work

Work-time-optimal parallel algorithms for string problems

Year: 1995

Type: conference-paper

Abstract: A parallel algorithm is work-optimal if it uses the srrlallest possible work; a work-optimal algorithm is worktirne-optimal if it also uses the smallest possible time.We design worl{-time-optirnal algorithm for a number of string processing problems on the EREW-PRAM and the hypercuhe, They include string matching and two dimensional pattern matching.No such algorithms have been known before for any of these probl~ms.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/225058.225289

Authors: Artur Czumaj, Zvi Galil, Leszek Gąsieniec, Kunsoo Park, Wojciech Plandowski

Institutions: Paderborn University, Tel Aviv University, Columbia University, University of Warsaw, Seoul National University

Language: English

Topic: Algorithms and Data Compression

Subfield: Theoretical Computer Science

Field: Mathematics

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2080516655

FWCI: 2.612

Cites: 23

Cited by: 19

Related to: 10