[{"year":"2016","citation":{"mla":"Striewe, Jan André, et al. <i>Innovative Largescale Production Process for Multilayered Sheet-Metal-FRP-Structures</i>. 2016.","bibtex":"@inproceedings{Striewe_Reuter_Lauter_Tröster_2016, title={Innovative largescale Production Process for multilayered Sheet-Metal-FRP-Structures}, author={Striewe, Jan André and Reuter, C. and Lauter, C. and Tröster, Thomas}, year={2016} }","short":"J.A. Striewe, C. Reuter, C. Lauter, T. Tröster, in: 2016.","apa":"Striewe, J. A., Reuter, C., Lauter, C., &#38; Tröster, T. (2016). Innovative largescale Production Process for multilayered Sheet-Metal-FRP-Structures. Presented at the 19th International Conference on Composite Structures, Porto.","ieee":"J. A. Striewe, C. Reuter, C. Lauter, and T. Tröster, “Innovative largescale Production Process for multilayered Sheet-Metal-FRP-Structures,” presented at the 19th International Conference on Composite Structures, Porto, 2016.","chicago":"Striewe, Jan André, C. Reuter, C. Lauter, and Thomas Tröster. “Innovative Largescale Production Process for Multilayered Sheet-Metal-FRP-Structures,” 2016.","ama":"Striewe JA, Reuter C, Lauter C, Tröster T. Innovative largescale Production Process for multilayered Sheet-Metal-FRP-Structures. In: ; 2016."},"title":"Innovative largescale Production Process for multilayered Sheet-Metal-FRP-Structures","conference":{"end_date":"2016-09-09","location":"Porto","name":"19th International Conference on Composite Structures","start_date":"2016-09-05"},"date_updated":"2022-01-06T06:52:47Z","author":[{"full_name":"Striewe, Jan André","id":"29413","last_name":"Striewe","first_name":"Jan André"},{"first_name":"C.","full_name":"Reuter, C.","last_name":"Reuter"},{"first_name":"C.","last_name":"Lauter","full_name":"Lauter, C."},{"id":"553","full_name":"Tröster, Thomas","last_name":"Tröster","first_name":"Thomas"}],"date_created":"2020-03-09T09:41:43Z","status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"16268","department":[{"_id":"9"},{"_id":"321"},{"_id":"149"},{"_id":"9"}],"user_id":"29413"},{"language":[{"iso":"eng"}],"_id":"16269","department":[{"_id":"9"},{"_id":"321"},{"_id":"149"}],"user_id":"72008","status":"public","type":"conference","title":"CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications","conference":{"start_date":"2016-09-21","name":"International Conference on Automotive Composites, ICAutoC 2016","location":"Lisbon, Portugal","end_date":"2016-09-23"},"date_updated":"2022-01-06T06:52:47Z","date_created":"2020-03-09T09:47:32Z","author":[{"first_name":"Z.","full_name":"Wang, Z.","last_name":"Wang"},{"full_name":"Lauter, C.","last_name":"Lauter","first_name":"C."},{"full_name":"Löseke, Julian","id":"27651","last_name":"Löseke","first_name":"Julian"},{"id":"553","full_name":"Tröster, Thomas","last_name":"Tröster","first_name":"Thomas"}],"year":"2016","citation":{"bibtex":"@inproceedings{Wang_Lauter_Löseke_Tröster_2016, title={CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications}, author={Wang, Z. and Lauter, C. and Löseke, Julian and Tröster, Thomas}, year={2016} }","short":"Z. Wang, C. Lauter, J. Löseke, T. Tröster, in: 2016.","mla":"Wang, Z., et al. <i>CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications</i>. 2016.","apa":"Wang, Z., Lauter, C., Löseke, J., &#38; Tröster, T. (2016). CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications. Presented at the International Conference on Automotive Composites, ICAutoC 2016, Lisbon, Portugal.","ama":"Wang Z, Lauter C, Löseke J, Tröster T. CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications. In: ; 2016.","ieee":"Z. Wang, C. Lauter, J. Löseke, and T. Tröster, “CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications,” presented at the International Conference on Automotive Composites, ICAutoC 2016, Lisbon, Portugal, 2016.","chicago":"Wang, Z., C. Lauter, Julian Löseke, and Thomas Tröster. “CarS: Carbon Fiber Reinforced Steel for Structural Automotive Applications,” 2016."}},{"citation":{"ama":"Gutierrez PAA, Rojas E, Schwabe A, et al. NetIDE: All-in-one framework for next generation, composed SDN applications. In: <i>2016 IEEE NetSoft Conference and Workshops (NetSoft)</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/netsoft.2016.7502408\">10.1109/netsoft.2016.7502408</a>","chicago":"Gutierrez, P. A. Aranda, E. Rojas, A. Schwabe, C. Stritzke, R. Doriguzzi-Corin, A. Leckey, G. Petralia, A. Marsico, K. Phemius, and S. Tamurejo. “NetIDE: All-in-One Framework for next Generation, Composed SDN Applications.” In <i>2016 IEEE NetSoft Conference and Workshops (NetSoft)</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/netsoft.2016.7502408\">https://doi.org/10.1109/netsoft.2016.7502408</a>.","ieee":"P. A. A. Gutierrez <i>et al.</i>, “NetIDE: All-in-one framework for next generation, composed SDN applications,” in <i>2016 IEEE NetSoft Conference and Workshops (NetSoft)</i>, 2016.","apa":"Gutierrez, P. A. A., Rojas, E., Schwabe, A., Stritzke, C., Doriguzzi-Corin, R., Leckey, A., … Tamurejo, S. (2016). NetIDE: All-in-one framework for next generation, composed SDN applications. In <i>2016 IEEE NetSoft Conference and Workshops (NetSoft)</i>. IEEE. <a href=\"https://doi.org/10.1109/netsoft.2016.7502408\">https://doi.org/10.1109/netsoft.2016.7502408</a>","mla":"Gutierrez, P. A. Aranda, et al. “NetIDE: All-in-One Framework for next Generation, Composed SDN Applications.” <i>2016 IEEE NetSoft Conference and Workshops (NetSoft)</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/netsoft.2016.7502408\">10.1109/netsoft.2016.7502408</a>.","bibtex":"@inproceedings{Gutierrez_Rojas_Schwabe_Stritzke_Doriguzzi-Corin_Leckey_Petralia_Marsico_Phemius_Tamurejo_2016, title={NetIDE: All-in-one framework for next generation, composed SDN applications}, DOI={<a href=\"https://doi.org/10.1109/netsoft.2016.7502408\">10.1109/netsoft.2016.7502408</a>}, booktitle={2016 IEEE NetSoft Conference and Workshops (NetSoft)}, publisher={IEEE}, author={Gutierrez, P. A. Aranda and Rojas, E. and Schwabe, A. and Stritzke, C. and Doriguzzi-Corin, R. and Leckey, A. and Petralia, G. and Marsico, A. and Phemius, K. and Tamurejo, S.}, year={2016} }","short":"P.A.A. Gutierrez, E. Rojas, A. Schwabe, C. Stritzke, R. Doriguzzi-Corin, A. Leckey, G. Petralia, A. Marsico, K. Phemius, S. Tamurejo, in: 2016 IEEE NetSoft Conference and Workshops (NetSoft), IEEE, 2016."},"year":"2016","ec_funded":"1","publication_identifier":{"isbn":["9781467394864"]},"publication_status":"published","doi":"10.1109/netsoft.2016.7502408","title":"NetIDE: All-in-one framework for next generation, composed SDN applications","author":[{"first_name":"P. A. Aranda","full_name":"Gutierrez, P. A. Aranda","last_name":"Gutierrez"},{"first_name":"E.","last_name":"Rojas","full_name":"Rojas, E."},{"full_name":"Schwabe, A.","last_name":"Schwabe","first_name":"A."},{"first_name":"C.","last_name":"Stritzke","full_name":"Stritzke, C."},{"first_name":"R.","full_name":"Doriguzzi-Corin, R.","last_name":"Doriguzzi-Corin"},{"full_name":"Leckey, A.","last_name":"Leckey","first_name":"A."},{"first_name":"G.","last_name":"Petralia","full_name":"Petralia, G."},{"full_name":"Marsico, A.","last_name":"Marsico","first_name":"A."},{"first_name":"K.","last_name":"Phemius","full_name":"Phemius, K."},{"last_name":"Tamurejo","full_name":"Tamurejo, S.","first_name":"S."}],"date_created":"2018-03-22T13:15:10Z","publisher":"IEEE","date_updated":"2022-01-06T06:52:47Z","status":"public","publication":"2016 IEEE NetSoft Conference and Workshops (NetSoft)","type":"conference","department":[{"_id":"75"}],"user_id":"15572","_id":"1627","project":[{"name":"An integrated development environment for portable network applications","_id":"21","grant_number":"619543","call_identifier":"FP7-ICT-2013-11"}]},{"issue":"5","year":"2016","citation":{"chicago":"Hickmann, T., Dominik Ahlers, and Thomas Tröster. “Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten.” <i>Der Stahlformenbauer </i>, no. 5 (2016).","ieee":"T. Hickmann, D. Ahlers, and T. Tröster, “Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten,” <i>Der Stahlformenbauer </i>, no. 5, 2016.","ama":"Hickmann T, Ahlers D, Tröster T. Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten. <i>Der Stahlformenbauer </i>. 2016;(5).","mla":"Hickmann, T., et al. “Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten.” <i>Der Stahlformenbauer </i>, no. 5, Technischer Fachverlag Möller, 2016.","bibtex":"@article{Hickmann_Ahlers_Tröster_2016, title={Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten}, number={5}, journal={Der Stahlformenbauer }, publisher={Technischer Fachverlag Möller}, author={Hickmann, T. and Ahlers, Dominik and Tröster, Thomas}, year={2016} }","short":"T. Hickmann, D. Ahlers, T. Tröster, Der Stahlformenbauer  (2016).","apa":"Hickmann, T., Ahlers, D., &#38; Tröster, T. (2016). Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten. <i>Der Stahlformenbauer </i>, (5)."},"date_updated":"2022-01-06T06:52:47Z","publisher":"Technischer Fachverlag Möller","author":[{"last_name":"Hickmann","full_name":"Hickmann, T.","first_name":"T."},{"first_name":"Dominik","id":"11207","full_name":"Ahlers, Dominik","last_name":"Ahlers"},{"last_name":"Tröster","id":"553","full_name":"Tröster, Thomas","first_name":"Thomas"}],"date_created":"2020-03-09T09:51:21Z","title":"Neue Prototypen-Werkzeugtechnologie für Bipolarplatten und Batteriekomponenten","type":"journal_article","publication":"Der Stahlformenbauer ","status":"public","_id":"16270","user_id":"11207","department":[{"_id":"9"},{"_id":"321"},{"_id":"149"},{"_id":"219"}],"language":[{"iso":"ger"}]},{"date_updated":"2022-01-06T06:52:48Z","publisher":"ACM","date_created":"2017-10-17T12:41:23Z","title":"Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)","conference":{"location":"Paderborn, Germany","end_date":"2016-07-08","start_date":"2016-07-04","name":"MobiHoc"},"doi":"10.1145/2942358","year":"2016","citation":{"apa":"Dressler, F., &#38; Meyer auf der Heide, F. (Eds.). (2016). <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. Presented at the MobiHoc, Paderborn, Germany: ACM. <a href=\"https://doi.org/10.1145/2942358\">https://doi.org/10.1145/2942358</a>","bibtex":"@book{Dressler_Meyer auf der Heide_2016, title={Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)}, DOI={<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>}, publisher={ACM}, year={2016} }","short":"F. Dressler, F. Meyer auf der Heide, eds., Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), ACM, 2016.","mla":"Dressler, Falko, and Friedhelm Meyer auf der Heide, editors. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016, doi:<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>.","ama":"Dressler F, Meyer auf der Heide F, eds. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM; 2016. doi:<a href=\"https://doi.org/10.1145/2942358\">10.1145/2942358</a>","ieee":"F. Dressler and F. Meyer auf der Heide, Eds., <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016.","chicago":"Dressler, Falko, and Friedhelm Meyer auf der Heide, eds. <i>Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)</i>. ACM, 2016. <a href=\"https://doi.org/10.1145/2942358\">https://doi.org/10.1145/2942358</a>."},"_id":"163","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"63"}],"user_id":"15504","type":"conference_editor","editor":[{"full_name":"Dressler, Falko","last_name":"Dressler","first_name":"Falko"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"status":"public"},{"citation":{"ama":"Marsico A, Doriguzzi-Corin R, Gerola M, Siracusa D, Schwabe A. A non-disruptive automated approach to update SDN applications at runtime. In: <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/noms.2016.7502946\">10.1109/noms.2016.7502946</a>","chicago":"Marsico, Antonio, Roberto Doriguzzi-Corin, Matteo Gerola, Domenico Siracusa, and Arne Schwabe. “A Non-Disruptive Automated Approach to Update SDN Applications at Runtime.” In <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/noms.2016.7502946\">https://doi.org/10.1109/noms.2016.7502946</a>.","ieee":"A. Marsico, R. Doriguzzi-Corin, M. Gerola, D. Siracusa, and A. Schwabe, “A non-disruptive automated approach to update SDN applications at runtime,” in <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>, 2016.","bibtex":"@inproceedings{Marsico_Doriguzzi-Corin_Gerola_Siracusa_Schwabe_2016, title={A non-disruptive automated approach to update SDN applications at runtime}, DOI={<a href=\"https://doi.org/10.1109/noms.2016.7502946\">10.1109/noms.2016.7502946</a>}, booktitle={NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}, publisher={IEEE}, author={Marsico, Antonio and Doriguzzi-Corin, Roberto and Gerola, Matteo and Siracusa, Domenico and Schwabe, Arne}, year={2016} }","mla":"Marsico, Antonio, et al. “A Non-Disruptive Automated Approach to Update SDN Applications at Runtime.” <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/noms.2016.7502946\">10.1109/noms.2016.7502946</a>.","short":"A. Marsico, R. Doriguzzi-Corin, M. Gerola, D. Siracusa, A. Schwabe, in: NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium, IEEE, 2016.","apa":"Marsico, A., Doriguzzi-Corin, R., Gerola, M., Siracusa, D., &#38; Schwabe, A. (2016). A non-disruptive automated approach to update SDN applications at runtime. In <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>. IEEE. <a href=\"https://doi.org/10.1109/noms.2016.7502946\">https://doi.org/10.1109/noms.2016.7502946</a>"},"year":"2016","publication_status":"published","ec_funded":"1","publication_identifier":{"isbn":["9781509002238"]},"doi":"10.1109/noms.2016.7502946","title":"A non-disruptive automated approach to update SDN applications at runtime","date_created":"2018-03-22T13:21:41Z","author":[{"first_name":"Antonio","last_name":"Marsico","full_name":"Marsico, Antonio"},{"first_name":"Roberto","last_name":"Doriguzzi-Corin","full_name":"Doriguzzi-Corin, Roberto"},{"last_name":"Gerola","full_name":"Gerola, Matteo","first_name":"Matteo"},{"first_name":"Domenico","last_name":"Siracusa","full_name":"Siracusa, Domenico"},{"first_name":"Arne","full_name":"Schwabe, Arne","last_name":"Schwabe"}],"date_updated":"2022-01-06T06:52:48Z","publisher":"IEEE","status":"public","type":"conference","publication":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","user_id":"15572","department":[{"_id":"75"}],"project":[{"grant_number":"619543","_id":"21","name":"An integrated development environment for portable network applications","call_identifier":"FP7-ICT-2013-11"}],"_id":"1630"},{"year":"2016","citation":{"apa":"Doriguzzi-Corin, R., Siracusa, D., Salvador, E., &#38; Schwabe, A. (2016). Empowering network operating systems with memory management techniques. In <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>. IEEE. <a href=\"https://doi.org/10.1109/noms.2016.7502889\">https://doi.org/10.1109/noms.2016.7502889</a>","mla":"Doriguzzi-Corin, Roberto, et al. “Empowering Network Operating Systems with Memory Management Techniques.” <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>, IEEE, 2016, doi:<a href=\"https://doi.org/10.1109/noms.2016.7502889\">10.1109/noms.2016.7502889</a>.","short":"R. Doriguzzi-Corin, D. Siracusa, E. Salvador, A. Schwabe, in: NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium, IEEE, 2016.","bibtex":"@inproceedings{Doriguzzi-Corin_Siracusa_Salvador_Schwabe_2016, title={Empowering network operating systems with memory management techniques}, DOI={<a href=\"https://doi.org/10.1109/noms.2016.7502889\">10.1109/noms.2016.7502889</a>}, booktitle={NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium}, publisher={IEEE}, author={Doriguzzi-Corin, Roberto and Siracusa, Domenico and Salvador, Elio and Schwabe, Arne}, year={2016} }","ieee":"R. Doriguzzi-Corin, D. Siracusa, E. Salvador, and A. Schwabe, “Empowering network operating systems with memory management techniques,” in <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>, 2016.","chicago":"Doriguzzi-Corin, Roberto, Domenico Siracusa, Elio Salvador, and Arne Schwabe. “Empowering Network Operating Systems with Memory Management Techniques.” In <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>. IEEE, 2016. <a href=\"https://doi.org/10.1109/noms.2016.7502889\">https://doi.org/10.1109/noms.2016.7502889</a>.","ama":"Doriguzzi-Corin R, Siracusa D, Salvador E, Schwabe A. Empowering network operating systems with memory management techniques. In: <i>NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium</i>. IEEE; 2016. doi:<a href=\"https://doi.org/10.1109/noms.2016.7502889\">10.1109/noms.2016.7502889</a>"},"publication_status":"published","ec_funded":"1","publication_identifier":{"isbn":["9781509002238"]},"title":"Empowering network operating systems with memory management techniques","doi":"10.1109/noms.2016.7502889","publisher":"IEEE","date_updated":"2022-01-06T06:52:48Z","author":[{"last_name":"Doriguzzi-Corin","full_name":"Doriguzzi-Corin, Roberto","first_name":"Roberto"},{"first_name":"Domenico","last_name":"Siracusa","full_name":"Siracusa, Domenico"},{"first_name":"Elio","last_name":"Salvador","full_name":"Salvador, Elio"},{"first_name":"Arne","last_name":"Schwabe","full_name":"Schwabe, Arne"}],"date_created":"2018-03-22T13:23:06Z","status":"public","type":"conference","publication":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","project":[{"call_identifier":"FP7-ICT-2013-11","grant_number":"619543","_id":"21","name":"An integrated development environment for portable network applications"}],"_id":"1632","user_id":"15572","department":[{"_id":"75"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"43"},{"_id":"35"},{"_id":"306"},{"_id":"15"}],"user_id":"54038","_id":"16323","project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"status":"public","publication":"Inorganic Chemistry","type":"journal_article","doi":"10.1021/acs.inorgchem.6b01704","title":"Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State","date_created":"2020-03-23T10:58:57Z","author":[{"full_name":"Vollmers, Nora Jenny","last_name":"Vollmers","first_name":"Nora Jenny"},{"first_name":"Patrick","id":"54037","full_name":"Müller, Patrick","last_name":"Müller","orcid":"0000-0003-1103-4073"},{"full_name":"Hoffmann, Alexander","last_name":"Hoffmann","first_name":"Alexander"},{"last_name":"Herres-Pawlis","full_name":"Herres-Pawlis, Sonja","first_name":"Sonja"},{"last_name":"Rohrmüller","full_name":"Rohrmüller, Martin","first_name":"Martin"},{"first_name":"Wolf Gero","full_name":"Schmidt, Wolf Gero","last_name":"Schmidt"},{"first_name":"Uwe","full_name":"Gerstmann, Uwe","last_name":"Gerstmann"},{"full_name":"Bauer, Matthias","id":"47241","last_name":"Bauer","first_name":"Matthias"}],"date_updated":"2022-01-06T06:52:48Z","page":"11694-11706","citation":{"mla":"Vollmers, Nora Jenny, et al. “Experimental and Theoretical High-Energy-Resolution X-Ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State.” <i>Inorganic Chemistry</i>, 2016, pp. 11694–706, doi:<a href=\"https://doi.org/10.1021/acs.inorgchem.6b01704\">10.1021/acs.inorgchem.6b01704</a>.","bibtex":"@article{Vollmers_Müller_Hoffmann_Herres-Pawlis_Rohrmüller_Schmidt_Gerstmann_Bauer_2016, title={Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State}, DOI={<a href=\"https://doi.org/10.1021/acs.inorgchem.6b01704\">10.1021/acs.inorgchem.6b01704</a>}, journal={Inorganic Chemistry}, author={Vollmers, Nora Jenny and Müller, Patrick and Hoffmann, Alexander and Herres-Pawlis, Sonja and Rohrmüller, Martin and Schmidt, Wolf Gero and Gerstmann, Uwe and Bauer, Matthias}, year={2016}, pages={11694–11706} }","short":"N.J. Vollmers, P. Müller, A. Hoffmann, S. Herres-Pawlis, M. Rohrmüller, W.G. Schmidt, U. Gerstmann, M. Bauer, Inorganic Chemistry (2016) 11694–11706.","apa":"Vollmers, N. J., Müller, P., Hoffmann, A., Herres-Pawlis, S., Rohrmüller, M., Schmidt, W. G., … Bauer, M. (2016). Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State. <i>Inorganic Chemistry</i>, 11694–11706. <a href=\"https://doi.org/10.1021/acs.inorgchem.6b01704\">https://doi.org/10.1021/acs.inorgchem.6b01704</a>","ama":"Vollmers NJ, Müller P, Hoffmann A, et al. Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State. <i>Inorganic Chemistry</i>. 2016:11694-11706. doi:<a href=\"https://doi.org/10.1021/acs.inorgchem.6b01704\">10.1021/acs.inorgchem.6b01704</a>","chicago":"Vollmers, Nora Jenny, Patrick Müller, Alexander Hoffmann, Sonja Herres-Pawlis, Martin Rohrmüller, Wolf Gero Schmidt, Uwe Gerstmann, and Matthias Bauer. “Experimental and Theoretical High-Energy-Resolution X-Ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State.” <i>Inorganic Chemistry</i>, 2016, 11694–706. <a href=\"https://doi.org/10.1021/acs.inorgchem.6b01704\">https://doi.org/10.1021/acs.inorgchem.6b01704</a>.","ieee":"N. J. Vollmers <i>et al.</i>, “Experimental and Theoretical High-Energy-Resolution X-ray Absorption Spectroscopy: Implications for the Investigation of the Entatic State,” <i>Inorganic Chemistry</i>, pp. 11694–11706, 2016."},"year":"2016","publication_identifier":{"issn":["0020-1669","1520-510X"]},"publication_status":"published"},{"citation":{"ama":"Fischer M, Jähn C, Meyer auf der Heide F, Petring R. Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In: Kliemann L, Sanders P, eds. <i>Algorithm Engineering</i>. Vol 9220. LNCS. Springer; 2016:226-244. doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">10.1007/978-3-319-49487-6_7 </a>","chicago":"Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In <i>Algorithm Engineering</i>, edited by Lasse Kliemann and Peter Sanders, 9220:226–44. LNCS. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">https://doi.org/10.1007/978-3-319-49487-6_7 </a>.","ieee":"M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering Aspects of Real-Time Rendering Algorithms,” in <i>Algorithm Engineering</i>, 2016, vol. 9220, pp. 226–244.","apa":"Fischer, M., Jähn, C., Meyer auf der Heide, F., &#38; Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann &#38; P. Sanders (Eds.), <i>Algorithm Engineering</i> (Vol. 9220, pp. 226–244). Springer. <a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">https://doi.org/10.1007/978-3-319-49487-6_7 </a>","short":"M. Fischer, C. Jähn, F. Meyer auf der Heide, R. Petring, in: L. Kliemann, P. Sanders (Eds.), Algorithm Engineering, Springer, 2016, pp. 226–244.","bibtex":"@inproceedings{Fischer_Jähn_Meyer auf der Heide_Petring_2016, series={LNCS}, title={Algorithm Engineering Aspects of Real-Time Rendering Algorithms}, volume={9220}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">10.1007/978-3-319-49487-6_7 </a>}, booktitle={Algorithm Engineering}, publisher={Springer}, author={Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf}, editor={Kliemann, Lasse and Sanders, PeterEditors}, year={2016}, pages={226–244}, collection={LNCS} }","mla":"Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” <i>Algorithm Engineering</i>, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:<a href=\"https://doi.org/10.1007/978-3-319-49487-6_7 \">10.1007/978-3-319-49487-6_7 </a>."},"intvolume":"      9220","page":"226-244","year":"2016","doi":"10.1007/978-3-319-49487-6_7 ","title":"Algorithm Engineering Aspects of Real-Time Rendering Algorithms","date_created":"2020-03-30T10:21:53Z","author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Petring","full_name":"Petring, Ralf","first_name":"Ralf"}],"volume":9220,"publisher":"Springer","date_updated":"2022-01-06T06:52:49Z","status":"public","abstract":[{"lang":"eng","text":"Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.\r\n"}],"editor":[{"first_name":"Lasse","last_name":"Kliemann","full_name":"Kliemann, Lasse"},{"last_name":"Sanders","full_name":"Sanders, Peter","first_name":"Peter"}],"type":"conference","publication":"Algorithm Engineering","language":[{"iso":"eng"}],"series_title":"LNCS","user_id":"15415","department":[{"_id":"63"}],"_id":"16351"},{"status":"public","type":"conference","publication":"Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)","language":[{"iso":"eng"}],"_id":"16358","user_id":"15415","department":[{"_id":"63"}],"year":"2016","citation":{"apa":"Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2016). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Springer. <a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">https://doi.org/10.1007/978-3-319-53058-1_5 </a>","mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, Springer, 2016, doi:<a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">10.1007/978-3-319-53058-1_5 </a>.","bibtex":"@inproceedings{Li_Meyer auf der Heide_Podlipyan_2016, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">10.1007/978-3-319-53058-1_5 </a>}, booktitle={Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)}, publisher={Springer}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2016} }","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, in: Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), Springer, 2016.","ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. In: <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Springer; 2016. doi:<a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">10.1007/978-3-319-53058-1_5 </a>","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” In <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>. Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-53058-1_5 \">https://doi.org/10.1007/978-3-319-53058-1_5 </a>.","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” in <i>Algorithms for Sensor Systems, Proceedings of the 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS)</i>, 2016."},"title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","doi":"10.1007/978-3-319-53058-1_5 ","date_updated":"2022-01-06T06:52:49Z","publisher":"Springer","author":[{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Pavel","last_name":"Podlipyan","full_name":"Podlipyan, Pavel"}],"date_created":"2020-04-01T12:28:09Z"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16359","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","status":"public","abstract":[{"lang":"eng","text":"In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2)."}],"author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-01T12:46:35Z","publisher":"ACM","date_updated":"2022-01-06T06:52:49Z","doi":"10.1145/2935764.2935789","title":"Asymptotically Optimal Gathering on a Grid","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM, 2016, pp. 301–12, doi:<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>.","bibtex":"@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={301–312} }","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–312.","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 301–312). ACM. <a href=\"https://doi.org/10.1145/2935764.2935789\">https://doi.org/10.1145/2935764.2935789</a>","chicago":"Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 301–12. ACM, 2016. <a href=\"https://doi.org/10.1145/2935764.2935789\">https://doi.org/10.1145/2935764.2935789</a>.","ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2016, pp. 301–312.","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM; 2016:301-312. doi:<a href=\"https://doi.org/10.1145/2935764.2935789\">10.1145/2935764.2935789</a>"},"page":"301-312","year":"2016"},{"language":[{"iso":"eng"}],"_id":"16360","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. "}],"status":"public","type":"conference","publication":"Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)","title":"Gathering a Closed Chain of Robots on a Grid","doi":"10.1109/IPDPS.2016.51","publisher":"IEEE","date_updated":"2022-01-06T06:52:49Z","author":[{"full_name":"Abshoff, Sebastian","last_name":"Abshoff","first_name":"Sebastian"},{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Daniel","last_name":"Jung","full_name":"Jung, Daniel","id":"37827"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-01T12:56:43Z","year":"2016","citation":{"apa":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 689–699). IEEE. <a href=\"https://doi.org/10.1109/IPDPS.2016.51\">https://doi.org/10.1109/IPDPS.2016.51</a>","short":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–699.","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Gathering a Closed Chain of Robots on a Grid}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>}, booktitle={Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={689–699} }","mla":"Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, IEEE, 2016, pp. 689–99, doi:<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>.","ama":"Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2016:689-699. doi:<a href=\"https://doi.org/10.1109/IPDPS.2016.51\">10.1109/IPDPS.2016.51</a>","ieee":"S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” in <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016, pp. 689–699.","chicago":"Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>, 689–99. IEEE, 2016. <a href=\"https://doi.org/10.1109/IPDPS.2016.51\">https://doi.org/10.1109/IPDPS.2016.51</a>."},"page":"689-699"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16364","language":[{"iso":"eng"}],"type":"conference","publication":"2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)","status":"public","author":[{"last_name":"Macker","full_name":"Macker, Alexander","first_name":"Alexander"},{"last_name":"Malatyali","full_name":"Malatyali, Manuel","first_name":"Manuel"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-02T10:14:25Z","date_updated":"2022-01-06T06:52:49Z","doi":"10.1109/ipdps.2016.91","title":"On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams","publication_status":"published","publication_identifier":{"isbn":["9781509021406"]},"citation":{"bibtex":"@inproceedings{Macker_Malatyali_Meyer auf der Heide_2016, title={On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>}, booktitle={2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Macker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2016} }","short":"A. Macker, M. Malatyali, F. Meyer auf der Heide, in: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2016.","mla":"Macker, Alexander, et al. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>.","apa":"Macker, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2016). On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps.2016.91\">https://doi.org/10.1109/ipdps.2016.91</a>","ieee":"A. Macker, M. Malatyali, and F. Meyer auf der Heide, “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams,” in <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016.","chicago":"Macker, Alexander, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams.” In <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016. <a href=\"https://doi.org/10.1109/ipdps.2016.91\">https://doi.org/10.1109/ipdps.2016.91</a>.","ama":"Macker A, Malatyali M, Meyer auf der Heide F. On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams. In: <i>2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/ipdps.2016.91\">10.1109/ipdps.2016.91</a>"},"year":"2016"},{"doi":"10.1109/vnc.2015.7385550","title":"IEEE 802.11p unicast considered harmful","author":[{"first_name":"Florian","last_name":"Klingler","full_name":"Klingler, Florian"},{"first_name":"Falko","last_name":"Dressler","full_name":"Dressler, Falko"},{"last_name":"Sommer","full_name":"Sommer, Christoph","first_name":"Christoph"}],"date_created":"2020-04-02T15:41:34Z","date_updated":"2022-01-06T06:52:50Z","citation":{"apa":"Klingler, F., Dressler, F., &#38; Sommer, C. (2016). IEEE 802.11p unicast considered harmful. In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. <a href=\"https://doi.org/10.1109/vnc.2015.7385550\">https://doi.org/10.1109/vnc.2015.7385550</a>","mla":"Klingler, Florian, et al. “IEEE 802.11p Unicast Considered Harmful.” <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>.","bibtex":"@inproceedings{Klingler_Dressler_Sommer_2016, title={IEEE 802.11p unicast considered harmful}, DOI={<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>}, booktitle={2015 IEEE Vehicular Networking Conference (VNC)}, author={Klingler, Florian and Dressler, Falko and Sommer, Christoph}, year={2016} }","short":"F. Klingler, F. Dressler, C. Sommer, in: 2015 IEEE Vehicular Networking Conference (VNC), 2016.","chicago":"Klingler, Florian, Falko Dressler, and Christoph Sommer. “IEEE 802.11p Unicast Considered Harmful.” In <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016. <a href=\"https://doi.org/10.1109/vnc.2015.7385550\">https://doi.org/10.1109/vnc.2015.7385550</a>.","ieee":"F. Klingler, F. Dressler, and C. Sommer, “IEEE 802.11p unicast considered harmful,” in <i>2015 IEEE Vehicular Networking Conference (VNC)</i>, 2016.","ama":"Klingler F, Dressler F, Sommer C. IEEE 802.11p unicast considered harmful. In: <i>2015 IEEE Vehicular Networking Conference (VNC)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/vnc.2015.7385550\">10.1109/vnc.2015.7385550</a>"},"year":"2016","publication_status":"published","publication_identifier":{"isbn":["9781467394116"]},"user_id":"49153","_id":"16386","status":"public","type":"conference","publication":"2015 IEEE Vehicular Networking Conference (VNC)"},{"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"external_id":{"arxiv":["1609.01184"]},"_id":"16396","status":"public","abstract":[{"lang":"eng","text":"We consider a scheduling problem where machines need to be rented from the\r\ncloud in order to process jobs. There are two types of machines available which\r\ncan be rented for machine-type dependent prices and for arbitrary durations.\r\nHowever, a machine-type dependent setup time is required before a machine is\r\navailable for processing. Jobs arrive online over time, have machine-type\r\ndependent sizes and have individual deadlines. The objective is to rent\r\nmachines and schedule jobs so as to meet all deadlines while minimizing the\r\nrental cost.\r\n  Since we observe the slack of jobs to have a fundamental influence on the\r\ncompetitiveness, we study the model when instances are parameterized by their\r\n(minimum) slack. An instance is called to have a slack of $\\beta$ if, for all\r\njobs, the difference between the job's release time and the latest point in\r\ntime at which it needs to be started is at least $\\beta$. While for $\\beta < s$\r\nno finite competitiveness is possible, our main result is an\r\n$O(\\frac{c}{\\varepsilon} + \\frac{1}{\\varepsilon^3})$-competitive online\r\nalgorithm for $\\beta = (1+\\varepsilon)s$ with $\\frac{1}{s} \\leq \\varepsilon\r\n\\leq 1$, where $s$ and $c$ denotes the largest setup time and the cost ratio of\r\nthe machine-types, respectively. It is complemented by a lower bound of\r\n$\\Omega(\\frac{c}{\\varepsilon})$."}],"type":"preprint","publication":"arXiv:1609.01184","title":"Cost-efficient Scheduling on Machines from the Cloud","author":[{"last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"date_created":"2020-04-03T09:24:28Z","date_updated":"2022-01-06T06:52:50Z","citation":{"apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2016). Cost-efficient Scheduling on Machines from the Cloud. <i>ArXiv:1609.01184</i>.","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, ArXiv:1609.01184 (2016).","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2016, title={Cost-efficient Scheduling on Machines from the Cloud}, journal={arXiv:1609.01184}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2016} }","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>ArXiv:1609.01184</i>, 2016.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. <i>arXiv:160901184</i>. 2016.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” <i>arXiv:1609.01184</i>. 2016.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>ArXiv:1609.01184</i>, 2016."},"year":"2016"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"164","citation":{"apa":"Czech, M. (2016). <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn.","bibtex":"@book{Czech_2016, title={Predicting Rankings of Software Verification Tools Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech, Mike}, year={2016} }","mla":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","short":"M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data, Universität Paderborn, 2016.","ama":"Czech M. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn; 2016.","ieee":"M. Czech, <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","chicago":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016."},"year":"2016","title":"Predicting Rankings of Software Verification Tools Using Kernels for Structured Data","supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"author":[{"first_name":"Mike","full_name":"Czech, Mike","last_name":"Czech"}],"date_created":"2017-10-17T12:41:24Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:52:50Z"},{"date_created":"2019-10-15T10:38:36Z","author":[{"first_name":"Fabian","full_name":"Bause, Fabian","last_name":"Bause"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:45Z","title":"Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren","citation":{"apa":"Bause, F. (2016). <i>Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn.","mla":"Bause, Fabian. <i>Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn, 2016.","short":"F. Bause, Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren, Universität Paderborn, 2016.","bibtex":"@book{Bause_2016, title={Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren}, publisher={Universität Paderborn}, author={Bause, Fabian}, year={2016} }","chicago":"Bause, Fabian. <i>Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn, 2016.","ieee":"F. Bause, <i>Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn, 2016.","ama":"Bause F. <i>Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. Universität Paderborn; 2016."},"year":"2016","user_id":"15911","department":[{"_id":"49"}],"_id":"13860","language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"year":"2016","citation":{"ieee":"F. Bause and B. Henning, “5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren,” 2016.","chicago":"Bause, F., and Bernd Henning. “5.3.1 - Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren.” LibreCat University, 2016. <a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">https://doi.org/10.5162/SENSOREN2016/5.3.1</a>.","ama":"Bause F, Henning B. 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren. In: LibreCat University; 2016. doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">10.5162/SENSOREN2016/5.3.1</a>","apa":"Bause, F., &#38; Henning, B. (2016). 5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren. LibreCat University. <a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">https://doi.org/10.5162/SENSOREN2016/5.3.1</a>","short":"F. Bause, B. Henning, in: LibreCat University, 2016.","bibtex":"@inproceedings{Bause_Henning_2016, title={5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren}, DOI={<a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">10.5162/SENSOREN2016/5.3.1</a>}, publisher={LibreCat University}, author={Bause, F. and Henning, Bernd}, year={2016} }","mla":"Bause, F., and Bernd Henning. <i>5.3.1 - Ein Ultraschallbasiertes Inverses Messverfahren Zur Charakterisierung Viskoelastischer Materialparameter von Polymeren</i>. LibreCat University, 2016, doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/5.3.1\">10.5162/SENSOREN2016/5.3.1</a>."},"title":"5.3.1 - Ein ultraschallbasiertes inverses Messverfahren zur Charakterisierung viskoelastischer Materialparameter von Polymeren","doi":"10.5162/SENSOREN2016/5.3.1","publisher":"LibreCat University","date_updated":"2022-01-06T06:51:45Z","author":[{"full_name":"Bause, F.","last_name":"Bause","first_name":"F."},{"first_name":"Bernd","last_name":"Henning","id":"213","full_name":"Henning, Bernd"}],"date_created":"2019-10-15T11:03:43Z","status":"public","type":"conference","language":[{"iso":"eng"}],"_id":"13864","department":[{"_id":"49"}],"user_id":"15911"},{"language":[{"iso":"eng"}],"department":[{"_id":"49"}],"user_id":"15911","_id":"13865","status":"public","type":"conference","doi":"10.5162/SENSOREN2016/3.2.3","title":"3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung","author":[{"last_name":"Ester","full_name":"Ester, S.","first_name":"S."},{"first_name":"M.","last_name":"Struschka","full_name":"Struschka, M."},{"last_name":"Henning","id":"213","full_name":"Henning, Bernd","first_name":"Bernd"}],"date_created":"2019-10-15T11:04:18Z","date_updated":"2022-01-06T06:51:45Z","publisher":"LibreCat University","citation":{"ama":"Ester S, Struschka M, Henning B. 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung. In: LibreCat University; 2016. doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">10.5162/SENSOREN2016/3.2.3</a>","chicago":"Ester, S., M. Struschka, and Bernd Henning. “3.2.3 - Direktgravimetrischer Partikelmasse-Sensor Zur Quasikontinuierlichen Emissionsmessung.” LibreCat University, 2016. <a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">https://doi.org/10.5162/SENSOREN2016/3.2.3</a>.","ieee":"S. Ester, M. Struschka, and B. Henning, “3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung,” 2016.","apa":"Ester, S., Struschka, M., &#38; Henning, B. (2016). 3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung. LibreCat University. <a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">https://doi.org/10.5162/SENSOREN2016/3.2.3</a>","mla":"Ester, S., et al. <i>3.2.3 - Direktgravimetrischer Partikelmasse-Sensor Zur Quasikontinuierlichen Emissionsmessung</i>. LibreCat University, 2016, doi:<a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">10.5162/SENSOREN2016/3.2.3</a>.","bibtex":"@inproceedings{Ester_Struschka_Henning_2016, title={3.2.3 - Direktgravimetrischer Partikelmasse-Sensor zur quasikontinuierlichen Emissionsmessung}, DOI={<a href=\"https://doi.org/10.5162/SENSOREN2016/3.2.3\">10.5162/SENSOREN2016/3.2.3</a>}, publisher={LibreCat University}, author={Ester, S. and Struschka, M. and Henning, Bernd}, year={2016} }","short":"S. Ester, M. Struschka, B. Henning, in: LibreCat University, 2016."},"year":"2016"},{"type":"journal_article","status":"public","user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"139","file_date_updated":"2018-11-02T15:57:25Z","has_accepted_license":"1","citation":{"chicago":"Abshoff, Sebastian, Peter Kling, Christine Markarian, Friedhelm Meyer auf der Heide, and Peter  Pietrzyk. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4 (2016): 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>.","ieee":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, and P. Pietrzyk, “Towards the price of leasing online,” <i>Journal of Combinatorial Optimization</i>, no. 4, pp. 1197--1216, 2016.","ama":"Abshoff S, Kling P, Markarian C, Meyer auf der Heide F, Pietrzyk P. Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>. 2016;(4):1197--1216. doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>","apa":"Abshoff, S., Kling, P., Markarian, C., Meyer auf der Heide, F., &#38; Pietrzyk, P. (2016). Towards the price of leasing online. <i>Journal of Combinatorial Optimization</i>, (4), 1197--1216. <a href=\"https://doi.org/10.1007/s10878-015-9915-5\">https://doi.org/10.1007/s10878-015-9915-5</a>","bibtex":"@article{Abshoff_Kling_Markarian_Meyer auf der Heide_Pietrzyk_2016, title={Towards the price of leasing online}, DOI={<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Abshoff, Sebastian and Kling, Peter and Markarian, Christine and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter }, year={2016}, pages={1197--1216} }","short":"S. Abshoff, P. Kling, C. Markarian, F. Meyer auf der Heide, P. Pietrzyk, Journal of Combinatorial Optimization (2016) 1197--1216.","mla":"Abshoff, Sebastian, et al. “Towards the Price of Leasing Online.” <i>Journal of Combinatorial Optimization</i>, no. 4, Springer, 2016, pp. 1197--1216, doi:<a href=\"https://doi.org/10.1007/s10878-015-9915-5\">10.1007/s10878-015-9915-5</a>."},"page":" 1197--1216","author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"last_name":"Markarian","id":"37612","full_name":"Markarian, Christine","first_name":"Christine"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Peter ","full_name":"Pietrzyk, Peter ","last_name":"Pietrzyk"}],"date_updated":"2022-01-06T06:51:46Z","doi":"10.1007/s10878-015-9915-5","publication":"Journal of Combinatorial Optimization","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T15:57:25Z","date_updated":"2018-11-02T15:57:25Z","access_level":"closed","file_name":"Abshoff-TowardsThePriceOfLeasingOnline.pdf","file_id":"5318","file_size":654903}],"abstract":[{"text":"We consider online optimization problems in which certain goods have to be acquired in order to provide a service or infrastructure. Classically, decisions for such problems are considered as final: one buys the goods. However, in many real world applications, there is a shift away from the idea of buying goods. Instead, leasing is often a more flexible and lucrative business model. Research has realized this shift and recently initiated the theoretical study of leasing models (Anthony and Gupta in Proceedings of the integer programming and combinatorial optimization: 12th International IPCO Conference, Ithaca, NY, USA, June 25–27, 2007; Meyerson in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 Oct 2005, Pittsburgh, PA, USA, 2005; Nagarajan and Williamson in Discret Optim 10(4):361–370, 2013) We extend this line of work and suggest a more systematic study of leasing aspects for a class of online optimization problems. We provide two major technical results. We introduce the leasing variant of online set multicover and give an O(log(mK)logn)-competitive algorithm (with n, m, and K being the number of elements, sets, and leases, respectively). Our results also imply improvements for the non-leasing variant of online set cover. Moreover, we extend results for the leasing variant of online facility location. Nagarajan and Williamson (Discret Optim 10(4):361–370, 2013) gave an O(Klogn)-competitive algorithm for this problem (with n and K being the number of clients and leases, respectively). We remove the dependency on n (and, thereby, on time). In general, this leads to a bound of O(lmaxloglmax) (with the maximal lease length lmax). For many natural problem instances, the bound improves to O(K2).","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["000"],"issue":"4","year":"2016","date_created":"2017-10-17T12:41:18Z","publisher":"Springer","title":"Towards the price of leasing online"}]