The deterministic complexity of parallel multisearch

DOI10.1007/3-540-61422-2_149MaRDI QIDQ5054831zbMATH OpenOpenAlexFDO

Authors Andrea Pietracaprina, Armin Bäumker, W. Dittrich

Publication date 9 December 2022

Published in Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61422-2_149

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Communication complexity, information complexity (68Q11)

Recommendations

• The complexity of parallel multisearch on coarse-grained machines
• Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
• Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
• Multisearch techniques: Parallel data structures on mesh-connected computers
• d-dimensional range search on multicomputers

Cites work

• Multisearch techniques: Parallel data structures on mesh-connected computers
• On the multisearching problem for hypercubes
• Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• The complexity of deterministic PRAM simulation on distributed memory machines
• Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model

Cited in

(4)

• Анализ сложности алгоритма параллельного поиска “золотой” коллизии
• Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
• Black-box Complexity of Parallel Search with Distributed Populations
• AN IMPROVED HYPERCUBE BOUND FOR MULTISEARCHING AND ITS APPLICATIONS

This page was built for publication: The deterministic complexity of parallel multisearch

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