{"page":"2202-2208","citation":{"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.","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.","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.","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).","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.","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.","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} }"},"year":"2002","date_created":"2020-09-28T10:49:50Z","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"date_updated":"2022-01-06T06:54:10Z","title":"Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example","publication":"Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA)","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"19727","language":[{"iso":"eng"}]}