{"status":"public","language":[{"iso":"eng"}],"year":"1998","citation":{"short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, Theoretical Computer Science (1998) 175–203.","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1998). Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. <i>Theoretical Computer Science</i>, 175–203. <a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">https://doi.org/10.1016/s0304-3975(98)00020-6</a>","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model. <i>Theoretical Computer Science</i>. 1998:175-203. doi:<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>","mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP Model.” <i>Theoretical Computer Science</i>, 1998, pp. 175–203, doi:<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>.","chicago":"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.” <i>Theoretical Computer Science</i>, 1998, 175–203. <a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">https://doi.org/10.1016/s0304-3975(98)00020-6</a>.","ieee":"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,” <i>Theoretical Computer Science</i>, pp. 175–203, 1998.","bibtex":"@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={<a href=\"https://doi.org/10.1016/s0304-3975(98)00020-6\">10.1016/s0304-3975(98)00020-6</a>}, journal={Theoretical Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1998}, pages={175–203} }"},"publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","page":"175-203","user_id":"15415","publication":"Theoretical Computer Science","date_created":"2020-04-14T12:36:47Z","department":[{"_id":"63"}],"title":"Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model","author":[{"full_name":"Bäumker, Armin","last_name":"Bäumker","first_name":"Armin"},{"last_name":"Dittrich","full_name":"Dittrich, Wolfgang","first_name":"Wolfgang"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"type":"journal_article","_id":"16504","doi":"10.1016/s0304-3975(98)00020-6"}