The complexity of parallel multisearch on coarse-grained machines

DOI10.1007/PL00008261MaRDI QIDQ1125804zbMATH OpenOpenAlexFDO

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

Publication date 3 January 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00008261

zbMATH Keywords

coarse-grained machinesmultisearch problem

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• The deterministic complexity of parallel multisearch
• 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
• Coarse-grained parallel geometric search

Cited in

(7)

• Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
• Coarse-grained parallel geometric search
• Multisearch techniques: Parallel data structures on mesh-connected computers
• Black-box Complexity of Parallel Search with Distributed Populations
• The deterministic complexity of parallel multisearch
• Анализ сложности алгоритма параллельного поиска “золотой” коллизии
• Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model

This page was built for publication: The complexity of parallel multisearch on coarse-grained machines

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