Parallel fractional cascading on hypercube multiprocessors

DOI10.1016/0925-7721(92)90005-DMaRDI QIDQ1196294zbMATH OpenFDO

Authors Frank Dehne, Afonso G. Ferreira, Andrew Rau-Chaplin

Publication date 16 December 1992

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

monotone graphsdata-structuring techniquemultiple slanted range searchmultiple stabbing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• Publication:4694761
• Optimal parallel hypercube algorithms for polygon problems
• On the multisearching problem for hypercubes
• AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
• Fractional cascading. I: A data structuring technique

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 219274 (Why is no real title available?)
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Efficient piecewise-linear function approximation using the uniform metric
• Filtering Search: A New Approach to Query-Answering
• Fractional cascading. I: A data structuring technique
• Fractional cascading. II: Applications
• Parallel computational geometry

Cited in

(13)

• Lower bounds for intersection searching and fractional cascading in higher dimension
• Multisearch techniques: Parallel data structures on mesh-connected computers
• Optimal cooperative search in fractional cascaded data structures
• scientific article; zbMATH DE number 3911764 (Why is no real title available?)
• Optimal parallel hypercube algorithms for polygon problems
• Dynamic fractional cascading
• Range search in parallel using distributed data structures
• Parallel range, segment and rectangle queries with augmented maps
• On the multisearching problem for hypercubes
• An efficient permutation-based parallel algorithm for range-join in hypercubes
• scientific article; zbMATH DE number 219274 (Why is no real title available?)
• Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
• AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS

This page was built for publication: Parallel fractional cascading on hypercube multiprocessors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196294)