[{"date_updated":"2022-01-06T06:53:15Z","creator":{"id":"15415","login":"koala"},"language":[{}],"place":"Berlin, Heidelberg","dc":{"rights":["info:eu-repo/semantics/closedAccess"],"language":["eng"],"type":["info:eu-repo/semantics/bookPart","doc-type:bookPart","text","http://purl.org/coar/resource_type/c_3248"],"identifier":["https://ris.uni-paderborn.de/record/17564"],"date":["1996"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1007/bfb0024725","info:eu-repo/semantics/altIdentifier/issn/0302-9743","info:eu-repo/semantics/altIdentifier/issn/1611-3349","info:eu-repo/semantics/altIdentifier/isbn/9783540616276","info:eu-repo/semantics/altIdentifier/isbn/9783540706366"],"source":["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"],"creator":["Bäumker, Armin","Dittrich, Wolfgang","Meyer auf der Heide, Friedhelm","Rieping, Ingo"],"title":["Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model"]},"department":[{"tree":[{"_id":"7"},{"_id":"34"},{"_id":"44"},{"_id":"43"}],"_id":"63"}],"publication_status":"published","dini_type":"doc-type:bookPart","publication_identifier":{"isbn":[],"issn":[]},"_id":"17564","type":"book_chapter","citation":{"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.","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.","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} }","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.","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","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."},"page":"369-376","uri_base":"https://ris.uni-paderborn.de","user_id":"15415","author":[{"first_name":"Armin","last_name":"Bäumker"},{"first_name":"Wolfgang","last_name":"Dittrich"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Ingo","last_name":"Rieping"}],"publication":"Lecture Notes in Computer Science","status":"public","date_created":"2020-08-03T13:11:02Z"}]