[{"date_created":"2018-04-05T14:48:51Z","place":"Los Alamitos, CA, USA","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","citation":{"ieee":"M. Grad and C. Plessl, “Pruning the Design Space for Just-In-Time Processor Customization,” in <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>, 2010, pp. 67–72, doi: <a href=\"https://doi.org/10.1109/ReConFig.2010.19\">10.1109/ReConFig.2010.19</a>.","apa":"Grad, M., &#38; Plessl, C. (2010). Pruning the Design Space for Just-In-Time Processor Customization. <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>, 67–72. <a href=\"https://doi.org/10.1109/ReConFig.2010.19\">https://doi.org/10.1109/ReConFig.2010.19</a>","short":"M. Grad, C. Plessl, in: Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig), IEEE Computer Society, Los Alamitos, CA, USA, 2010, pp. 67–72.","chicago":"Grad, Mariusz, and Christian Plessl. “Pruning the Design Space for Just-In-Time Processor Customization.” In <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>, 67–72. Los Alamitos, CA, USA: IEEE Computer Society, 2010. <a href=\"https://doi.org/10.1109/ReConFig.2010.19\">https://doi.org/10.1109/ReConFig.2010.19</a>.","mla":"Grad, Mariusz, and Christian Plessl. “Pruning the Design Space for Just-In-Time Processor Customization.” <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>, IEEE Computer Society, 2010, pp. 67–72, doi:<a href=\"https://doi.org/10.1109/ReConFig.2010.19\">10.1109/ReConFig.2010.19</a>.","bibtex":"@inproceedings{Grad_Plessl_2010, place={Los Alamitos, CA, USA}, title={Pruning the Design Space for Just-In-Time Processor Customization}, DOI={<a href=\"https://doi.org/10.1109/ReConFig.2010.19\">10.1109/ReConFig.2010.19</a>}, booktitle={Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)}, publisher={IEEE Computer Society}, author={Grad, Mariusz and Plessl, Christian}, year={2010}, pages={67–72} }","ama":"Grad M, Plessl C. Pruning the Design Space for Just-In-Time Processor Customization. In: <i>Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)</i>. IEEE Computer Society; 2010:67-72. doi:<a href=\"https://doi.org/10.1109/ReConFig.2010.19\">10.1109/ReConFig.2010.19</a>"},"publication":"Proc. Int. Conf. on ReConFigurable Computing and FPGAs (ReConFig)","quality_controlled":"1","_id":"2216","publisher":"IEEE Computer Society","language":[{"iso":"eng"}],"page":"67-72","user_id":"15278","doi":"10.1109/ReConFig.2010.19","author":[{"full_name":"Grad, Mariusz","first_name":"Mariusz","last_name":"Grad"},{"id":"16153","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","full_name":"Plessl, Christian"}],"status":"public","title":"Pruning the Design Space for Just-In-Time Processor Customization","year":"2010","date_updated":"2023-09-26T13:47:11Z"},{"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2018-04-05T16:28:38Z","quality_controlled":"1","citation":{"mla":"Grad, Mariusz, and Christian Plessl. “An Open Source Circuit Library with Benchmarking Facilities.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, CSREA Press, 2010, pp. 144–50.","ama":"Grad M, Plessl C. An Open Source Circuit Library with Benchmarking Facilities. In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2010:144-150.","bibtex":"@inproceedings{Grad_Plessl_2010, title={An Open Source Circuit Library with Benchmarking Facilities}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Grad, Mariusz and Plessl, Christian}, year={2010}, pages={144–150} }","apa":"Grad, M., &#38; Plessl, C. (2010). An Open Source Circuit Library with Benchmarking Facilities. <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 144–150.","ieee":"M. Grad and C. Plessl, “An Open Source Circuit Library with Benchmarking Facilities,” in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 2010, pp. 144–150.","chicago":"Grad, Mariusz, and Christian Plessl. “An Open Source Circuit Library with Benchmarking Facilities.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 144–50. CSREA Press, 2010.","short":"M. Grad, C. Plessl, in: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA), CSREA Press, 2010, pp. 144–150."},"publication":"Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)","user_id":"15278","publisher":"CSREA Press","_id":"2224","language":[{"iso":"eng"}],"page":"144-150","date_updated":"2023-09-26T13:48:59Z","author":[{"first_name":"Mariusz","last_name":"Grad","full_name":"Grad, Mariusz"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"publication_identifier":{"isbn":["1-60132-140-6"]},"year":"2010","title":"An Open Source Circuit Library with Benchmarking Facilities","status":"public"},{"status":"public","year":"2010","title":"Configurable Processor Architectures: History and Trends","publication_identifier":{"isbn":["1-60132-140-6"]},"author":[{"full_name":"Andrews, David","last_name":"Andrews","first_name":"David"},{"full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","id":"16153"}],"date_updated":"2023-09-26T13:47:33Z","page":"165","_id":"2220","publisher":"CSREA Press","language":[{"iso":"eng"}],"user_id":"15278","publication":"Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)","citation":{"bibtex":"@inproceedings{Andrews_Plessl_2010, title={Configurable Processor Architectures: History and Trends}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Andrews, David and Plessl, Christian}, year={2010}, pages={165} }","chicago":"Andrews, David, and Christian Plessl. “Configurable Processor Architectures: History and Trends.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 165. CSREA Press, 2010.","ama":"Andrews D, Plessl C. Configurable Processor Architectures: History and Trends. In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2010:165.","short":"D. Andrews, C. Plessl, in: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA), CSREA Press, 2010, p. 165.","ieee":"D. Andrews and C. Plessl, “Configurable Processor Architectures: History and Trends,” in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 2010, p. 165.","apa":"Andrews, D., &#38; Plessl, C. (2010). Configurable Processor Architectures: History and Trends. <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 165.","mla":"Andrews, David, and Christian Plessl. “Configurable Processor Architectures: History and Trends.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, CSREA Press, 2010, p. 165."},"quality_controlled":"1","date_created":"2018-04-05T14:57:07Z","type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}]},{"editor":[{"full_name":"Plaks, Toomas P.","last_name":"Plaks","first_name":"Toomas P."},{"first_name":"David","last_name":"Andrews","full_name":"Andrews, David"},{"last_name":"DeMara","first_name":"Ronald","full_name":"DeMara, Ronald"},{"full_name":"Lam, Herman","last_name":"Lam","first_name":"Herman"},{"first_name":"Jooheung","last_name":"Lee","full_name":"Lee, Jooheung"},{"id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian"},{"first_name":"Greg","last_name":"Stitt","full_name":"Stitt, Greg"}],"user_id":"15278","language":[{"iso":"eng"}],"_id":"2222","publisher":"CSREA Press","date_updated":"2023-09-26T13:48:00Z","publication_identifier":{"isbn":["1-60132-140-6"]},"title":"Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)","year":"2010","status":"public","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference_editor","date_created":"2018-04-05T15:00:49Z","quality_controlled":"1","citation":{"ieee":"T. P. Plaks <i>et al.</i>, Eds., <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press, 2010.","apa":"Plaks, T. P., Andrews, D., DeMara, R., Lam, H., Lee, J., Plessl, C., &#38; Stitt, G. (Eds.). (2010). <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press.","short":"T.P. Plaks, D. Andrews, R. DeMara, H. Lam, J. Lee, C. Plessl, G. Stitt, eds., Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA), CSREA Press, 2010.","chicago":"Plaks, Toomas P., David Andrews, Ronald DeMara, Herman Lam, Jooheung Lee, Christian Plessl, and Greg Stitt, eds. <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press, 2010.","mla":"Plaks, Toomas P., et al., editors. <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press, 2010.","bibtex":"@book{Plaks_Andrews_DeMara_Lam_Lee_Plessl_Stitt_2010, title={Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA Press}, year={2010} }","ama":"Plaks TP, Andrews D, DeMara R, et al., eds. <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2010."}},{"publication_identifier":{"isbn":["978-1-4244-6965-9"]},"author":[{"full_name":"Beisel, Tobias","first_name":"Tobias","last_name":"Beisel"},{"full_name":"Niekamp, Manuel","first_name":"Manuel","last_name":"Niekamp"},{"full_name":"Plessl, Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","id":"16153"}],"status":"public","title":"Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators","year":"2010","date_updated":"2023-09-26T13:49:21Z","_id":"2226","language":[{"iso":"eng"}],"publisher":"IEEE Computer Society","page":"65-72","doi":"10.1109/ASAP.2010.5540798","user_id":"15278","citation":{"bibtex":"@inproceedings{Beisel_Niekamp_Plessl_2010, title={Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators}, DOI={<a href=\"https://doi.org/10.1109/ASAP.2010.5540798\">10.1109/ASAP.2010.5540798</a>}, booktitle={Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)}, publisher={IEEE Computer Society}, author={Beisel, Tobias and Niekamp, Manuel and Plessl, Christian}, year={2010}, pages={65–72} }","chicago":"Beisel, Tobias, Manuel Niekamp, and Christian Plessl. “Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators.” In <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 65–72. IEEE Computer Society, 2010. <a href=\"https://doi.org/10.1109/ASAP.2010.5540798\">https://doi.org/10.1109/ASAP.2010.5540798</a>.","ama":"Beisel T, Niekamp M, Plessl C. Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators. In: <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>. IEEE Computer Society; 2010:65-72. doi:<a href=\"https://doi.org/10.1109/ASAP.2010.5540798\">10.1109/ASAP.2010.5540798</a>","short":"T. Beisel, M. Niekamp, C. Plessl, in: Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP), IEEE Computer Society, 2010, pp. 65–72.","ieee":"T. Beisel, M. Niekamp, and C. Plessl, “Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators,” in <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 2010, pp. 65–72, doi: <a href=\"https://doi.org/10.1109/ASAP.2010.5540798\">10.1109/ASAP.2010.5540798</a>.","apa":"Beisel, T., Niekamp, M., &#38; Plessl, C. (2010). Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators. <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, 65–72. <a href=\"https://doi.org/10.1109/ASAP.2010.5540798\">https://doi.org/10.1109/ASAP.2010.5540798</a>","mla":"Beisel, Tobias, et al. “Using Shared Library Interposing for Transparent Acceleration in Systems with Heterogeneous Hardware Accelerators.” <i>Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)</i>, IEEE Computer Society, 2010, pp. 65–72, doi:<a href=\"https://doi.org/10.1109/ASAP.2010.5540798\">10.1109/ASAP.2010.5540798</a>."},"publication":"Proc. Int. Conf. on Application-Specific Systems, Architectures, and Processors (ASAP)","quality_controlled":"1","date_created":"2018-04-05T16:39:34Z","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference"},{"date_updated":"2023-09-26T13:51:00Z","publication_identifier":{"isbn":["978-1-4244-8864-3"]},"author":[{"last_name":"Keller","first_name":"Ariane","full_name":"Keller, Ariane"},{"full_name":"Plattner, Bernhard","last_name":"Plattner","first_name":"Bernhard"},{"full_name":"Lübbers, Enno","last_name":"Lübbers","first_name":"Enno"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"},{"id":"16153","first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian"}],"status":"public","year":"2010","title":"Reconfigurable Nodes for Future Networks","doi":"10.1109/GLOCOMW.2010.5700341","user_id":"15278","_id":"2206","publisher":"IEEE","language":[{"iso":"eng"}],"page":"372-376","quality_controlled":"1","citation":{"chicago":"Keller, Ariane, Bernhard Plattner, Enno Lübbers, Marco Platzner, and Christian Plessl. “Reconfigurable Nodes for Future Networks.” In <i>Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)</i>, 372–76. IEEE, 2010. <a href=\"https://doi.org/10.1109/GLOCOMW.2010.5700341\">https://doi.org/10.1109/GLOCOMW.2010.5700341</a>.","ama":"Keller A, Plattner B, Lübbers E, Platzner M, Plessl C. Reconfigurable Nodes for Future Networks. In: <i>Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)</i>. IEEE; 2010:372-376. doi:<a href=\"https://doi.org/10.1109/GLOCOMW.2010.5700341\">10.1109/GLOCOMW.2010.5700341</a>","short":"A. Keller, B. Plattner, E. Lübbers, M. Platzner, C. Plessl, in: Proc. IEEE Globecom Workshop on Network of the Future (FutureNet), IEEE, 2010, pp. 372–376.","bibtex":"@inproceedings{Keller_Plattner_Lübbers_Platzner_Plessl_2010, title={Reconfigurable Nodes for Future Networks}, DOI={<a href=\"https://doi.org/10.1109/GLOCOMW.2010.5700341\">10.1109/GLOCOMW.2010.5700341</a>}, booktitle={Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)}, publisher={IEEE}, author={Keller, Ariane and Plattner, Bernhard and Lübbers, Enno and Platzner, Marco and Plessl, Christian}, year={2010}, pages={372–376} }","mla":"Keller, Ariane, et al. “Reconfigurable Nodes for Future Networks.” <i>Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)</i>, IEEE, 2010, pp. 372–76, doi:<a href=\"https://doi.org/10.1109/GLOCOMW.2010.5700341\">10.1109/GLOCOMW.2010.5700341</a>.","apa":"Keller, A., Plattner, B., Lübbers, E., Platzner, M., &#38; Plessl, C. (2010). Reconfigurable Nodes for Future Networks. <i>Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)</i>, 372–376. <a href=\"https://doi.org/10.1109/GLOCOMW.2010.5700341\">https://doi.org/10.1109/GLOCOMW.2010.5700341</a>","ieee":"A. Keller, B. Plattner, E. Lübbers, M. Platzner, and C. Plessl, “Reconfigurable Nodes for Future Networks,” in <i>Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)</i>, 2010, pp. 372–376, doi: <a href=\"https://doi.org/10.1109/GLOCOMW.2010.5700341\">10.1109/GLOCOMW.2010.5700341</a>."},"publication":"Proc. IEEE Globecom Workshop on Network of the Future (FutureNet)","department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2018-04-04T09:36:16Z"},{"year":"2010","title":"Rupeas: Ruby Powered Event Analysis DSL","status":"public","author":[{"first_name":"Matthias","last_name":"Woehrle","full_name":"Woehrle, Matthias"},{"full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","id":"16153"},{"full_name":"Thiele, Lothar","first_name":"Lothar","last_name":"Thiele"}],"publication_identifier":{"isbn":["978-1-4244-7911-5"]},"date_updated":"2023-09-26T13:49:38Z","page":"245-248","_id":"2227","language":[{"iso":"eng"}],"publisher":"IEEE","doi":"10.1109/INSS.2010.5572211","user_id":"15278","publication":"Proc. Int. Conf. Networked Sensing Systems (INSS)","citation":{"chicago":"Woehrle, Matthias, Christian Plessl, and Lothar Thiele. “Rupeas: Ruby Powered Event Analysis DSL.” In <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>, 245–48. IEEE, 2010. <a href=\"https://doi.org/10.1109/INSS.2010.5572211\">https://doi.org/10.1109/INSS.2010.5572211</a>.","short":"M. Woehrle, C. Plessl, L. Thiele, in: Proc. Int. Conf. Networked Sensing Systems (INSS), IEEE, 2010, pp. 245–248.","ieee":"M. Woehrle, C. Plessl, and L. Thiele, “Rupeas: Ruby Powered Event Analysis DSL,” in <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>, 2010, pp. 245–248, doi: <a href=\"https://doi.org/10.1109/INSS.2010.5572211\">10.1109/INSS.2010.5572211</a>.","apa":"Woehrle, M., Plessl, C., &#38; Thiele, L. (2010). Rupeas: Ruby Powered Event Analysis DSL. <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>, 245–248. <a href=\"https://doi.org/10.1109/INSS.2010.5572211\">https://doi.org/10.1109/INSS.2010.5572211</a>","bibtex":"@inproceedings{Woehrle_Plessl_Thiele_2010, title={Rupeas: Ruby Powered Event Analysis DSL}, DOI={<a href=\"https://doi.org/10.1109/INSS.2010.5572211\">10.1109/INSS.2010.5572211</a>}, booktitle={Proc. Int. Conf. Networked Sensing Systems (INSS)}, publisher={IEEE}, author={Woehrle, Matthias and Plessl, Christian and Thiele, Lothar}, year={2010}, pages={245–248} }","ama":"Woehrle M, Plessl C, Thiele L. Rupeas: Ruby Powered Event Analysis DSL. In: <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>. IEEE; 2010:245-248. doi:<a href=\"https://doi.org/10.1109/INSS.2010.5572211\">10.1109/INSS.2010.5572211</a>","mla":"Woehrle, Matthias, et al. “Rupeas: Ruby Powered Event Analysis DSL.” <i>Proc. Int. Conf. Networked Sensing Systems (INSS)</i>, IEEE, 2010, pp. 245–48, doi:<a href=\"https://doi.org/10.1109/INSS.2010.5572211\">10.1109/INSS.2010.5572211</a>."},"quality_controlled":"1","extern":"1","date_created":"2018-04-05T16:41:02Z","type":"conference","department":[{"_id":"27"},{"_id":"518"}]},{"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"conference","date_created":"2018-04-05T16:43:04Z","quality_controlled":"1","citation":{"chicago":"Kenter, Tobias, Marco Platzner, Christian Plessl, and Michael Kauschke. “Performance Estimation for the Exploration of CPU-Accelerator Architectures.” In <i>Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)</i>, edited by Omar Hammami and Sandra Larrabee, 2010.","short":"T. Kenter, M. Platzner, C. Plessl, M. Kauschke, in: O. Hammami, S. Larrabee (Eds.), Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA), 2010.","apa":"Kenter, T., Platzner, M., Plessl, C., &#38; Kauschke, M. (2010). Performance Estimation for the Exploration of CPU-Accelerator Architectures. In O. Hammami &#38; S. Larrabee (Eds.), <i>Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)</i>.","ieee":"T. Kenter, M. Platzner, C. Plessl, and M. Kauschke, “Performance Estimation for the Exploration of CPU-Accelerator Architectures,” in <i>Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)</i>, 2010.","ama":"Kenter T, Platzner M, Plessl C, Kauschke M. Performance Estimation for the Exploration of CPU-Accelerator Architectures. In: Hammami O, Larrabee S, eds. <i>Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)</i>. ; 2010.","bibtex":"@inproceedings{Kenter_Platzner_Plessl_Kauschke_2010, title={Performance Estimation for the Exploration of CPU-Accelerator Architectures}, booktitle={Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)}, author={Kenter, Tobias and Platzner, Marco and Plessl, Christian and Kauschke, Michael}, editor={Hammami, Omar and Larrabee, Sandra}, year={2010} }","mla":"Kenter, Tobias, et al. “Performance Estimation for the Exploration of CPU-Accelerator Architectures.” <i>Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)</i>, edited by Omar Hammami and Sandra Larrabee, 2010."},"publication":"Proc. Workshop on Architectural Research Prototyping (WARP), International Symposium on Computer Architecture (ISCA)","editor":[{"first_name":"Omar","last_name":"Hammami","full_name":"Hammami, Omar"},{"first_name":"Sandra","last_name":"Larrabee","full_name":"Larrabee, Sandra"}],"user_id":"15278","language":[{"iso":"eng"}],"_id":"2228","date_updated":"2023-09-26T13:50:04Z","author":[{"id":"3145","first_name":"Tobias","last_name":"Kenter","full_name":"Kenter, Tobias"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian","full_name":"Plessl, Christian","id":"16153"},{"last_name":"Kauschke","first_name":"Michael","full_name":"Kauschke, Michael"}],"title":"Performance Estimation for the Exploration of CPU-Accelerator Architectures","year":"2010","status":"public"},{"language":[{"iso":"eng"}],"doi":"10.1111/j.1467-8659.2009.01609.x","title":"Exact and Robust (Self‐)Intersections for Polygonal Meshes","year":"2010","author":[{"id":"114904","full_name":"Campen, Marcel","last_name":"Campen","first_name":"Marcel","orcid":"0000-0003-2340-3462"},{"first_name":"Leif","last_name":"Kobbelt","full_name":"Kobbelt, Leif"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]},"publication_status":"published","date_updated":"2025-07-14T12:35:44Z","intvolume":"        29","date_created":"2025-06-30T08:24:08Z","type":"journal_article","department":[{"_id":"969"}],"issue":"2","publication":"Computer Graphics Forum","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self‐intersections. Depending on the modification strategy, this effectively results in operators for Boolean combinations or for the construction of outer hulls that are suited for mesh repair tasks and accurate mesh‐based front tracking of deformable materials that split and merge. By combining an adaptive octree with nested binary space partitions (BSP), we can guarantee exactness (= correctness) and robustness (= completeness) of the algorithm while still achieving higher performance and less memory consumption than previous approaches. The efficiency and scalability in terms of runtime and memory is obtained by an operation localization scheme. We restrict the essential computations to those cells in the adaptive octree where intersections actually occur. Within those critical cells, we convert the input geometry into a plane‐based BSP‐representation which allows us to perform all computations exactly even with fixed precision arithmetics. We carefully analyze the precision requirements of the involved geometric data and predicates in order to guarantee correctness and show how minimal input mesh quantization can be used to safely rely on computations with standard floating point numbers. We properly evaluate our method with respect to precision, robustness, and efficiency.</jats:p>","lang":"eng"}],"page":"397-406","_id":"60463","publisher":"Wiley","user_id":"117512","volume":29,"status":"public","citation":{"bibtex":"@article{Campen_Kobbelt_2010, title={Exact and Robust (Self‐)Intersections for Polygonal Meshes}, volume={29}, DOI={<a href=\"https://doi.org/10.1111/j.1467-8659.2009.01609.x\">10.1111/j.1467-8659.2009.01609.x</a>}, number={2}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Campen, Marcel and Kobbelt, Leif}, year={2010}, pages={397–406} }","chicago":"Campen, Marcel, and Leif Kobbelt. “Exact and Robust (Self‐)Intersections for Polygonal Meshes.” <i>Computer Graphics Forum</i> 29, no. 2 (2010): 397–406. <a href=\"https://doi.org/10.1111/j.1467-8659.2009.01609.x\">https://doi.org/10.1111/j.1467-8659.2009.01609.x</a>.","ama":"Campen M, Kobbelt L. Exact and Robust (Self‐)Intersections for Polygonal Meshes. <i>Computer Graphics Forum</i>. 2010;29(2):397-406. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2009.01609.x\">10.1111/j.1467-8659.2009.01609.x</a>","short":"M. Campen, L. Kobbelt, Computer Graphics Forum 29 (2010) 397–406.","ieee":"M. Campen and L. Kobbelt, “Exact and Robust (Self‐)Intersections for Polygonal Meshes,” <i>Computer Graphics Forum</i>, vol. 29, no. 2, pp. 397–406, 2010, doi: <a href=\"https://doi.org/10.1111/j.1467-8659.2009.01609.x\">10.1111/j.1467-8659.2009.01609.x</a>.","apa":"Campen, M., &#38; Kobbelt, L. (2010). Exact and Robust (Self‐)Intersections for Polygonal Meshes. <i>Computer Graphics Forum</i>, <i>29</i>(2), 397–406. <a href=\"https://doi.org/10.1111/j.1467-8659.2009.01609.x\">https://doi.org/10.1111/j.1467-8659.2009.01609.x</a>","mla":"Campen, Marcel, and Leif Kobbelt. “Exact and Robust (Self‐)Intersections for Polygonal Meshes.” <i>Computer Graphics Forum</i>, vol. 29, no. 2, Wiley, 2010, pp. 397–406, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2009.01609.x\">10.1111/j.1467-8659.2009.01609.x</a>."}},{"intvolume":"        29","publication_status":"published","date_updated":"2025-07-14T12:35:40Z","publication_identifier":{"issn":["0167-7055","1467-8659"]},"author":[{"last_name":"Campen","orcid":"0000-0003-2340-3462","first_name":"Marcel","full_name":"Campen, Marcel","id":"114904"},{"last_name":"Kobbelt","first_name":"Leif","full_name":"Kobbelt, Leif"}],"year":"2010","title":"Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes","doi":"10.1111/j.1467-8659.2010.01770.x","language":[{"iso":"eng"}],"extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Minkowski addition, offsetting, and sweeping along a discrete rigid motion trajectory. Many previous methods focus on the construction of a polygonal superset (containing self‐intersections and spurious internal geometry) of the boundary of the volumes which are swept. Only few are able to determine a clean representation of the actual boundary, most of them in a discrete volumetric setting. We unify such superset constructions into a succinct common formulation and present a technique for the robust extraction of a polygonal mesh representing the outer boundary, i.e. it makes no general position assumptions and always yields a manifold, watertight mesh. It is exact for Minkowski sums and approximates swept volumes polygonally. By using plane‐based geometry in conjunction with hierarchical arrangement computations we avoid the necessity of arbitrary precision arithmetics and extensive special case handling. By restricting operations to regions containing pieces of the boundary, we significantly enhance the performance of the algorithm.</jats:p>","lang":"eng"}],"publication":"Computer Graphics Forum","issue":"5","department":[{"_id":"969"}],"type":"journal_article","date_created":"2025-06-30T08:34:20Z","status":"public","volume":29,"user_id":"117512","_id":"60464","publisher":"Wiley","page":"1613-1622","citation":{"bibtex":"@article{Campen_Kobbelt_2010, title={Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes}, volume={29}, DOI={<a href=\"https://doi.org/10.1111/j.1467-8659.2010.01770.x\">10.1111/j.1467-8659.2010.01770.x</a>}, number={5}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Campen, Marcel and Kobbelt, Leif}, year={2010}, pages={1613–1622} }","short":"M. Campen, L. Kobbelt, Computer Graphics Forum 29 (2010) 1613–1622.","ama":"Campen M, Kobbelt L. Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes. <i>Computer Graphics Forum</i>. 2010;29(5):1613-1622. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2010.01770.x\">10.1111/j.1467-8659.2010.01770.x</a>","chicago":"Campen, Marcel, and Leif Kobbelt. “Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes.” <i>Computer Graphics Forum</i> 29, no. 5 (2010): 1613–22. <a href=\"https://doi.org/10.1111/j.1467-8659.2010.01770.x\">https://doi.org/10.1111/j.1467-8659.2010.01770.x</a>.","ieee":"M. Campen and L. Kobbelt, “Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes,” <i>Computer Graphics Forum</i>, vol. 29, no. 5, pp. 1613–1622, 2010, doi: <a href=\"https://doi.org/10.1111/j.1467-8659.2010.01770.x\">10.1111/j.1467-8659.2010.01770.x</a>.","mla":"Campen, Marcel, and Leif Kobbelt. “Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes.” <i>Computer Graphics Forum</i>, vol. 29, no. 5, Wiley, 2010, pp. 1613–22, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2010.01770.x\">10.1111/j.1467-8659.2010.01770.x</a>.","apa":"Campen, M., &#38; Kobbelt, L. (2010). Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes. <i>Computer Graphics Forum</i>, <i>29</i>(5), 1613–1622. <a href=\"https://doi.org/10.1111/j.1467-8659.2010.01770.x\">https://doi.org/10.1111/j.1467-8659.2010.01770.x</a>"}},{"citation":{"bibtex":"@article{Pavić_Campen_Kobbelt_2010, title={Hybrid Booleans}, volume={29}, DOI={<a href=\"https://doi.org/10.1111/j.1467-8659.2009.01545.x\">10.1111/j.1467-8659.2009.01545.x</a>}, number={1}, journal={Computer Graphics Forum}, publisher={Wiley}, author={Pavić, Darko and Campen, Marcel and Kobbelt, Leif}, year={2010}, pages={75–87} }","ama":"Pavić D, Campen M, Kobbelt L. Hybrid Booleans. <i>Computer Graphics Forum</i>. 2010;29(1):75-87. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2009.01545.x\">10.1111/j.1467-8659.2009.01545.x</a>","short":"D. Pavić, M. Campen, L. Kobbelt, Computer Graphics Forum 29 (2010) 75–87.","chicago":"Pavić, Darko, Marcel Campen, and Leif Kobbelt. “Hybrid Booleans.” <i>Computer Graphics Forum</i> 29, no. 1 (2010): 75–87. <a href=\"https://doi.org/10.1111/j.1467-8659.2009.01545.x\">https://doi.org/10.1111/j.1467-8659.2009.01545.x</a>.","ieee":"D. Pavić, M. Campen, and L. Kobbelt, “Hybrid Booleans,” <i>Computer Graphics Forum</i>, vol. 29, no. 1, pp. 75–87, 2010, doi: <a href=\"https://doi.org/10.1111/j.1467-8659.2009.01545.x\">10.1111/j.1467-8659.2009.01545.x</a>.","apa":"Pavić, D., Campen, M., &#38; Kobbelt, L. (2010). Hybrid Booleans. <i>Computer Graphics Forum</i>, <i>29</i>(1), 75–87. <a href=\"https://doi.org/10.1111/j.1467-8659.2009.01545.x\">https://doi.org/10.1111/j.1467-8659.2009.01545.x</a>","mla":"Pavić, Darko, et al. “Hybrid Booleans.” <i>Computer Graphics Forum</i>, vol. 29, no. 1, Wiley, 2010, pp. 75–87, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2009.01545.x\">10.1111/j.1467-8659.2009.01545.x</a>."},"status":"public","page":"75-87","_id":"60462","publisher":"Wiley","user_id":"117512","volume":29,"publication":"Computer Graphics Forum","issue":"1","extern":"1","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p> <jats:italic>In this paper, we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new features appearing along the intersections of the input meshes. The term “hybrid” applies to our method in two ways: First, our algorithm operates on a hybrid data structure which stores the original input polygons (surface data) in an adaptively refined octree (volume data). By this we combine the robustness of volumetric techniques with the accuracy of surface‐oriented techniques. Second, we generate a new triangulation only in a close vicinity around the intersections of the input meshes and thus preserve as much of the original mesh structure as possible (hybrid mesh). Since the actual processing of the Boolean operation is confined to a very small region around the intersections of the input meshes, we can achieve very high adaptive refinement resolutions and hence very high precision. We demonstrate our method on a number of challenging examples.</jats:italic> </jats:p>"}],"date_created":"2025-06-30T08:22:33Z","type":"journal_article","department":[{"_id":"969"}],"title":"Hybrid Booleans","year":"2010","author":[{"full_name":"Pavić, Darko","first_name":"Darko","last_name":"Pavić"},{"last_name":"Campen","first_name":"Marcel","orcid":"0000-0003-2340-3462","full_name":"Campen, Marcel","id":"114904"},{"first_name":"Leif","last_name":"Kobbelt","full_name":"Kobbelt, Leif"}],"publication_identifier":{"issn":["0167-7055","1467-8659"]},"publication_status":"published","date_updated":"2025-07-14T12:35:48Z","intvolume":"        29","language":[{"iso":"eng"}],"doi":"10.1111/j.1467-8659.2009.01545.x"},{"intvolume":"       261","date_updated":"2022-01-06T06:54:07Z","author":[{"full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina","last_name":"Lürwer-Brüggemeier"}],"status":"public","year":"2009","title":"Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division","volume":261,"user_id":"5786","_id":"19605","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090212010"}]},"citation":{"bibtex":"@book{Lürwer-Brüggemeier_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division}, volume={261}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Lürwer-Brüggemeier, Katharina}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Lürwer-Brüggemeier K. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Vol 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","short":"K. Lürwer-Brüggemeier, Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Vol. 261. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ieee":"K. Lürwer-Brüggemeier, <i>Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division</i>, vol. 261. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","mla":"Lürwer-Brüggemeier, Katharina. <i>Mächtigkeit Und Komplexität von Berechnungen Mit Der Ganzzahligen Division</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Lürwer-Brüggemeier, K. (2009). <i>Mächtigkeit und Komplexität von Berechnungen mit der ganzzahligen Division</i> (Vol. 261). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","date_created":"2020-09-21T14:07:23Z"},{"_id":"19614","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":260,"title":"On Fault-Tolerant Data Placement in Storage Networks","year":"2009","status":"public","author":[{"full_name":"Mense, Mario","first_name":"Mario","last_name":"Mense"}],"publication_identifier":{"isbn":["978-3-939350-79-8"]},"date_updated":"2022-01-06T06:54:08Z","intvolume":"       260","date_created":"2020-09-22T08:05:15Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"citation":{"mla":"Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Mense M. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Vol 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","bibtex":"@book{Mense_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={On Fault-Tolerant Data Placement in Storage Networks}, volume={260}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mense, Mario}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Mense, M. (2009). <i>On Fault-Tolerant Data Placement in Storage Networks</i> (Vol. 260). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"M. Mense, <i>On Fault-Tolerant Data Placement in Storage Networks</i>, vol. 260. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"M. Mense, On Fault-Tolerant Data Placement in Storage Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Mense, Mario. <i>On Fault-Tolerant Data Placement in Storage Networks</i>. Vol. 260. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20090206016","relation":"confirmation"}]}},{"year":"2009","title":"Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes","status":"public","author":[{"last_name":"Kortenjan","first_name":"Michael","full_name":"Kortenjan, Michael"}],"publication_identifier":{"isbn":["978-3-939350-77-4"]},"date_updated":"2022-01-06T06:54:08Z","intvolume":"       258","_id":"19617","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","volume":258,"citation":{"mla":"Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","bibtex":"@book{Kortenjan_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes}, volume={258}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kortenjan, Michael}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Kortenjan M. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Vol 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","ieee":"M. Kortenjan, <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>, vol. 258. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Kortenjan, M. (2009). <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i> (Vol. 258). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","short":"M. Kortenjan, Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Kortenjan, Michael. <i>Size Equivalent Cluster Trees - Rendering CAD Models in Industrial Scenes</i>. Vol. 258. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20081218010"}]},"date_created":"2020-09-22T08:42:22Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}]},{"_id":"19618","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":257,"user_id":"5786","publication_identifier":{"isbn":["978-3-939350-76-7"]},"author":[{"full_name":"Bonorden, Olaf","last_name":"Bonorden","first_name":"Olaf"}],"year":"2009","title":"Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip","status":"public","intvolume":"       257","date_updated":"2022-01-06T06:54:08Z","date_created":"2020-09-22T08:44:45Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","citation":{"ama":"Bonorden O. <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>. Vol 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009.","bibtex":"@book{Bonorden_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip}, volume={257}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Bonorden, Olaf}, year={2009}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Bonorden, Olaf. <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","chicago":"Bonorden, Olaf. <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>. Vol. 257. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","short":"O. Bonorden, Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","apa":"Bonorden, O. (2009). <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i> (Vol. 257). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"O. Bonorden, <i>Versatility of Bulk Synchronous Parallel Computing: From the Heterogeneous Cluster to the System on Chip</i>, vol. 257. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20080623016"}]}},{"has_accepted_license":"1","date_updated":"2022-01-06T06:54:10Z","author":[{"full_name":"Bonorden, Olaf","first_name":"Olaf","last_name":"Bonorden"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"}],"status":"public","title":"Complexity and approximation of a geometric local robot assignment problem","year":"2009","ddc":["000"],"user_id":"15415","_id":"19722","language":[{"iso":"eng"}],"citation":{"ama":"Bonorden O, Degener B, Pietrzyk P, Kempkes B. <i>Complexity and Approximation of a Geometric Local Robot Assignment Problem</i>.; 2009.","bibtex":"@book{Bonorden_Degener_Pietrzyk_Kempkes_2009, title={Complexity and approximation of a geometric local robot assignment problem}, author={Bonorden, Olaf and Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2009} }","mla":"Bonorden, Olaf, et al. <i>Complexity and Approximation of a Geometric Local Robot Assignment Problem</i>. 2009.","chicago":"Bonorden, Olaf, Bastian Degener, Peter Pietrzyk, and Barbara Kempkes. <i>Complexity and Approximation of a Geometric Local Robot Assignment Problem</i>, 2009.","short":"O. Bonorden, B. Degener, P. Pietrzyk, B. Kempkes, Complexity and Approximation of a Geometric Local Robot Assignment Problem, 2009.","apa":"Bonorden, O., Degener, B., Pietrzyk, P., &#38; Kempkes, B. (2009). <i>Complexity and approximation of a geometric local robot assignment problem</i>.","ieee":"O. Bonorden, B. Degener, P. Pietrzyk, and B. Kempkes, <i>Complexity and approximation of a geometric local robot assignment problem</i>. 2009."},"file_date_updated":"2020-09-28T10:19:26Z","department":[{"_id":"63"}],"type":"report","date_created":"2020-09-28T10:19:43Z","file":[{"file_name":"pub-hni-3956.pdf","access_level":"closed","file_size":258114,"relation":"main_file","date_updated":"2020-09-28T10:19:26Z","file_id":"19723","success":1,"content_type":"application/pdf","creator":"koala","date_created":"2020-09-28T10:19:26Z"}]},{"date_created":"2020-09-28T10:25:34Z","department":[{"_id":"63"}],"type":"book_chapter","publication":"Algorithmic Aspects of Wireless Sensor Networks","abstract":[{"lang":"eng","text":"We introduce a geometric multi-robot assignment problem. Robots positioned in a Euclidean space have to be assigned to treasures in such a way that their joint strength is sufficient to unearth a treasure with a given weight. The robots have a limited range and thus can only be assigned to treasures in their proximity. The objective is to unearth as many treasures as possible. We investigate the complexity of several variants of this problem and show whether they are in $\\classP$ or are $\\classNP$-complete. Furthermore, we provide a distributed and local constant-factor approximation algorithm using constant-factor resource augmentation for the two-dimensional setting with $\\bigO(\\log^*n)$ communication rounds."}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-05434-1_25","publication_identifier":{"isbn":["9783642054334","9783642054341"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"last_name":"Pietrzyk","first_name":"Peter","full_name":"Pietrzyk, Peter"}],"title":"Complexity and Approximation of a Geometric Local Robot Assignment Problem","year":"2009","publication_status":"published","date_updated":"2022-01-06T06:54:10Z","place":"Berlin, Heidelberg","citation":{"short":"O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.","chicago":"Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” In <i>Algorithmic Aspects of Wireless Sensor Networks</i>, 252–62. Berlin, Heidelberg: Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>.","apa":"Bonorden, O., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In <i>Algorithmic Aspects of Wireless Sensor Networks</i> (pp. 252–262). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">https://doi.org/10.1007/978-3-642-05434-1_25</a>","ieee":"O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Berlin, Heidelberg: Springer, 2009, pp. 252–262.","ama":"Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation of a Geometric Local Robot Assignment Problem. In: <i>Algorithmic Aspects of Wireless Sensor Networks</i>. Berlin, Heidelberg: Springer; 2009:252-262. doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>","bibtex":"@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg}, title={Complexity and Approximation of a Geometric Local Robot Assignment Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>}, booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer}, author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk, Peter}, year={2009}, pages={252–262} }","mla":"Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.” <i>Algorithmic Aspects of Wireless Sensor Networks</i>, Springer, 2009, pp. 252–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-05434-1_25\">10.1007/978-3-642-05434-1_25</a>."},"_id":"19724","publisher":"Springer","page":"252-262","user_id":"15415","status":"public"},{"abstract":[{"text":"Categorizing peer-to-peer networks from an algorithmic point of view the two extremes of the spectrum are unstructured networks and networks based on plain distributed hash tables (DHT). Unstructured networks stand out with their simplicity, robustness, and support for complex queries. Though, they lack efficient query algorithms providing guarantees. On the other hand, DHT based networks feature efficient lookup algorithms with typically logarithmic hop distance and provide simple and efficient load balancing. Yet, they are limited to exact match queries and in many cases hard to maintain under churn.","lang":"eng"}],"file_date_updated":"2020-10-01T09:47:33Z","citation":{"chicago":"Schindelhauer, Christian, Peter Mahlmann, and Thomas Janson. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","ama":"Schindelhauer C, Mahlmann P, Janson T. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany; 2009.","short":"C. Schindelhauer, P. Mahlmann, T. Janson, 3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs, Paderborn, Germany, 2009.","bibtex":"@book{Schindelhauer_Mahlmann_Janson_2009, title={3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, publisher={Paderborn, Germany}, author={Schindelhauer, Christian and Mahlmann, Peter and Janson, Thomas}, year={2009} }","mla":"Schindelhauer, Christian, et al. <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009.","apa":"Schindelhauer, C., Mahlmann, P., &#38; Janson, T. (2009). <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany.","ieee":"C. Schindelhauer, P. Mahlmann, and T. Janson, <i>3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs</i>. Paderborn, Germany, 2009."},"type":"report","department":[{"_id":"63"}],"file":[{"creator":"koala","date_created":"2020-10-01T09:47:33Z","file_name":"pub-hni-4130.pdf","access_level":"closed","file_size":753215,"relation":"main_file","date_updated":"2020-10-01T09:47:33Z","file_id":"19826","success":1,"content_type":"application/pdf"}],"date_created":"2020-10-01T09:47:54Z","date_updated":"2022-01-06T06:54:13Z","has_accepted_license":"1","title":"3nuts: A Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","status":"public","year":"2009","author":[{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"},{"full_name":"Mahlmann, Peter","last_name":"Mahlmann","first_name":"Peter"},{"first_name":"Thomas","last_name":"Janson","full_name":"Janson, Thomas"}],"ddc":["000"],"user_id":"15415","publisher":"Paderborn, Germany","_id":"19825","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"19830","page":"309-321","user_id":"15415","doi":"10.1007/s11036-008-0150-5","author":[{"first_name":"Chia Ching","last_name":"Ooi","full_name":"Ooi, Chia Ching"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"publication_identifier":{"issn":["1383-469X","1572-8153"]},"title":"Minimal Energy Path Planning for Wireless Robots","status":"public","year":"2009","publication_status":"published","date_updated":"2022-01-06T06:54:13Z","date_created":"2020-10-01T10:05:47Z","department":[{"_id":"63"}],"type":"journal_article","citation":{"ieee":"C. C. Ooi and C. Schindelhauer, “Minimal Energy Path Planning for Wireless Robots,” <i>Mobile Networks and Applications (MONET)</i>, pp. 309–321, 2009.","apa":"Ooi, C. C., &#38; Schindelhauer, C. (2009). Minimal Energy Path Planning for Wireless Robots. <i>Mobile Networks and Applications (MONET)</i>, 309–321. <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>","short":"C.C. Ooi, C. Schindelhauer, Mobile Networks and Applications (MONET) (2009) 309–321.","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, 309–21. <a href=\"https://doi.org/10.1007/s11036-008-0150-5\">https://doi.org/10.1007/s11036-008-0150-5</a>.","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Minimal Energy Path Planning for Wireless Robots.” <i>Mobile Networks and Applications (MONET)</i>, 2009, pp. 309–21, doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>.","bibtex":"@article{Ooi_Schindelhauer_2009, title={Minimal Energy Path Planning for Wireless Robots}, DOI={<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>}, journal={Mobile Networks and Applications (MONET)}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={309–321} }","ama":"Ooi CC, Schindelhauer C. Minimal Energy Path Planning for Wireless Robots. <i>Mobile Networks and Applications (MONET)</i>. 2009:309-321. doi:<a href=\"https://doi.org/10.1007/s11036-008-0150-5\">10.1007/s11036-008-0150-5</a>"},"publication":"Mobile Networks and Applications (MONET)"},{"intvolume":"        43","publication_status":"published","date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Ooi, Chia Ching","first_name":"Chia Ching","last_name":"Ooi"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"issn":["1018-4864","1572-9451"]},"year":"2009","title":"Utilizing detours for energy conservation in mobile wireless networks","status":"public","volume":43,"user_id":"15415","doi":"10.1007/s11235-009-9188-3","_id":"19831","language":[{"iso":"eng"}],"page":"25-37","citation":{"ama":"Ooi CC, Schindelhauer C. Utilizing detours for energy conservation in mobile wireless networks. <i>Telecommunication Systems</i>. 2009;43:25-37. doi:<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>","bibtex":"@article{Ooi_Schindelhauer_2009, title={Utilizing detours for energy conservation in mobile wireless networks}, volume={43}, DOI={<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>}, journal={Telecommunication Systems}, author={Ooi, Chia Ching and Schindelhauer, Christian}, year={2009}, pages={25–37} }","mla":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” <i>Telecommunication Systems</i>, vol. 43, 2009, pp. 25–37, doi:<a href=\"https://doi.org/10.1007/s11235-009-9188-3\">10.1007/s11235-009-9188-3</a>.","chicago":"Ooi, Chia Ching, and Christian Schindelhauer. “Utilizing Detours for Energy Conservation in Mobile Wireless Networks.” <i>Telecommunication Systems</i> 43 (2009): 25–37. <a href=\"https://doi.org/10.1007/s11235-009-9188-3\">https://doi.org/10.1007/s11235-009-9188-3</a>.","short":"C.C. Ooi, C. Schindelhauer, Telecommunication Systems 43 (2009) 25–37.","apa":"Ooi, C. C., &#38; Schindelhauer, C. (2009). Utilizing detours for energy conservation in mobile wireless networks. <i>Telecommunication Systems</i>, <i>43</i>, 25–37. <a href=\"https://doi.org/10.1007/s11235-009-9188-3\">https://doi.org/10.1007/s11235-009-9188-3</a>","ieee":"C. C. Ooi and C. Schindelhauer, “Utilizing detours for energy conservation in mobile wireless networks,” <i>Telecommunication Systems</i>, vol. 43, pp. 25–37, 2009."},"publication":"Telecommunication Systems","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-10-01T10:10:10Z"}]