Roberto Tamassia, Jeffrey Scott Vitter  Home/Search
Context Related
| brown.edu/pub/pape...perativefull.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: brown.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Fractional cascading is a technique designed to allow efficient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs along a path. In this paper we show how to preprocess a variety of fractional cascaded data structures whose underlying graph is a tree so that searching can be done efficiently in parallel. The preprocessing takes O(log n) time with n= log n processors on an EREW PRAM. For a balanced binary tree cooperative search... (Update)
Context of citations to this paper: More
.... dags and in certain fractional cascaded data structures; ffl on line filtering : A technique based on the work of Tamassia and Vitter [35] that allows I O optimal on line queries in fractional cascaded data structures based on balanced binary trees. ffl external marriage...
.... spatial point location methods for cell complexes that are applicable to 3D Voronoi diagrams: the separating surfaces method [13, 55], which extends the chain method [43] and the persistent planar location method [51] which extends the persistent search tree method [52]...
Cited by: More
Unknown - External-Memory Graph Algorithms (Correct)
External-Memory Computational Geometry (Preliminary.. - Goodrich, Tsay.. (Correct)
External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993) (Correct)
Similar documents (at the sentence level):
43.9%: Optimal Cooperative Search In Fractional Cascaded Data.. - Tamassia, Vitter (1995) (Correct)
Active bibliography (related documents): More All
0.3: Linear-Time Triangulation of a Simple Polygon Made Easier .. - Amato, Goodrich, Ramos (2000) (Correct)
0.2: A Randomized Algorithm for Triangulating a Simple Polygon .. - Amato, Goodrich, Ramos (2000) (Correct)
0.2: Computing Faces in Segment and Simplex Arrangements - Amato, Goodrich, Ramos (1995) (Correct)
Similar documents based on text: More All
0.2: Cyclic Inequivalence of Cascaded GMW-Sequences - Golomb, Gong, Dai (1998) (Correct)
0.2: Decomposition and Classification of Cascaded GMW Functions - Gong, Dai, Ye (1999) (Correct)
0.1: Cascaded Execution: Speeding Up Unparallelized.. - Anderson, Nguyen.. (1998) (Correct)
Related documents from co-citation: More All
5: Primitives for the manipulation of general subdivisions and the computation of V.. (context) - Guibas, Stolfi - 1985
4: An efficient algorithm for determining the convex hull of a finite planar set (context) - Graham - 1972
4: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
BibTeX entry: (Update)
R. Tamassia and J.S. Vitter, Optimal cooperative search in fractional cascaded data structures, in: Proc. ACM Symp. Computational Geometry (1990) 307--315. http://citeseer.ist.psu.edu/tamassia90optimal.html More
@inproceedings{ tamassia90optimal,
author = "Roberto Tamassia and Jeffrey Scott Vitter",
title = "Optimal Cooperative Search in Fractional Cascaded Data Structures",
booktitle = "{ACM} Symposium on Parallel Algorithms and Architectures",
pages = "307-316",
year = "1990",
url = "citeseer.ist.psu.edu/tamassia90optimal.html" }
Citations (may not include all citations):1254 Computational Geometry: an Introduction (context) - Preparata, Shamos - 1985
163 Optimal search in planar subdivisions (context) - Kirkpatrick - 1983
114 Optimal point location in a monotone subdivision (context) - Edelsbrunner, Guibas et al. - 1986
67 A data structuring technique (context) - Chazelle, Guibas - 1986
49 Dynamic fractional cascading (context) - Mehlhorn, Naher - 1990
48 Cascading divide-and-conquer: A technique for designing para.. (context) - Atallah, Cole et al. - 1989
45 Location of a point in a planar subdivision and its applicat.. (context) - Lee, Preparata - 1977
31 On parallel searching (context) - Snir - 1989
30 Planar separators and parallel polygon triangulation - Goodrich - 1992
25 Fractional cascading: II (context) - Chazelle, Guibas - 1986
22 Parallel transitive closure and point location in planar str.. (context) - Tamassia, Vitter - 1991
21 Randomized parallel algorithms for trapezoidal diagrams - Clarkson, Cole et al. - 1992
18 A new point-location algorithm and its practical efficiency:.. (context) - Edahiro, Kokubo et al. - 1984
15 Parallel triangulation of a polygon in two calls to the trap.. (context) - Yap - 1988
14 Triangulating a polygon in parallel (context) - Goodrich - 1989
11 How to search in history (context) - Chazelle - 1985
5 Erratum: Randomized parallel algorithms for trapezoidal diag.. (context) - Clarkson, Cole et al. - 1992
2 Cooperative subdivision search algorithms with applications (context) - Dadoun, Kirkpatrick - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jussieu.fr/~fermigie/fermivista/ftp/ftp.cs.brown.edu.html): More
Indexing for Data Models with Constraints and Classes - Kanellakis, Ramaswamy.. (1993) (Correct)
Reinforcement Learning for Planning and Control - Dean, Basye, Shewchuk (1993) (Correct)
An Interactive 3D Toolkit for Constructing 3D Widgets - Zeleznik, Herndon.. (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