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

DOI10.1016/S0304-3975(98)00020-6zbMath0913.68093MaRDI QIDQ1274330

Friedhelm Meyer auf der Heide, Wolfgang Dittrich, Armin Bäumker

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsdata structuresbulk synchronous computingmultisearch

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (1)

An architecture independent study of parallel segment trees

Cites Work

• On the multisearching problem for hypercubes
• Parallel Prefix Computation
• Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
• Direct bulk-synchronous parallel algorithms
• Probability Inequalities for Sums of Bounded Random Variables
• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model