{"author":[{"first_name":"Armin","last_name":"Bäumker","full_name":"Bäumker, Armin"},{"first_name":"Wolfgang","full_name":"Dittrich, Wolfgang","last_name":"Dittrich"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523"},{"last_name":"Rieping","full_name":"Rieping, Ingo","first_name":"Ingo"}],"department":[{"_id":"63"}],"title":"Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model","type":"book_chapter","publication":"Lecture Notes in Computer Science","place":"Berlin, Heidelberg","date_created":"2020-08-03T13:11:02Z","user_id":"15415","doi":"10.1007/bfb0024725","_id":"17564","language":[{"iso":"eng"}],"status":"public","date_updated":"2022-01-06T06:53:15Z","page":"369-376","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540616276","9783540706366"]},"citation":{"short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.","chicago":"Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” In Lecture Notes in Computer Science, 369–76. Berlin, Heidelberg, 1996. https://doi.org/10.1007/bfb0024725.","mla":"Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” Lecture Notes in Computer Science, 1996, pp. 369–76, doi:10.1007/bfb0024725.","bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin, Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}, DOI={10.1007/bfb0024725}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376} }","ieee":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.","apa":"Bäumker, A., Dittrich, W., Meyer auf der Heide, F., & Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In Lecture Notes in Computer Science (pp. 369–376). Berlin, Heidelberg. https://doi.org/10.1007/bfb0024725","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: Lecture Notes in Computer Science. Berlin, Heidelberg; 1996:369-376. doi:10.1007/bfb0024725"},"year":"1996"}