Albert Chan, Frank Dehne, Andrew Rau-Chaplin  Home/Search
Context Related
| 134.117.206.249:8080/www/pub...131.pdf 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: 134.117.206.249:8080/www/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper improves on op. cit. in several ways: (1) It studies the more general next element search problem which also solves, e.g., planar point location. (2) The algorithms require only O((n#p) log n) local computation instead of O(log p*(n#p) log n). (3) The algorithms require only O((n#p) log p) local memory instead of O((n#p) log n) (Update)
Cited by: More
An Architecture Independent Study of Parallel Segment Trees - Alexandros Gerbessiotis.. (Correct)
Similar documents (at the sentence level): More
73.8%: Coarse-Grained Parallel Geometric Search - Chan, Dehne, Rau-Chaplin (1999) (Correct)
7.5%: Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (Correct)
7.5%: Efficient Parallel Graph Algorithms for Coarse.. - Caceres, Dehne.. (1997) (Correct)
Active bibliography (related documents): More All
0.4: d-Dimensional Range Search on Multicomputers - Ferreira, Kenyon, Rau-Chaplin, .. (1996) (Correct)
0.2: A 2-D Parallel Convex Hull Algorithm with Optimal.. - Zhou, Deng, Dymond (Correct)
0.1: Coarse Grained Parallel Maximum Matching in Convex.. - Bose, Chan, Dehne, Latzel (1999) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
A. Chan, F. Dehne and A. Rau-Chaplin. Coarse grained parallel geometric search. Journal of Parallel and Distributed Computing, 57(2), 1999, 224-235. http://citeseer.ist.psu.edu/article/chan99coarsegrained.html More
@article{ chan99coarsegrained,
author = "Albert Chan and Frank Dehne and Andrew Rau-Chaplin",
title = "Coarse-Grained Parallel Geometric Search",
journal = "Journal of Parallel and Distributed Computing",
volume = "57",
number = "2",
pages = "224--235",
year = "1999",
url = "citeseer.ist.psu.edu/article/chan99coarsegrained.html" }
Citations (may not include all citations):1254 Computational Geometry##An Introduction (context) - Preparata, Shamos - 1985
735 A bridging model for parallel computation (context) - Valiant - 1990
234 General purpose parallel architectures (context) - Valiant - 1990
227 Parallel merge sort (context) - Cole - 1988
182 A comparison of sorting algorithms for the Connection Machin.. - Blelloch, Leiserson et al. - 1991
177 Direct bulk-synchronous parallel algorithms - Gerbessiotis, Valiant - 1992
88 Data Structures and Algorithms 3: Multi-dimensional Searchin.. (context) - Mehlhorn - 1984
75 Communication efficient parallel sorting - Goodrich - 1996
64 Scalable parallel computational geometry for coarse grained .. - Dehne, Fabri et al. - 1993
53 Parallel Computational Geometry (context) - Akl, Lyons - 1996
48 Parallel sorting by overpartitioning - Li, Sevcik - 1994
47 Scalable and architecture independent parallel geometric alg.. - Dehne, Fabri et al. - 1994
38 A Note on Coarse Grained Parallel Integer Sorting - Chan, Dehne - 1998
34 Good programming style on multiprocessors (context) - Deng, Gu - 1994
34 Efficient routing and message bounds for optimal parallel al.. (context) - Deng, Dymond - 1995
33 A comparison of shared and nonshared memory models of comput.. (context) - Anderson, Snyder - 1979
30 A convex hull algorithm for coarse grained multiprocessors (context) - Deng - 1994
25 An optimal worst case algorithm for reporting intersections .. (context) - Bentley, Wood - 1980
23 shared memory and the corollary of modest potential (context) - Snyder, architectures - 1986
15 Parallel triangulation of a polygon in two calls to the trap.. (context) - Yap - 1988
13 Scalable algorithms for bichromatic line segment intersectio.. - Devillers, Fabri - 1996
9 convex hull and triangulation for coarse grained multicomput.. (context) - Ferreira, Rau-Chaplin et al. - 1996
5 convex hull algorithm for coarse-grained parallel multicompu.. (context) - Dehne, Deng et al. - 1995
Documents on the same site (http://134.117.206.249:8080/www/publications/index.html): More
Parallel CLUSTAL W for PC Clusters - Cheetham, Dehne, Pitre.. (2003) (Correct)
"The Big Sweep": On the Power of the Wavefront Approach to.. - Dehne, Klein (1992) (Correct)
Parallel ROLAP Data Cube Construction on Shared-Nothing.. - Chen, Dehne, Al. (2004) (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