[{"type":"bachelorsthesis","status":"public","_id":"5406","department":[{"_id":"63"}],"user_id":"22704","language":[{"iso":"eng"}],"year":"2016","citation":{"short":"J. Bülling, Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden, 2016.","bibtex":"@book{Bülling_2016, title={Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden}, author={Bülling, Jonas}, year={2016} }","mla":"Bülling, Jonas. <i>Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden</i>. 2016.","apa":"Bülling, J. (2016). <i>Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden</i>.","ieee":"J. Bülling, <i>Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden</i>. 2016.","chicago":"Bülling, Jonas. <i>Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden</i>, 2016.","ama":"Bülling J. <i>Parallelisierung von Algorithmen Zur IR-Luftbildanalyse von Laubholzmischbeständen Zur Verifizierung Der Ausbreitung von Eichenkomplexschäden</i>.; 2016."},"date_updated":"2022-01-06T07:01:51Z","author":[{"full_name":"Bülling, Jonas","last_name":"Bülling","first_name":"Jonas"}],"date_created":"2018-11-07T09:26:42Z","title":"Parallelisierung von Algorithmen zur IR-Luftbildanalyse von Laubholzmischbeständen zur Verifizierung der Ausbreitung von Eichenkomplexschäden"},{"language":[{"iso":"eng"}],"_id":"5407","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"63"}],"user_id":"477","status":"public","type":"bachelorsthesis","title":"Price-Based Allocation Games","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:51Z","date_created":"2018-11-07T09:45:57Z","author":[{"full_name":"Koepe, Jörn","last_name":"Koepe","first_name":"Jörn"}],"year":"2016","citation":{"short":"J. Koepe, Price-Based Allocation Games, Universität Paderborn, 2016.","bibtex":"@book{Koepe_2016, title={Price-Based Allocation Games}, publisher={Universität Paderborn}, author={Koepe, Jörn}, year={2016} }","mla":"Koepe, Jörn. <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","apa":"Koepe, J. (2016). <i>Price-Based Allocation Games</i>. Universität Paderborn.","ieee":"J. Koepe, <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","chicago":"Koepe, Jörn. <i>Price-Based Allocation Games</i>. Universität Paderborn, 2016.","ama":"Koepe J. <i>Price-Based Allocation Games</i>. Universität Paderborn; 2016."}},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"27"},{"_id":"518"}],"user_id":"477","_id":"5418","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"14","name":"SFB 901 - Subproject C2"}],"citation":{"chicago":"Tölke, Christian. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn, 2016.","ieee":"C. Tölke, <i>Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung</i>. Universität Paderborn, 2016.","ama":"Tölke C. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn; 2016.","apa":"Tölke, C. (2016). <i>Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung</i>. Universität Paderborn.","bibtex":"@book{Tölke_2016, title={Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung}, publisher={Universität Paderborn}, author={Tölke, Christian}, year={2016} }","short":"C. Tölke, Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung, Universität Paderborn, 2016.","mla":"Tölke, Christian. <i>Sicherheit von Hybriden FPGA-Systemen in Der Industriellen Automatisierungstechnik -- Anforderungen Und Umsetzung</i>. Universität Paderborn, 2016."},"year":"2016","title":"Sicherheit von hybriden FPGA-Systemen in der industriellen Automatisierungstechnik -- Anforderungen und Umsetzung","supervisor":[{"first_name":"Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"}],"author":[{"last_name":"Tölke","full_name":"Tölke, Christian","first_name":"Christian"}],"date_created":"2018-11-07T16:10:00Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:52Z"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:53Z","author":[{"first_name":"Gunnar","full_name":"Wüllrich, Gunnar","last_name":"Wüllrich"}],"date_created":"2018-11-07T16:15:51Z","supervisor":[{"last_name":"Plessl","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153","first_name":"Christian"}],"title":"Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment","year":"2016","citation":{"ieee":"G. Wüllrich, <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","chicago":"Wüllrich, Gunnar. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","ama":"Wüllrich G. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn; 2016.","apa":"Wüllrich, G. (2016). <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn.","short":"G. Wüllrich, Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment, Universität Paderborn, 2016.","mla":"Wüllrich, Gunnar. <i>Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment</i>. Universität Paderborn, 2016.","bibtex":"@book{Wüllrich_2016, title={Dynamic OpenCL Task Scheduling for Energy and Performance in a Heterogeneous Environment}, publisher={Universität Paderborn}, author={Wüllrich, Gunnar}, year={2016} }"},"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14"}],"_id":"5420","user_id":"477","department":[{"_id":"27"},{"_id":"518"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"file_date_updated":"2018-11-08T13:04:30Z","extern":"1","user_id":"38235","department":[{"_id":"558"}],"_id":"5446","status":"public","type":"journal_article","main_file_link":[{"url":"https://petsymposium.org/2016/files/papers/Black-Box_Accumulation__Collecting_Incentives_in_a_Privacy-Preserving_Way.pdf"}],"doi":"10.1515/popets-2016-0016","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"last_name":"Rupp","full_name":"Rupp, Andy","first_name":"Andy"}],"volume":2016,"date_updated":"2022-01-06T07:01:54Z","citation":{"short":"T. Jager, A. Rupp, Proceedings on Privacy Enhancing Technologies 2016 (2016) 62–82.","bibtex":"@article{Jager_Rupp_2016, title={Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way}, volume={2016}, DOI={<a href=\"https://doi.org/10.1515/popets-2016-0016\">10.1515/popets-2016-0016</a>}, number={3}, journal={Proceedings on Privacy Enhancing Technologies}, publisher={Walter de Gruyter GmbH}, author={Jager, Tibor and Rupp, Andy}, year={2016}, pages={62–82} }","mla":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>Proceedings on Privacy Enhancing Technologies</i>, vol. 2016, no. 3, Walter de Gruyter GmbH, 2016, pp. 62–82, doi:<a href=\"https://doi.org/10.1515/popets-2016-0016\">10.1515/popets-2016-0016</a>.","apa":"Jager, T., &#38; Rupp, A. (2016). Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>Proceedings on Privacy Enhancing Technologies</i>, <i>2016</i>(3), 62–82. <a href=\"https://doi.org/10.1515/popets-2016-0016\">https://doi.org/10.1515/popets-2016-0016</a>","ieee":"T. Jager and A. Rupp, “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way,” <i>Proceedings on Privacy Enhancing Technologies</i>, vol. 2016, no. 3, pp. 62–82, 2016.","chicago":"Jager, Tibor, and Andy Rupp. “Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way.” <i>Proceedings on Privacy Enhancing Technologies</i> 2016, no. 3 (2016): 62–82. <a href=\"https://doi.org/10.1515/popets-2016-0016\">https://doi.org/10.1515/popets-2016-0016</a>.","ama":"Jager T, Rupp A. Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way. <i>Proceedings on Privacy Enhancing Technologies</i>. 2016;2016(3):62-82. doi:<a href=\"https://doi.org/10.1515/popets-2016-0016\">10.1515/popets-2016-0016</a>"},"page":"62-82","intvolume":"      2016","publication_status":"published","publication_identifier":{"issn":["2299-0984"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["006"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-08T13:04:30Z","creator":"abirke","date_created":"2018-11-08T13:04:30Z","file_size":750585,"file_id":"5447","access_level":"closed","file_name":"Black-Box_Accumulation__Collecting_Incentives_in_a_Privacy-Preserving_Way.pdf"}],"publication":"Proceedings on Privacy Enhancing Technologies","title":"Black-Box Accumulation: Collecting Incentives in a Privacy-Preserving Way","date_created":"2018-11-08T13:03:39Z","publisher":"Walter de Gruyter GmbH","year":"2016","issue":"3"},{"status":"public","publication":"Information Systems","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"66"},{"_id":"69"}],"user_id":"11308","_id":"6736","intvolume":"        56","page":"198-213","citation":{"apa":"Böttcher, S., Hartel, R., &#38; Wolters, D. (2016). S2CX: From relational data via SQL/XML to (Un-)Compressed XML. <i>Information Systems</i>, <i>56</i>, 198–213. <a href=\"https://doi.org/10.1016/j.is.2015.09.011\">https://doi.org/10.1016/j.is.2015.09.011</a>","mla":"Böttcher, Stefan, et al. “S2CX: From Relational Data via SQL/XML to (Un-)Compressed XML.” <i>Information Systems</i>, vol. 56, Elsevier BV, 2016, pp. 198–213, doi:<a href=\"https://doi.org/10.1016/j.is.2015.09.011\">10.1016/j.is.2015.09.011</a>.","bibtex":"@article{Böttcher_Hartel_Wolters_2016, title={S2CX: From relational data via SQL/XML to (Un-)Compressed XML}, volume={56}, DOI={<a href=\"https://doi.org/10.1016/j.is.2015.09.011\">10.1016/j.is.2015.09.011</a>}, journal={Information Systems}, publisher={Elsevier BV}, author={Böttcher, Stefan and Hartel, Rita and Wolters, Dennis}, year={2016}, pages={198–213} }","short":"S. Böttcher, R. Hartel, D. Wolters, Information Systems 56 (2016) 198–213.","ama":"Böttcher S, Hartel R, Wolters D. S2CX: From relational data via SQL/XML to (Un-)Compressed XML. <i>Information Systems</i>. 2016;56:198-213. doi:<a href=\"https://doi.org/10.1016/j.is.2015.09.011\">10.1016/j.is.2015.09.011</a>","ieee":"S. Böttcher, R. Hartel, and D. Wolters, “S2CX: From relational data via SQL/XML to (Un-)Compressed XML,” <i>Information Systems</i>, vol. 56, pp. 198–213, 2016.","chicago":"Böttcher, Stefan, Rita Hartel, and Dennis Wolters. “S2CX: From Relational Data via SQL/XML to (Un-)Compressed XML.” <i>Information Systems</i> 56 (2016): 198–213. <a href=\"https://doi.org/10.1016/j.is.2015.09.011\">https://doi.org/10.1016/j.is.2015.09.011</a>."},"year":"2016","publication_identifier":{"issn":["0306-4379"]},"publication_status":"published","doi":"10.1016/j.is.2015.09.011","title":"S2CX: From relational data via SQL/XML to (Un-)Compressed XML","volume":56,"date_created":"2019-01-15T14:05:01Z","author":[{"full_name":"Böttcher, Stefan","id":"624","last_name":"Böttcher","first_name":"Stefan"},{"first_name":"Rita","id":"14961","full_name":"Hartel, Rita","last_name":"Hartel"},{"full_name":"Wolters, Dennis","id":"11308","last_name":"Wolters","first_name":"Dennis"}],"date_updated":"2022-01-06T07:03:17Z","publisher":"Elsevier BV"},{"citation":{"mla":"Wolters, Dennis, et al. “Modeling Cross-Device Systems with Use Case Diagrams.” <i>Proceedings of the CAiSE’18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE’16)</i>, vol. 1612, CEUR-WS.org, 2016, pp. 89–96.","bibtex":"@inproceedings{Wolters_Gerth_Engels_2016, series={CEUR Workshop Proceedings}, title={Modeling Cross-Device Systems with Use Case Diagrams}, volume={1612}, booktitle={Proceedings of the CAiSE’18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE’16)}, publisher={CEUR-WS.org}, author={Wolters, Dennis and Gerth, Christian and Engels, Gregor}, year={2016}, pages={89–96}, collection={CEUR Workshop Proceedings} }","short":"D. Wolters, C. Gerth, G. Engels, in: Proceedings of the CAiSE’18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE’16), CEUR-WS.org, 2016, pp. 89–96.","apa":"Wolters, D., Gerth, C., &#38; Engels, G. (2016). Modeling Cross-Device Systems with Use Case Diagrams. In <i>Proceedings of the CAiSE’18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE’16)</i> (Vol. 1612, pp. 89–96). CEUR-WS.org.","ama":"Wolters D, Gerth C, Engels G. Modeling Cross-Device Systems with Use Case Diagrams. In: <i>Proceedings of the CAiSE’18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE’16)</i>. Vol 1612. CEUR Workshop Proceedings. CEUR-WS.org; 2016:89-96.","chicago":"Wolters, Dennis, Christian Gerth, and Gregor Engels. “Modeling Cross-Device Systems with Use Case Diagrams.” In <i>Proceedings of the CAiSE’18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE’16)</i>, 1612:89–96. CEUR Workshop Proceedings. CEUR-WS.org, 2016.","ieee":"D. Wolters, C. Gerth, and G. Engels, “Modeling Cross-Device Systems with Use Case Diagrams,” in <i>Proceedings of the CAiSE’18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE’16)</i>, 2016, vol. 1612, pp. 89–96."},"page":"89-96","intvolume":"      1612","year":"2016","author":[{"full_name":"Wolters, Dennis","id":"11308","last_name":"Wolters","first_name":"Dennis"},{"last_name":"Gerth","full_name":"Gerth, Christian","first_name":"Christian"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"date_created":"2019-01-15T14:46:18Z","volume":1612,"oa":"1","publisher":"CEUR-WS.org","date_updated":"2022-01-06T07:03:17Z","main_file_link":[{"open_access":"1","url":"http://ceur-ws.org/Vol-1612/paper12.pdf"}],"title":"Modeling Cross-Device Systems with Use Case Diagrams","type":"conference","publication":"Proceedings of the CAiSE'18 Forum at the 28th International Conference on Advanced Information Systems Engineering (CAiSE'16)","status":"public","series_title":"CEUR Workshop Proceedings","user_id":"11308","department":[{"_id":"66"}],"_id":"6739","language":[{"iso":"eng"}]},{"year":"2016","citation":{"apa":"Jovanovikj, I., Güldali, B., &#38; Grieger, M. (2016). Towards Applying Model-based Testing in Test Case Migration. <i>Softwaretechnik-Trends</i>, <i>36</i>(3).","short":"I. Jovanovikj, B. Güldali, M. Grieger, Softwaretechnik-Trends 36 (2016).","mla":"Jovanovikj, Ivan, et al. “Towards Applying Model-Based Testing in Test Case Migration.” <i>Softwaretechnik-Trends</i>, vol. 36, no. 3, 2016.","bibtex":"@article{Jovanovikj_Güldali_Grieger_2016, title={Towards Applying Model-based Testing in Test Case Migration}, volume={36}, number={3}, journal={Softwaretechnik-Trends}, author={Jovanovikj, Ivan and Güldali, Baris and Grieger, Marvin}, year={2016} }","ieee":"I. Jovanovikj, B. Güldali, and M. Grieger, “Towards Applying Model-based Testing in Test Case Migration,” <i>Softwaretechnik-Trends</i>, vol. 36, no. 3, 2016.","chicago":"Jovanovikj, Ivan, Baris Güldali, and Marvin Grieger. “Towards Applying Model-Based Testing in Test Case Migration.” <i>Softwaretechnik-Trends</i> 36, no. 3 (2016).","ama":"Jovanovikj I, Güldali B, Grieger M. Towards Applying Model-based Testing in Test Case Migration. <i>Softwaretechnik-Trends</i>. 2016;36(3)."},"intvolume":"        36","issue":"3","title":"Towards Applying Model-based Testing in Test Case Migration","conference":{"name":"39th Workshop Test, Analyse und Verifikation (TAV)","location":"Bremen"},"date_updated":"2022-01-06T07:03:17Z","date_created":"2019-01-16T09:47:57Z","author":[{"full_name":"Jovanovikj, Ivan","id":"39187","orcid":"https://orcid.org/0000-0002-1838-794X","last_name":"Jovanovikj","first_name":"Ivan"},{"full_name":"Güldali, Baris","last_name":"Güldali","first_name":"Baris"},{"last_name":"Grieger","full_name":"Grieger, Marvin","first_name":"Marvin"}],"volume":36,"status":"public","type":"journal_article","publication":"Softwaretechnik-Trends","language":[{"iso":"eng"}],"_id":"6766","user_id":"39187","department":[{"_id":"66"},{"_id":"534"}]},{"issue":"3","year":"2016","citation":{"bibtex":"@article{Jovanovikj_Grieger_Güldali_Teetz_2016, title={Reengineering of Legacy Test Cases: Problem Domain &#38; Scenarios}, volume={36}, number={3}, journal={Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)}, author={Jovanovikj, Ivan and Grieger, Marvin and Güldali, Baris and Teetz, Alexander}, year={2016} }","short":"I. Jovanovikj, M. Grieger, B. Güldali, A. Teetz, Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM) 36 (2016).","mla":"Jovanovikj, Ivan, et al. “Reengineering of Legacy Test Cases: Problem Domain &#38; Scenarios.” <i>Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)</i>, vol. 36, no. 3, 2016.","apa":"Jovanovikj, I., Grieger, M., Güldali, B., &#38; Teetz, A. (2016). Reengineering of Legacy Test Cases: Problem Domain &#38; Scenarios. <i>Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)</i>, <i>36</i>(3).","ama":"Jovanovikj I, Grieger M, Güldali B, Teetz A. Reengineering of Legacy Test Cases: Problem Domain &#38; Scenarios. <i>Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)</i>. 2016;36(3).","chicago":"Jovanovikj, Ivan, Marvin Grieger, Baris Güldali, and Alexander Teetz. “Reengineering of Legacy Test Cases: Problem Domain &#38; Scenarios.” <i>Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)</i> 36, no. 3 (2016).","ieee":"I. Jovanovikj, M. Grieger, B. Güldali, and A. Teetz, “Reengineering of Legacy Test Cases: Problem Domain &#38; Scenarios,” <i>Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)</i>, vol. 36, no. 3, 2016."},"intvolume":"        36","date_updated":"2022-01-06T07:03:17Z","author":[{"first_name":"Ivan","id":"39187","full_name":"Jovanovikj, Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X"},{"first_name":"Marvin","full_name":"Grieger, Marvin","last_name":"Grieger"},{"first_name":"Baris","full_name":"Güldali, Baris","last_name":"Güldali"},{"full_name":"Teetz, Alexander","id":"5319","last_name":"Teetz","first_name":"Alexander"}],"date_created":"2019-01-16T09:50:58Z","volume":36,"title":"Reengineering of Legacy Test Cases: Problem Domain & Scenarios","conference":{"name":"3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM 2016)","location":"Karlsruhe"},"type":"journal_article","publication":"Softwaretechnik-Trends, Proceedings of the 3rd Workshop Model-Based and Model-Driven Software Modernization (MMSM)","status":"public","_id":"6768","user_id":"39187","department":[{"_id":"66"},{"_id":"534"}],"language":[{"iso":"eng"}]},{"type":"mastersthesis","status":"public","department":[{"_id":"63"}],"user_id":"477","_id":"688","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"language":[{"iso":"eng"}],"citation":{"ieee":"D. Kutzias, <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","chicago":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","ama":"Kutzias D. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn; 2016.","mla":"Kutzias, Damian. <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn, 2016.","short":"D. Kutzias, Friendship Processes in Network Creation Games, Universität Paderborn, 2016.","bibtex":"@book{Kutzias_2016, title={Friendship Processes in Network Creation Games}, publisher={Universität Paderborn}, author={Kutzias, Damian}, year={2016} }","apa":"Kutzias, D. (2016). <i>Friendship Processes in Network Creation Games</i>. Universität Paderborn."},"year":"2016","author":[{"first_name":"Damian","last_name":"Kutzias","full_name":"Kutzias, Damian"}],"supervisor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2017-11-14T06:50:35Z","date_updated":"2022-01-06T07:03:23Z","publisher":"Universität Paderborn","title":"Friendship Processes in Network Creation Games"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"689","citation":{"ama":"Schaefer JS. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn; 2016.","ieee":"J. S. Schaefer, <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","chicago":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","short":"J.S. Schaefer, Routing Algorithms on Delayed Networks for Disaster Management Support, Universität Paderborn, 2016.","bibtex":"@book{Schaefer_2016, title={Routing Algorithms on Delayed Networks for Disaster Management Support}, publisher={Universität Paderborn}, author={Schaefer, Johannes Sebastian}, year={2016} }","mla":"Schaefer, Johannes Sebastian. <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn, 2016.","apa":"Schaefer, J. S. (2016). <i>Routing Algorithms on Delayed Networks for Disaster Management Support</i>. Universität Paderborn."},"year":"2016","title":"Routing Algorithms on Delayed Networks for Disaster Management Support","author":[{"first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian","id":"30291","last_name":"Schaefer"}],"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2017-11-14T06:51:37Z","date_updated":"2022-01-06T07:03:23Z","publisher":"Universität Paderborn"},{"author":[{"first_name":"Andreas ","full_name":"Cord-Landwehr, Andreas ","last_name":"Cord-Landwehr"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Daniel","last_name":"Jung","id":"37827","full_name":"Jung, Daniel"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-07T07:20:47Z","date_updated":"2022-01-06T06:52:50Z","title":"Asymptotically Optimal Gathering on a Grid","citation":{"mla":"Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” <i>ArXiv:1602.03303</i>, 2016.","bibtex":"@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr, Andreas  and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016} }","short":"A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303 (2016).","apa":"Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. <i>ArXiv:1602.03303</i>.","chicago":"Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” <i>ArXiv:1602.03303</i>, 2016.","ieee":"A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” <i>arXiv:1602.03303</i>. 2016.","ama":"Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. <i>arXiv:160203303</i>. 2016."},"year":"2016","department":[{"_id":"63"}],"user_id":"15415","external_id":{"arxiv":["1602.03303"]},"_id":"16450","language":[{"iso":"eng"}],"publication":"arXiv:1602.03303","type":"preprint","status":"public","abstract":[{"text":"In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable, point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal neighbors on the grid. The\r\nlocality constraint means that no global control, no compass, no global\r\ncommunication and only local vision is available; hence, a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which also limits its\r\nmovements. A robot can move to one of its eight neighboring grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged} to be only\r\none robot. The locality constraint is the significant challenging issue here,\r\nsince robot movements must not harm the (only globally checkable) swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm -- executed by every robot -- which ensures that robots merge without\r\nbreaking the swarm connectivity. In our model, robots can obtain a special\r\nstate, which marks such a robot to be performing specific connectivity\r\npreserving movements in order to allow later merge operations of the swarm.\r\nCompared to the grid, for gathering in the Euclidean plane for the same robot\r\nand time model the best known upper bound is $\\mathcal{O}(n^2)$.","lang":"eng"}]},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subprojekt C4"},{"_id":"4","name":"SFB 901 - Project Area C"},{"call_identifier":"5G PPP Phase 1","grant_number":"671517","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","_id":"25"}],"_id":"166","user_id":"31764","department":[{"_id":"75"}],"ddc":["040"],"file_date_updated":"2018-06-25T07:53:54Z","type":"conference","publication":"Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)","abstract":[{"text":"Network function virtualization and software-defined networking allow services consisting of virtual network functions to be designed and implemented with great flexibility by facilitating automatic deployments, migrations, and reconfigurations for services and their components. For extended flexibility, we go beyond seeing services as a fixed chain of functions. We present a YANG model for describing the service structure in deployment requests in a flexible way that enables changing the order of functions in case the order of traversing them does not affect the functionality of the service. Upon receiving such requests, the network orchestration system can choose the optimal composition of service components that gives the best results for placement of services in the network. This introduces new complexities to the placement problem by greatly increasing the number of possible ways a service can be composed. In this paper, we describe a heuristic solution that selects a Pareto set of the possible compositions of a service as well as possible combinations of different services, with respect to different resource requirements of the services. Our evaluations show that the selected combinations consist of representative samples of possible structures and requirements and therefore, can result in optimal or close-to-optimal placement results.","lang":"eng"}],"urn":"1665","file":[{"file_name":"RIS.pdf","access_level":"open_access","file_id":"3322","file_size":1471937,"creator":"sevilmeh","date_created":"2018-06-25T07:53:54Z","date_updated":"2018-06-25T07:53:54Z","relation":"main_file","content_type":"application/pdf"}],"status":"public","oa":"1","date_updated":"2022-01-06T06:52:53Z","author":[{"last_name":"Dräxler","id":"31764","full_name":"Dräxler, Sevil","first_name":"Sevil"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"date_created":"2017-10-17T12:41:24Z","title":"Placement of Services with Flexible Structures Specified by a YANG Data Model","main_file_link":[{"url":"http://ieeexplore.ieee.org/search/searchresult.jsp?newsearch=true&queryText=10.1109%2FNETSOFT.2016.7502412"}],"doi":"10.1109/NETSOFT.2016.7502412","has_accepted_license":"1","year":"2016","citation":{"short":"S. Dräxler, H. Karl, in: Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft), 2016, pp. 184--192.","mla":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192, doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>.","bibtex":"@inproceedings{Dräxler_Karl_2016, title={Placement of Services with Flexible Structures Specified by a YANG Data Model}, DOI={<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>}, booktitle={Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)}, author={Dräxler, Sevil and Karl, Holger}, year={2016}, pages={184--192} }","apa":"Dräxler, S., &#38; Karl, H. (2016). Placement of Services with Flexible Structures Specified by a YANG Data Model. In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i> (pp. 184--192). <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>","ama":"Dräxler S, Karl H. Placement of Services with Flexible Structures Specified by a YANG Data Model. In: <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>. ; 2016:184--192. doi:<a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">10.1109/NETSOFT.2016.7502412</a>","chicago":"Dräxler, Sevil, and Holger Karl. “Placement of Services with Flexible Structures Specified by a YANG Data Model.” In <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 184--192, 2016. <a href=\"https://doi.org/10.1109/NETSOFT.2016.7502412\">https://doi.org/10.1109/NETSOFT.2016.7502412</a>.","ieee":"S. Dräxler and H. Karl, “Placement of Services with Flexible Structures Specified by a YANG Data Model,” in <i>Proceedings of the 2nd International IEEE Conference on Network Softwarization (NetSoft)</i>, 2016, pp. 184--192."},"page":"184--192"},{"_id":"167","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"64"}],"user_id":"25078","ddc":["040"],"file_date_updated":"2018-03-21T12:43:21Z","type":"dissertation","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T12:43:21Z","date_created":"2018-03-21T12:43:21Z","creator":"florida","file_size":9456552,"file_id":"1542","access_level":"closed","file_name":"167-thesis_peter_guenther.pdf"}],"date_updated":"2022-01-06T06:52:54Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"date_created":"2017-10-17T12:41:24Z","author":[{"last_name":"Günther","full_name":"Günther, Peter","first_name":"Peter"}],"title":"Physical attacks on pairing-based cryptography","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-24853"}],"has_accepted_license":"1","year":"2016","citation":{"ama":"Günther P. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn; 2016.","ieee":"P. Günther, <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn, 2016.","chicago":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","apa":"Günther, P. (2016). <i>Physical attacks on pairing-based cryptography</i>. Universität Paderborn.","mla":"Günther, Peter. <i>Physical Attacks on Pairing-Based Cryptography</i>. Universität Paderborn, 2016.","short":"P. Günther, Physical Attacks on Pairing-Based Cryptography, Universität Paderborn, 2016.","bibtex":"@book{Günther_2016, title={Physical attacks on pairing-based cryptography}, publisher={Universität Paderborn}, author={Günther, Peter}, year={2016} }"}},{"title":"Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application","doi":"10.1007/978-3-319-30668-1_18","date_updated":"2022-01-06T06:52:58Z","date_created":"2017-10-17T12:41:25Z","author":[{"first_name":"Thomas","last_name":"Kühne","id":"49079","full_name":"Kühne, Thomas"},{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"full_name":"Arifulina, Svetlana","last_name":"Arifulina","first_name":"Svetlana"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"}],"year":"2016","page":"278--293","citation":{"bibtex":"@inproceedings{Kühne_Hamann_Arifulina_Engels_2016, series={LNCS 9594}, title={Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>}, booktitle={Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)}, author={Kühne, Thomas and Hamann, Heiko and Arifulina, Svetlana and Engels, Gregor}, year={2016}, pages={278--293}, collection={LNCS 9594} }","short":"T. Kühne, H. Hamann, S. Arifulina, G. Engels, in: Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016), 2016, pp. 278--293.","mla":"Kühne, Thomas, et al. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 2016, pp. 278--293, doi:<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>.","apa":"Kühne, T., Hamann, H., Arifulina, S., &#38; Engels, G. (2016). Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i> (pp. 278--293). <a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">https://doi.org/10.1007/978-3-319-30668-1_18</a>","ama":"Kühne T, Hamann H, Arifulina S, Engels G. Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application. In: <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>. LNCS 9594. ; 2016:278--293. doi:<a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">10.1007/978-3-319-30668-1_18</a>","ieee":"T. Kühne, H. Hamann, S. Arifulina, and G. Engels, “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application,” in <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 2016, pp. 278--293.","chicago":"Kühne, Thomas, Heiko Hamann, Svetlana Arifulina, and Gregor Engels. “Patterns for Constructing Mutation Operators: Limiting the Search Space in a Software Engineering Application.” In <i>Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)</i>, 278--293. LNCS 9594, 2016. <a href=\"https://doi.org/10.1007/978-3-319-30668-1_18\">https://doi.org/10.1007/978-3-319-30668-1_18</a>."},"has_accepted_license":"1","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T12:41:08Z","_id":"169","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"66"},{"_id":"238"},{"_id":"63"}],"series_title":"LNCS 9594","user_id":"57458","abstract":[{"lang":"eng","text":"We apply methods of genetic programming to a general problem from software engineering, namely example-based generation of specifications. In particular, we focus on model transformation by example. The definition and implementation of model transformations is a task frequently carried out by domain experts, hence, a (semi-)automatic approach is desirable. This application is challenging because the underlying search space has rich semantics, is high-dimensional, and unstructured. Hence, a computationally brute-force approach would be unscalable and potentially infeasible. To address that problem, we develop a sophisticated approach of designing complex mutation operators. We define ‘patterns’ for constructing mutation operators and report a successful case study. Furthermore, the code of the evolved model transformation is required to have high maintainability and extensibility, that is, the code should be easily readable by domain experts. We report an evaluation of this approach in a software engineering case study."}],"status":"public","file":[{"access_level":"closed","file_name":"169-kuehne.pdf","file_id":"1540","file_size":2069427,"creator":"florida","date_created":"2018-03-21T12:41:08Z","date_updated":"2018-03-21T12:41:08Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the 19th European Conference on Genetic Programming (EuroGP 2016)","type":"conference"},{"status":"public","file":[{"file_size":285299,"file_id":"1539","file_name":"170-main_04.pdf","access_level":"closed","date_updated":"2018-03-21T12:40:27Z","creator":"florida","date_created":"2018-03-21T12:40:27Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"editor":[{"last_name":"Ishikawa F, Romanovsky A","full_name":"Ishikawa F, Romanovsky A, Troubitsyna E","first_name":"Troubitsyna E"}],"abstract":[{"lang":"eng","text":"We present PAndA2, an extendable, static analysis tool for Android  apps  which  examines  permission  related security  threats  like overprivilege, existence of permission redelegation and permission flows. PAndA2 comes along with a textual and graphical visualization of the analysis result and even supports the comparison of analysis results for different android app versions."}],"publication":"Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems","type":"conference","file_date_updated":"2018-03-21T12:40:27Z","ddc":["040"],"department":[{"_id":"77"}],"user_id":"15504","series_title":"School of Computing Science Technical Report Series","_id":"170","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"ama":"Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>. School of Computing Science Technical Report Series. ; 2016.","chicago":"Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” In <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical Report Series, 2016.","ieee":"M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper),” in <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, 2016.","apa":"Jakobs, M.-C., Töws, M., &#38; Pauck, F. (2016). PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>.","bibtex":"@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna EEditor}, year={2016}, collection={School of Computing Science Technical Report Series} }","short":"M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.","mla":"Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A, 2016."},"year":"2016","related_material":{"link":[{"url":"https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf","relation":"contains"}]},"has_accepted_license":"1","title":"PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)","date_created":"2017-10-17T12:41:25Z","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Töws, Manuel","id":"11315","last_name":"Töws","first_name":"Manuel"},{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"}],"date_updated":"2022-01-06T06:53:01Z"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"3118","department":[{"_id":"78"}],"_id":"10612","citation":{"mla":"Cedric Mertens, Jan. <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University, 2016.","bibtex":"@book{Cedric Mertens_2016, title={Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion}, publisher={Paderborn University}, author={Cedric Mertens, Jan}, year={2016} }","short":"J. Cedric Mertens, Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion, Paderborn University, 2016.","apa":"Cedric Mertens, J. (2016). <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University.","ama":"Cedric Mertens J. <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University; 2016.","chicago":"Cedric Mertens, Jan. <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University, 2016.","ieee":"J. Cedric Mertens, <i>Sprint Diagnostic with RTK-GPS \\&#38; IMU Sensor Fusion</i>. Paderborn University, 2016."},"year":"2016","title":"Sprint Diagnostic with RTK-GPS \\& IMU Sensor Fusion","author":[{"first_name":"Jan","last_name":"Cedric Mertens","full_name":"Cedric Mertens, Jan"}],"date_created":"2019-07-10T09:23:26Z","publisher":"Paderborn University","date_updated":"2022-01-06T06:50:47Z"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"10616","department":[{"_id":"78"}],"user_id":"3118","year":"2016","citation":{"apa":"Nassery, A. S. (2016). <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University.","mla":"Nassery, Abdul Sami. <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University, 2016.","bibtex":"@book{Nassery_2016, title={Implementation of Bilinear Pairings on Reconfigurable Hardware}, publisher={Paderborn University}, author={Nassery, Abdul Sami}, year={2016} }","short":"A.S. Nassery, Implementation of Bilinear Pairings on Reconfigurable Hardware, Paderborn University, 2016.","ama":"Nassery AS. <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University; 2016.","chicago":"Nassery, Abdul Sami. <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University, 2016.","ieee":"A. S. Nassery, <i>Implementation of Bilinear Pairings on Reconfigurable Hardware</i>. Paderborn University, 2016."},"title":"Implementation of Bilinear Pairings on Reconfigurable Hardware","publisher":"Paderborn University","date_updated":"2022-01-06T06:50:47Z","date_created":"2019-07-10T09:25:14Z","supervisor":[{"first_name":"Paul","full_name":"Kaufmann, Paul","last_name":"Kaufmann"}],"author":[{"first_name":"Abdul Sami","full_name":"Nassery, Abdul Sami","last_name":"Nassery"}]},{"citation":{"apa":"Amin, O. (2016). <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method</i>. Paderborn University.","mla":"Amin, Omair. <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method</i>. Paderborn University, 2016.","short":"O. Amin, Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method, Paderborn University, 2016.","bibtex":"@book{Amin_2016, title={Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method}, publisher={Paderborn University}, author={Amin, Omair}, year={2016} }","ama":"Amin O. <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method</i>. Paderborn University; 2016.","ieee":"O. Amin, <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method</i>. Paderborn University, 2016.","chicago":"Amin, Omair. <i>Acceleration of EMTP for Distribution Networks on Data Flow Machines Using the Latency Insertion Method</i>. Paderborn University, 2016."},"year":"2016","date_created":"2019-07-10T09:25:15Z","supervisor":[{"first_name":"Paul","last_name":"Kaufmann","full_name":"Kaufmann, Paul"}],"author":[{"full_name":"Amin, Omair","last_name":"Amin","first_name":"Omair"}],"date_updated":"2022-01-06T06:50:47Z","publisher":"Paderborn University","title":"Acceleration of EMTP for Distribution Networks on Data Flow Machines using the Latency Insertion Method","type":"mastersthesis","status":"public","user_id":"3118","department":[{"_id":"78"}],"_id":"10617","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"3118","_id":"10622","status":"public","publication":"Euromicro Conference on Digital System Design (DSD)","type":"conference","doi":"10.1109/DSD.2016.35","title":"Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs","author":[{"first_name":"Jahanzeb","full_name":"Anwer, Jahanzeb","last_name":"Anwer"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2019-07-10T09:33:00Z","date_updated":"2022-01-06T06:50:48Z","citation":{"ama":"Anwer J, Platzner M. Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs. In: <i>Euromicro Conference on Digital System Design (DSD)</i>. ; 2016. doi:<a href=\"https://doi.org/10.1109/DSD.2016.35\">10.1109/DSD.2016.35</a>","ieee":"J. Anwer and M. Platzner, “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs,” in <i>Euromicro Conference on Digital System Design (DSD)</i>, 2016.","chicago":"Anwer, Jahanzeb, and Marco Platzner. “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs.” In <i>Euromicro Conference on Digital System Design (DSD)</i>, 2016. <a href=\"https://doi.org/10.1109/DSD.2016.35\">https://doi.org/10.1109/DSD.2016.35</a>.","bibtex":"@inproceedings{Anwer_Platzner_2016, title={Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs}, DOI={<a href=\"https://doi.org/10.1109/DSD.2016.35\">10.1109/DSD.2016.35</a>}, booktitle={Euromicro Conference on Digital System Design (DSD)}, author={Anwer, Jahanzeb and Platzner, Marco}, year={2016} }","short":"J. Anwer, M. Platzner, in: Euromicro Conference on Digital System Design (DSD), 2016.","mla":"Anwer, Jahanzeb, and Marco Platzner. “Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs.” <i>Euromicro Conference on Digital System Design (DSD)</i>, 2016, doi:<a href=\"https://doi.org/10.1109/DSD.2016.35\">10.1109/DSD.2016.35</a>.","apa":"Anwer, J., &#38; Platzner, M. (2016). Boolean Difference Based Reliability Evaluation of Fault Tolerant Circuit Structures on FPGAs. In <i>Euromicro Conference on Digital System Design (DSD)</i>. <a href=\"https://doi.org/10.1109/DSD.2016.35\">https://doi.org/10.1109/DSD.2016.35</a>"},"year":"2016"}]