The complexity of parallel multisearch on coarse-grained machines

DOI10.1007/PL00008261zbMath0943.68187OpenAlexW2066981968MaRDI QIDQ1125804

Wolfgang Dittrich, Armin Bäumker, 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)

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