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

A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.

Download
No fulltext has been uploaded.
Journal Article | Published | English
Author
; ;
Publishing Year
Journal Title
Theoretical Computer Science
Page
175-203
ISSN
LibreCat-ID

Cite this

Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science. 1998:175-203. doi:10.1016/s0304-3975(98)00020-6
Bäumker, A., Dittrich, W., & Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. Theoretical Computer Science, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6
@article{Bäumker_Dittrich_Meyer auf der Heide_1998, title={Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model}, DOI={10.1016/s0304-3975(98)00020-6}, journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }
Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, 175–203. https://doi.org/10.1016/s0304-3975(98)00020-6.
A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model,” Theoretical Computer Science, pp. 175–203, 1998.
Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” Theoretical Computer Science, 1998, pp. 175–203, doi:10.1016/s0304-3975(98)00020-6.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar