[{"date_updated":"2022-01-06T06:54:10Z","_id":"19727","page":"2202-2208","year":"2002","type":"conference","language":[{"iso":"eng"}],"status":"public","publication":"Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)","date_created":"2020-09-28T10:49:50Z","department":[{"_id":"63"}],"citation":{"short":"O. Bonorden, F. Meyer auf der Heide, R. Wanka, in: Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2002, pp. 2202–2208.","mla":"Bonorden, Olaf, et al. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–08.","bibtex":"@inproceedings{Bonorden_Meyer auf der Heide_Wanka_2002, title={Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example}, booktitle={Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)}, author={Bonorden, Olaf and Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2002}, pages={2202–2208} }","chicago":"Bonorden, Olaf, Friedhelm Meyer auf der Heide, and Rolf Wanka. “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example.” In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2202–8, 2002.","ieee":"O. Bonorden, F. Meyer auf der Heide, and R. Wanka, “Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example,” in <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>, 2002, pp. 2202–2208.","apa":"Bonorden, O., Meyer auf der Heide, F., &#38; Wanka, R. (2002). Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i> (pp. 2202–2208).","ama":"Bonorden O, Meyer auf der Heide F, Wanka R. Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In: <i>Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)</i>. ; 2002:2202-2208."},"user_id":"15415","title":"Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example","author":[{"last_name":"Bonorden","first_name":"Olaf","full_name":"Bonorden, Olaf"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}]}]