Blocking in parallel multisearch problems

DOI10.1007/S00224-001-0002-1MaRDI QIDQ5946214zbMATH OpenOpenAlexFDO

Authors W. Dittrich, D. Hutchinson, Anil Maheshwari

Publication date 4 March 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-001-0002-1

zbMATH Keywords

algorithmsexternal memory algorithmsmultisearch problems

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1424563
• scientific article; zbMATH DE number 15288
• scientific article; zbMATH DE number 1728327
• scientific article; zbMATH DE number 1102788
• scientific article; zbMATH DE number 434528
• On Parallel Searching
• A parallel algorithm for finding a blocking flow in an acyclic network
• A digraph theoretic parallelism in block methods
• Block-Cholesky for parallel processing

Cited in

(3)

• Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
• Blocking for external graph searching
• The complexity of node blocking for dags

This page was built for publication: Blocking in parallel multisearch problems

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