Arthur Czumaj, et al.  Home/Search
Context Related
| csc.liv.ac.uk/~leszek/pa...stoc95.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: csc.liv.ac.uk/~leszek/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Artur Czumaj Zvi Galil y Leszek G¸asieniec z Kunsoo Park x Wojciech Plandowski -- Abstract A parallel algorithm is work-optimal if it uses the smallest possible work; a work-optimal algorithm is worktime -optimal if it also uses the smallest possible time. We design work-time-optimal algorithm for a number of string processing problems on the EREW-PRAM and the hypercube. They include string matching and two dimensional pattern matching. No such algorithms have been known before for ... (Update)
Similar documents based on text: More All
0.4: Parallel Two Dimensional Witness Computation - Cole, Galil, Hariharan.. (2001) (Correct)
0.2: Optimally Fast Parallel Algorithms for.. - Cole, Crochemore, .. (1993) (Correct)
0.2: The Pseudo-Period Technique in Parallel String Matching - Gasieniec (Correct)
BibTeX entry: (Update)
A. Czumaj, Z. Galil, L. G¸asieniec, K. Park, and W. Plandowski. Work-time-optimal parallel algorithms for string problems. In Proc. 27th ACM Symp. on the Theory of Computing, pages 713--722, May-June 1995. http://citeseer.ist.psu.edu/czumaj95worktimeoptimal.html More
@inproceedings{ czumaj95worktimeoptimal,
author = "Artur Czumaj and Zvi Galil and Leszek G. {\c{A}}sieniec and Kunsoo Park and Wojciech Plandowski",
title = "Work-time-optimal parallel algorithms for string problems",
pages = "713--722",
year = "1995",
url = "citeseer.ist.psu.edu/czumaj95worktimeoptimal.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: ARRAY.. (context) - Leighton - 1992
314 An Introduction to Parallel Algorithms (context) - J'aJ'a - 1992
227 Parallel merge sort (context) - Cole - 1988
94 Upper and lower time bounds for parallel random access machi.. (context) - Cook, Dwork et al. - 1986
60 Parallel permutation and sorting algorithm and a new general.. (context) - Nassimi, Sahni - 1982
56 Relations between concurrent-write models of parallel comput.. (context) - Fich, Ragde et al. - 1988
35 Two-dimensional periodicity and its applications (context) - Amir, Benson - 1992
33 time parallel string matching algorithm (context) - Breslauer, Galil et al. - 1990
30 Deterministic sampling--a new technique for fast pattern mat.. (context) - Vishkin - 1991
30 algorithm for finding all repetitions in a string (context) - Main, Lorentz et al. - 1984
26 Optimal parallel pattern matching in strings (context) - Vishkin - 1985
25 and sorting in a parallel computation model (context) - Shiloach, Vishkin et al. - 1981
24 Optimal parallel algorithms for periods (context) - Apostolico, Breslauer et al. - 1992
24 A lower bound for parallel string matching - Breslauer, Galil - 1992
16 Optimally fast parallel algorithms for preprocessing and pat.. - Cole, Crochemore et al. - 1993
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.csc.liv.ac.uk/~leszek/pub.html): More
Optimal Pattern Matching on Meshes - Chlebus, Gasieniec (1993) (Correct)
Constant-Space String Matching with Smaller Number of.. - Gasieniec.. (1995) (Correct)
Approximate Dictionary Queries - Brodal, Gasieniec (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC