AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS
From MaRDI portal
Publication:4513236
DOI10.1142/S0218195999000030zbMath1035.68522OpenAlexW2123417578MaRDI QIDQ4513236
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195999000030
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
Free lunches on the discrete Lipschitz class, On systems of equations over free partially commutative groups
Cites Work
- Parallel batched planar point location on the CCC
- Parallel triangulation of a polygon in two calls to the trapezoidal map
- Parallel computational geometry
- Parallel fractional cascading on hypercube multiprocessors
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- A Self-Routing Benes Network and Parallel Permutation Algorithms
- Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications