On the multisearching problem for hypercubes

DOI10.1016/0925-7721(94)00023-9zbMath0851.68021OpenAlexW2077361529MaRDI QIDQ1917039

Andreas Fabri, Mikhail J. Atallah

Publication date: 10 November 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2046&context=cstech

zbMATH Keywords

hypercubemultisearch problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer system organization (68M99)

Related Items (2)

The deterministic complexity of parallel multisearch ⋮ Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On the Number of Stable States in a NOR Network

This page was built for publication: On the multisearching problem for hypercubes