Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin  Home/Search
Context
Related
Links: DBLP | columbia.edu/~dany/papers...highly.ps.Z 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: columbia.edu/~dany...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ) Omer Berkman 1,4 Dany Breslauer 1,2 Zvi Galil 1,2 Baruch Schieber 3 Uzi Vishkin 1,4,5 Summary of Results. We establish that several problems are highly parallelizable. For each of these problems, we design an optimal O (loglogn ) time parallel algorithm on the Common CRCW PRAM model which is the weakest among the CRCW PRAM models. These problems include: # all nearest smaller values, # preprocessing for answering range maxima queries, # several problems in Computational Geometry,... (Update)
Active bibliography (related documents): More All
1.4: Optimal Doubly Logarithmic Parallel Algorithms Based On .. - Berkman, Schieber.. (1993) (Correct)
0.6: Structural Parallel Algorithmics - Vishkin (1991) (Correct)
0.5: A Fast Parallel Algorithm For Finding The Convex Hull Of A.. - Berkman, al. (Correct)
Similar documents based on text: More All
0.4: Heap Construction in the Parallel Comparison Tree Model - Dietz (1992) (Correct)
0.3: Fast Parallel String Prefix-Matching - Dany Breslauer (1992) (Correct)
0.2: Finding All Periods and Initial Palindromes of a String in.. - Breslauer, Galil (1995) (Correct)
BibTeX entry: (Update)
@misc{ berkman-highly,
author = "Omer Berkman and Dany Breslauer and Zvi Galil and Baruch Schieber and Uzi
Vishkin",
title = "Highly Parallelizable Problems (Extended Abstract)",
url = "citeseer.ist.psu.edu/153609.html" }
Citations (may not include all citations):201 Parallel prefix computation (context) - Ladner, Fischer - 1980 ACM DBLP
100 Optimal bounds for decision problems on the CRCW PRAM (context) - Beame, Hastad - 1987 ACM DBLP
94 Upper and lower time bounds for parallel random access machi.. (context) - Cook, Dwork et al. - 1986 ACM DBLP
75 Deterministic coin tossing with applications to optimal para.. (context) - Cole, Vishkin - 1986 ACM DBLP
62 Parallel computational geometry (context) - Aggarwal, Chazelle et al. - 1988 ACM DBLP
57 Scaling and related techniques for geometry problems (context) - Gabow, Bentley et al. - 1984 ACM DBLP
56 Relations between concurrent-write models of parallel comput.. (context) - Fich, Ragde et al. - 1988 ACM DBLP
30 Optimal parallel algorithms for string matching (context) - Galil - 1985 ACM DBLP
26 Optimal parallel pattern matching in strings (context) - Vishkin - 1985 ACM DBLP
25 Routing, merging, and sorting on parallel models of comparis.. (context) - Borodin, Hopcroft - 1985
22 Optimal preprocessing for answering on-line product queries (context) - Alon, Schieber - 1987
18 Lower bounds for parallel random access machines with unboun.. (context) - Fich, auf et al. - 1987
14 Space-time tradeoff for answering range queries (context) - Yao - 1982
14 The complexity of parallel sorting (context) - auf, Wigderson - 1985 ACM DBLP
14 Triangulating a polygon in parallel (context) - Goodrich - 1987 ACM DBLP
10 Finding all nearest neighbors for convex polygons in paralle.. (context) - Schieber, Vishkin - 1988 ACM
9 Design and analysis of some parallel algorithms (context) - Schieber - 1987
8 A unified look at data structures (context) - Vuillemin - 1980
8 Optimal parallel generation of a computation tree form (context) - Bar-On, Vishkin - 1985 ACM DBLP
7 Efficient parallel triconnectivity in logarithmic parallel t.. (context) - Ramachandran, Vishkin - 1988
7 Finding the maximum, merging and sorting in a parallel compu.. (context) - Shiloach, Vishkin - 1981 ACM DBLP
5 Parallel generation of postfix and tree forms (context) - Dekel, Sahni - 1983 ACM DBLP
5 Parallelism in comparison models (context) - Valiant - 1975
5 Some doubly logarithmic parallel algorithms based on finding.. (context) - Berkman, Schieber et al. - 1988
4 Sorting and merging in rounds (context) - Haggkvist, Hell - 1982
3 Efficient parallel solutions to geometric problems (context) - Atallah, Goodrich - 1986 DBLP
3 Searching, merging, and sorting in parallel computation (context) - Kruskal - 1983 DBLP
3 Finding the convex hull of a sorted point set in parallel (context) - Goodrich - 1987 ACM DBLP
2 Two algorithms for constructing a binary tree from its trave.. (context) - Chen, Yu et al. - 1988 ACM DBLP
2 Alternative methods for the reconstruction of trees from the.. (context) - Burgdorff, Lajodia et al. - 1987 ACM DBLP
2 Efficient parallel techniques for computational geometry (context) - Goodrich - 1987 ACM
2 An optimal O (loglogn ) time parallel string matching algori.. (context) - Breslauer, Galil - 1988
1 Optimal parallel algorithms for matching problems (context) - Kedem, Landau et al. - 1988
1 Fully and almost fully parallel algorithmic techniques (context) - Berkman, Vishkin - 1989
Documents on the same site (http://www.cs.columbia.edu/~dany/publications.html): More
Optimal Parallel Algorithms for Periods, Palindromes and.. - Apostolico, al. (1992) (Correct)
Finding All Periods and Initial Palindromes of a String in.. - Breslauer, Galil (1995) (Correct)
An On-Line String Superprimitivity Test - Breslauer (1995) (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