[{"user_id":"477","language":[{"iso":"eng"}],"_id":"5948","publisher":"Universität Paderborn","date_updated":"2022-11-30T14:22:04Z","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"status":"public","title":"Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens","year":"2017","department":[{"_id":"205"}],"type":"bachelorsthesis","date_created":"2018-11-28T11:25:19Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"citation":{"mla":"N, N. <i>Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017.","ama":"N N. <i>Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens</i>. Universität Paderborn; 2017.","bibtex":"@book{N_2017, title={Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","apa":"N, N. (2017). <i>Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens</i>. Universität Paderborn.","ieee":"N. N, <i>Multiattributive elektronische Verhandlungen. Eine Anwendung des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017.","short":"N. N, Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens, Universität Paderborn, 2017.","chicago":"N, N. <i>Multiattributive Elektronische Verhandlungen. Eine Anwendung Des Adjusted Winner Verfahrens</i>. Universität Paderborn, 2017."}},{"citation":{"chicago":"N, N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2017.","short":"N. N, Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse, Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse</i>. Universität Paderborn.","ieee":"N. N, <i>Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2017.","ama":"N N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn; 2017.","bibtex":"@book{N_2017, title={Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","mla":"N, N. <i>Machtindizes in Politischen Netzwerken - Eine Spieltheoretische Analyse</i>. Universität Paderborn, 2017."},"supervisor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2018-11-28T11:27:27Z","type":"bachelorsthesis","department":[{"_id":"205"}],"year":"2017","status":"public","title":"Machtindizes in politischen Netzwerken - Eine spieltheoretische Analyse","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"date_updated":"2022-11-30T14:21:49Z","publisher":"Universität Paderborn","_id":"5949","language":[{"iso":"eng"}],"user_id":"477"},{"department":[{"_id":"205"}],"type":"bachelorsthesis","date_created":"2018-11-28T10:45:18Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake"}],"citation":{"mla":"N, N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017.","ama":"N N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. Universität Paderborn; 2017.","bibtex":"@book{N_2017, title={Dynamische multikriterielle Lohnverhandlungen}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","apa":"N, N. (2017). <i>Dynamische multikriterielle Lohnverhandlungen</i>. Universität Paderborn.","ieee":"N. N, <i>Dynamische multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017.","chicago":"N, N. <i>Dynamische Multikriterielle Lohnverhandlungen</i>. Universität Paderborn, 2017.","short":"N. N, Dynamische Multikriterielle Lohnverhandlungen, Universität Paderborn, 2017."},"user_id":"477","publisher":"Universität Paderborn","_id":"5943","language":[{"iso":"eng"}],"date_updated":"2022-11-30T14:21:35Z","author":[{"first_name":"N","last_name":"N","full_name":"N, N"}],"title":"Dynamische multikriterielle Lohnverhandlungen","status":"public","year":"2017"},{"date_created":"2018-11-28T10:43:55Z","department":[{"_id":"205"}],"type":"bachelorsthesis","citation":{"bibtex":"@book{N_2017, title={Kooperative Standortspiele}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","short":"N. N, Kooperative Standortspiele, Universität Paderborn, 2017.","ama":"N N. <i>Kooperative Standortspiele</i>. Universität Paderborn; 2017.","chicago":"N, N. <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017.","mla":"N, N. <i>Kooperative Standortspiele</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Kooperative Standortspiele</i>. Universität Paderborn."},"supervisor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"_id":"5942","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","author":[{"full_name":"N, N","first_name":"N","last_name":"N"}],"status":"public","year":"2017","title":"Kooperative Standortspiele","date_updated":"2022-11-30T14:21:18Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"supervisor":[{"id":"20801","first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"}],"citation":{"chicago":"N, N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn, 2017.","short":"N. N, Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung, Universität Paderborn, 2017.","ieee":"N. N, <i>Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung</i>. Universität Paderborn.","bibtex":"@book{N_2017, title={Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","ama":"N N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn; 2017.","mla":"N, N. <i>Wie Können Aufteilungsprobleme Gelöst Werden? Prozedurale Ansätze Zur Konfliktlösung</i>. Universität Paderborn, 2017."},"type":"bachelorsthesis","department":[{"_id":"205"}],"date_created":"2018-11-28T10:47:20Z","date_updated":"2022-11-30T14:22:56Z","status":"public","title":"Wie können Aufteilungsprobleme gelöst werden? Prozedurale Ansätze zur Konfliktlösung","year":"2017","author":[{"last_name":"N","first_name":"N","full_name":"N, N"}],"user_id":"477","_id":"5944","language":[{"iso":"eng"}],"publisher":"Universität Paderborn"},{"user_id":"477","publisher":"Universität Paderborn","_id":"5947","language":[{"iso":"eng"}],"date_updated":"2022-11-30T14:22:18Z","author":[{"last_name":"N","first_name":"N","full_name":"N, N"}],"status":"public","title":"Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -","year":"2017","department":[{"_id":"205"}],"type":"bachelorsthesis","date_created":"2018-11-28T11:18:01Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"citation":{"short":"N. N, Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -, Universität Paderborn, 2017.","chicago":"N, N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -</i>. Universität Paderborn.","bibtex":"@book{N_2017, title={Produkte und Dienstleistungen im Paket - Eine Analyse der strategischen Preissetzung -}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","ama":"N N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn; 2017.","mla":"N, N. <i>Produkte Und Dienstleistungen Im Paket - Eine Analyse Der Strategischen Preissetzung -</i>. Universität Paderborn, 2017."}},{"author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"title":"Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments","status":"public","year":"2017","date_updated":"2022-11-30T14:22:33Z","_id":"5945","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","supervisor":[{"id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"}],"citation":{"short":"N. N, Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments, Universität Paderborn, 2017.","chicago":"N, N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn, 2017.","ieee":"N. N, <i>Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments</i>. Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments</i>. Universität Paderborn.","bibtex":"@book{N_2017, title={Simultane bilatrale Verhandlungen - Die Zusammenstellung eines Sortiments}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","ama":"N N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn; 2017.","mla":"N, N. <i>Simultane Bilatrale Verhandlungen - Die Zusammenstellung Eines Sortiments</i>. Universität Paderborn, 2017."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"date_created":"2018-11-28T10:49:30Z","department":[{"_id":"205"}],"type":"bachelorsthesis"},{"type":"bachelorsthesis","department":[{"_id":"205"}],"date_created":"2018-11-28T11:34:03Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"citation":{"apa":"N, N. (2017). <i>Netzwerkeffekte auf zweiseitigen Märkten - Eine ökonomische Betrachtung der Modelle</i>. Universität Paderborn.","ieee":"N. N, <i>Netzwerkeffekte auf zweiseitigen Märkten - Eine ökonomische Betrachtung der Modelle</i>. Universität Paderborn, 2017.","chicago":"N, N. <i>Netzwerkeffekte Auf Zweiseitigen Märkten - Eine Ökonomische Betrachtung Der Modelle</i>. Universität Paderborn, 2017.","short":"N. N, Netzwerkeffekte Auf Zweiseitigen Märkten - Eine Ökonomische Betrachtung Der Modelle, Universität Paderborn, 2017.","mla":"N, N. <i>Netzwerkeffekte Auf Zweiseitigen Märkten - Eine Ökonomische Betrachtung Der Modelle</i>. Universität Paderborn, 2017.","ama":"N N. <i>Netzwerkeffekte Auf Zweiseitigen Märkten - Eine Ökonomische Betrachtung Der Modelle</i>. Universität Paderborn; 2017.","bibtex":"@book{N_2017, title={Netzwerkeffekte auf zweiseitigen Märkten - Eine ökonomische Betrachtung der Modelle}, publisher={Universität Paderborn}, author={N, N}, year={2017} }"},"supervisor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake","id":"20801"}],"user_id":"477","publisher":"Universität Paderborn","_id":"5952","language":[{"iso":"eng"}],"date_updated":"2022-11-30T14:28:07Z","status":"public","year":"2017","title":"Netzwerkeffekte auf zweiseitigen Märkten - Eine ökonomische Betrachtung der Modelle","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}]},{"user_id":"477","publisher":"Universität Paderborn","_id":"5953","language":[{"iso":"eng"}],"date_updated":"2022-11-30T14:28:29Z","author":[{"last_name":"N","first_name":"N","full_name":"N, N"}],"year":"2017","title":"Optimale Projektverträge unter Kostenunsicherheit","status":"public","department":[{"_id":"205"}],"type":"bachelorsthesis","date_created":"2018-11-28T11:37:16Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"supervisor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801"}],"citation":{"ama":"N N. <i>Optimale Projektverträge Unter Kostenunsicherheit</i>. Universität Paderborn; 2017.","bibtex":"@book{N_2017, title={Optimale Projektverträge unter Kostenunsicherheit}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","mla":"N, N. <i>Optimale Projektverträge Unter Kostenunsicherheit</i>. Universität Paderborn, 2017.","chicago":"N, N. <i>Optimale Projektverträge Unter Kostenunsicherheit</i>. Universität Paderborn, 2017.","short":"N. N, Optimale Projektverträge Unter Kostenunsicherheit, Universität Paderborn, 2017.","apa":"N, N. (2017). <i>Optimale Projektverträge unter Kostenunsicherheit</i>. Universität Paderborn.","ieee":"N. N, <i>Optimale Projektverträge unter Kostenunsicherheit</i>. Universität Paderborn, 2017."}},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"citation":{"ama":"N N. <i>How Do Differentiated Goods Affect Coopetition?</i> Universität Paderborn; 2017.","bibtex":"@book{N_2017, title={How do differentiated goods affect coopetition?}, publisher={Universität Paderborn}, author={N, N}, year={2017} }","mla":"N, N. <i>How Do Differentiated Goods Affect Coopetition?</i> Universität Paderborn, 2017.","short":"N. N, How Do Differentiated Goods Affect Coopetition?, Universität Paderborn, 2017.","chicago":"N, N. <i>How Do Differentiated Goods Affect Coopetition?</i> Universität Paderborn, 2017.","apa":"N, N. (2017). <i>How do differentiated goods affect coopetition?</i> Universität Paderborn.","ieee":"N. N, <i>How do differentiated goods affect coopetition?</i> Universität Paderborn, 2017."},"supervisor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen","id":"20801"}],"department":[{"_id":"205"}],"type":"bachelorsthesis","date_created":"2018-11-28T11:32:39Z","date_updated":"2022-11-30T14:27:49Z","author":[{"full_name":"N, N","last_name":"N","first_name":"N"}],"status":"public","year":"2017","title":"How do differentiated goods affect coopetition?","user_id":"477","_id":"5951","publisher":"Universität Paderborn","language":[{"iso":"eng"}]},{"department":[{"_id":"276"}],"type":"conference_abstract","date_created":"2017-10-17T12:41:16Z","file":[{"file_id":"5492","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-11-12T10:37:57Z","file_name":"WP_Airbnb__v3.pdf","file_size":599900,"access_level":"closed","date_created":"2018-11-12T10:37:57Z","creator":"d0mi"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@inproceedings{Neumann_Gutt_Kundisch_2017, title={A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings}, author={Neumann, Jürgen and Gutt, Dominik and Kundisch, Dennis}, year={2017} }","ama":"Neumann J, Gutt D, Kundisch D. A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings. In: ; 2017.","short":"J. Neumann, D. Gutt, D. Kundisch, in: 2017.","chicago":"Neumann, Jürgen, Dominik Gutt, and Dennis Kundisch. “A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings,” 2017.","ieee":"J. Neumann, D. Gutt, and D. Kundisch, “A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings,” presented at the INFORMS Conference on Information Systems and Technology (CIST), Houston, USA, 2017.","apa":"Neumann, J., Gutt, D., &#38; Kundisch, D. (2017). <i>A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings</i>. INFORMS Conference on Information Systems and Technology (CIST), Houston, USA.","mla":"Neumann, Jürgen, et al. <i>A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings</i>. 2017."},"file_date_updated":"2018-11-12T10:37:57Z","ddc":["330"],"user_id":"16205","_id":"127","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-02-04T10:45:00Z","conference":{"location":"Houston, USA","name":"INFORMS Conference on Information Systems and Technology (CIST)"},"author":[{"id":"32456","first_name":"Jürgen","last_name":"Neumann","full_name":"Neumann, Jürgen"},{"full_name":"Gutt, Dominik","first_name":"Dominik","last_name":"Gutt","id":"14368"},{"id":"21117","full_name":"Kundisch, Dennis","first_name":"Dennis","last_name":"Kundisch"}],"title":"A Homeowner’s Guide to Airbnb: Theory and Empirical Evidence for Optimal Pricing Conditional on Online Ratings","year":"2017","status":"public"},{"user_id":"14931","language":[{"iso":"ger"}],"_id":"75","publisher":"Universität Paderborn","date_updated":"2024-01-02T16:05:14Z","author":[{"full_name":"Leffrang, Dirk","last_name":"Leffrang","orcid":"0000-0001-9004-2391","first_name":"Dirk","id":"51271"}],"status":"public","title":"Online-Bewertung und Preissetzung auf Airbnb","year":"2017","type":"bachelorsthesis","date_created":"2017-10-17T12:41:06Z","project":[{"grant_number":"160364472","_id":"1","name":"SFB 901"},{"grant_number":"160364472","_id":"8","name":"SFB 901 - Subprojekt A4"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"short":"D. Leffrang, Online-Bewertung und Preissetzung auf Airbnb, Universität Paderborn, 2017.","chicago":"Leffrang, Dirk. <i>Online-Bewertung und Preissetzung auf Airbnb</i>. Universität Paderborn, 2017.","apa":"Leffrang, D. (2017). <i>Online-Bewertung und Preissetzung auf Airbnb</i>. Universität Paderborn.","ieee":"D. Leffrang, <i>Online-Bewertung und Preissetzung auf Airbnb</i>. Universität Paderborn, 2017.","ama":"Leffrang D. <i>Online-Bewertung und Preissetzung auf Airbnb</i>. Universität Paderborn; 2017.","bibtex":"@book{Leffrang_2017, title={Online-Bewertung und Preissetzung auf Airbnb}, publisher={Universität Paderborn}, author={Leffrang, Dirk}, year={2017} }","mla":"Leffrang, Dirk. <i>Online-Bewertung und Preissetzung auf Airbnb</i>. Universität Paderborn, 2017."}},{"has_accepted_license":"1","status":"public","volume":10,"user_id":"15278","ddc":["000"],"_id":"18","publisher":"Association for Computing Machinery (ACM)","page":"24:1-24:23","project":[{"name":"SFB 901","grant_number":"160364472","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","grant_number":"160364472","_id":"14"},{"name":"Self-Adaptive Virtualisation-Aware High-Performance/Low-Energy Heterogeneous System Architectures","_id":"34","grant_number":"610996"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"quality_controlled":"1","citation":{"apa":"Riebler, H., Lass, M., Mittendorf, R., Löcke, T., &#38; Plessl, C. (2017). Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, <i>10</i>(3), 24:1-24:23. <a href=\"https://doi.org/10.1145/3053687\">https://doi.org/10.1145/3053687</a>","ieee":"H. Riebler, M. Lass, R. Mittendorf, T. Löcke, and C. Plessl, “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs,” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 10, no. 3, p. 24:1-24:23, 2017, doi: <a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>.","chicago":"Riebler, Heinrich, Michael Lass, Robert Mittendorf, Thomas Löcke, and Christian Plessl. “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i> 10, no. 3 (2017): 24:1-24:23. <a href=\"https://doi.org/10.1145/3053687\">https://doi.org/10.1145/3053687</a>.","short":"H. Riebler, M. Lass, R. Mittendorf, T. Löcke, C. Plessl, ACM Transactions on Reconfigurable Technology and Systems (TRETS) 10 (2017) 24:1-24:23.","mla":"Riebler, Heinrich, et al. “Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs.” <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>, vol. 10, no. 3, Association for Computing Machinery (ACM), 2017, p. 24:1-24:23, doi:<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>.","ama":"Riebler H, Lass M, Mittendorf R, Löcke T, Plessl C. Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs. <i>ACM Transactions on Reconfigurable Technology and Systems (TRETS)</i>. 2017;10(3):24:1-24:23. doi:<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>","bibtex":"@article{Riebler_Lass_Mittendorf_Löcke_Plessl_2017, title={Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs}, volume={10}, DOI={<a href=\"https://doi.org/10.1145/3053687\">10.1145/3053687</a>}, number={3}, journal={ACM Transactions on Reconfigurable Technology and Systems (TRETS)}, publisher={Association for Computing Machinery (ACM)}, author={Riebler, Heinrich and Lass, Michael and Mittendorf, Robert and Löcke, Thomas and Plessl, Christian}, year={2017}, pages={24:1-24:23} }"},"file_date_updated":"2018-11-02T16:04:14Z","intvolume":"        10","publication_status":"published","date_updated":"2023-09-26T13:23:58Z","publication_identifier":{"issn":["1936-7406"]},"author":[{"id":"8961","first_name":"Heinrich","last_name":"Riebler","full_name":"Riebler, Heinrich"},{"id":"24135","full_name":"Lass, Michael","first_name":"Michael","last_name":"Lass","orcid":"0000-0002-5708-7632"},{"full_name":"Mittendorf, Robert","first_name":"Robert","last_name":"Mittendorf"},{"full_name":"Löcke, Thomas","last_name":"Löcke","first_name":"Thomas"},{"full_name":"Plessl, Christian","last_name":"Plessl","orcid":"0000-0001-5728-9982","first_name":"Christian","id":"16153"}],"year":"2017","title":"Efficient Branch and Bound on FPGAs Using Work Stealing and Instance-Specific Designs","doi":"10.1145/3053687","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Branch and bound (B&B) algorithms structure the search space as a tree and eliminate infeasible solutions early by pruning subtrees that cannot lead to a valid or optimal solution. Custom hardware designs significantly accelerate the execution of these algorithms. In this article, we demonstrate a high-performance B&B implementation on FPGAs. First, we identify general elements of B&B algorithms and describe their implementation as a finite state machine. Then, we introduce workers that autonomously cooperate using work stealing to allow parallel execution and full utilization of the target FPGA. Finally, we explore advantages of instance-specific designs that target a specific problem instance to improve performance.\r\n\r\nWe evaluate our concepts by applying them to a branch and bound problem, the reconstruction of corrupted AES keys obtained from cold-boot attacks. The evaluation shows that our work stealing approach is scalable with the available resources and provides speedups proportional to the number of workers. Instance-specific designs allow us to achieve an overall speedup of 47 × compared to the fastest implementation of AES key reconstruction so far. Finally, we demonstrate how instance-specific designs can be generated just-in-time such that the provided speedups outweigh the additional time required for design synthesis."}],"issue":"3","publication":"ACM Transactions on Reconfigurable Technology and Systems (TRETS)","department":[{"_id":"27"},{"_id":"518"}],"keyword":["coldboot"],"type":"journal_article","date_created":"2017-07-25T14:17:32Z","file":[{"file_name":"a24-riebler.pdf","file_size":2131617,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T16:04:14Z","file_id":"5322","success":1,"content_type":"application/pdf","creator":"ups","date_created":"2018-11-02T16:04:14Z"}]},{"year":"2017","title":"Flexible FPGA design for FDTD using OpenCL","author":[{"id":"3145","full_name":"Kenter, Tobias","last_name":"Kenter","first_name":"Tobias"},{"full_name":"Förstner, Jens","last_name":"Förstner","first_name":"Jens","orcid":"0000-0001-7059-9862","id":"158"},{"orcid":"0000-0001-5728-9982","first_name":"Christian","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"}],"date_updated":"2023-09-26T13:24:38Z","language":[{"iso":"eng"}],"doi":"10.23919/FPL.2017.8056844","publication":"Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)","abstract":[{"lang":"eng","text":"Compared to classical HDL designs, generating FPGA with high-level synthesis from an OpenCL specification promises easier exploration of different design alternatives and, through ready-to-use infrastructure and common abstractions for host and memory interfaces, easier portability between different FPGA families. In this work, we evaluate the extent of this promise. To this end, we present a parameterized FDTD implementation for photonic microcavity simulations. Our design can trade-off different forms of parallelism and works for two independent OpenCL-based FPGA design flows. Hence, we can target FPGAs from different vendors and different FPGA families. We describe how we used pre-processor macros to achieve this flexibility and to work around different shortcomings of the current tools. Choosing the right design configurations, we are able to present two extremely competitive solutions for very different FPGA targets, reaching up to 172 GFLOPS sustained performance. With the portability and flexibility demonstrated, code developers not only avoid vendor lock-in, but can even make best use of real trade-offs between different architectures."}],"file":[{"creator":"ups","date_created":"2018-11-02T15:02:28Z","date_updated":"2018-11-02T15:02:28Z","relation":"main_file","file_size":230235,"access_level":"closed","file_name":"08056844.pdf","success":1,"content_type":"application/pdf","file_id":"5291"}],"date_created":"2018-03-22T11:10:23Z","keyword":["tet_topic_hpc"],"type":"conference","department":[{"_id":"27"},{"_id":"518"},{"_id":"61"}],"status":"public","has_accepted_license":"1","_id":"1592","publisher":"IEEE","ddc":["000"],"user_id":"15278","file_date_updated":"2018-11-02T15:02:28Z","citation":{"mla":"Kenter, Tobias, et al. “Flexible FPGA Design for FDTD Using OpenCL.” <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>.","ama":"Kenter T, Förstner J, Plessl C. Flexible FPGA design for FDTD using OpenCL. In: <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>","bibtex":"@inproceedings{Kenter_Förstner_Plessl_2017, title={Flexible FPGA design for FDTD using OpenCL}, DOI={<a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>}, booktitle={Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)}, publisher={IEEE}, author={Kenter, Tobias and Förstner, Jens and Plessl, Christian}, year={2017} }","apa":"Kenter, T., Förstner, J., &#38; Plessl, C. (2017). Flexible FPGA design for FDTD using OpenCL. <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>","ieee":"T. Kenter, J. Förstner, and C. Plessl, “Flexible FPGA design for FDTD using OpenCL,” 2017, doi: <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">10.23919/FPL.2017.8056844</a>.","short":"T. Kenter, J. Förstner, C. Plessl, in: Proc. Int. Conf. on Field Programmable Logic and Applications (FPL), IEEE, 2017.","chicago":"Kenter, Tobias, Jens Förstner, and Christian Plessl. “Flexible FPGA Design for FDTD Using OpenCL.” In <i>Proc. Int. Conf. on Field Programmable Logic and Applications (FPL)</i>. IEEE, 2017. <a href=\"https://doi.org/10.23919/FPL.2017.8056844\">https://doi.org/10.23919/FPL.2017.8056844</a>."},"quality_controlled":"1","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C2","_id":"14","grant_number":"160364472"},{"grant_number":"01|H16005A","_id":"33","name":"HighPerMeshes"},{"grant_number":"PL 595/2-1 / 320898746","_id":"32","name":"Performance and Efficiency in HPC with Custom Computing"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}]},{"doi":"10.1016/j.ejpoleco.2016.11.003","language":[{"iso":"eng"}],"intvolume":"        49","publication_status":"published","date_updated":"2022-01-06T06:57:03Z","author":[{"full_name":"Brangewitz, Sonja","first_name":"Sonja","last_name":"Brangewitz"},{"last_name":"Brockhoff","first_name":"Sarah","full_name":"Brockhoff, Sarah"}],"publication_identifier":{"issn":["0176-2680"]},"title":"Sustainability of coalitional equilibria within repeated tax competition","year":"2016","department":[{"_id":"205"},{"_id":"475"}],"type":"journal_article","date_created":"2018-04-26T11:26:07Z","file":[{"date_updated":"2018-08-09T09:19:40Z","relation":"main_file","access_level":"closed","file_size":906121,"file_name":"Sustainability of coalitional equilibria within repeated tax competition.pdf","title":"Sustainability of coalitional equilibria within repeated tax competition ","content_type":"application/pdf","file_id":"3863","creator":"cjhaake","date_created":"2018-08-09T08:53:56Z"}],"publication":"European Journal of Political Economy","volume":49,"user_id":"65453","ddc":["040"],"_id":"2540","publisher":"Elsevier","urn":"25404","page":"1-23","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"citation":{"bibtex":"@article{Brangewitz_Brockhoff_2016, title={Sustainability of coalitional equilibria within repeated tax competition}, volume={49}, DOI={<a href=\"https://doi.org/10.1016/j.ejpoleco.2016.11.003\">10.1016/j.ejpoleco.2016.11.003</a>}, journal={European Journal of Political Economy}, publisher={Elsevier}, author={Brangewitz, Sonja and Brockhoff, Sarah}, year={2016}, pages={1–23} }","ama":"Brangewitz S, Brockhoff S. Sustainability of coalitional equilibria within repeated tax competition. <i>European Journal of Political Economy</i>. 2016;49:1-23. doi:<a href=\"https://doi.org/10.1016/j.ejpoleco.2016.11.003\">10.1016/j.ejpoleco.2016.11.003</a>","mla":"Brangewitz, Sonja, and Sarah Brockhoff. “Sustainability of Coalitional Equilibria within Repeated Tax Competition.” <i>European Journal of Political Economy</i>, vol. 49, Elsevier, 2016, pp. 1–23, doi:<a href=\"https://doi.org/10.1016/j.ejpoleco.2016.11.003\">10.1016/j.ejpoleco.2016.11.003</a>.","chicago":"Brangewitz, Sonja, and Sarah Brockhoff. “Sustainability of Coalitional Equilibria within Repeated Tax Competition.” <i>European Journal of Political Economy</i> 49 (2016): 1–23. <a href=\"https://doi.org/10.1016/j.ejpoleco.2016.11.003\">https://doi.org/10.1016/j.ejpoleco.2016.11.003</a>.","short":"S. Brangewitz, S. Brockhoff, European Journal of Political Economy 49 (2016) 1–23.","ieee":"S. Brangewitz and S. Brockhoff, “Sustainability of coalitional equilibria within repeated tax competition,” <i>European Journal of Political Economy</i>, vol. 49, pp. 1–23, 2016.","apa":"Brangewitz, S., &#38; Brockhoff, S. (2016). Sustainability of coalitional equilibria within repeated tax competition. <i>European Journal of Political Economy</i>, <i>49</i>, 1–23. <a href=\"https://doi.org/10.1016/j.ejpoleco.2016.11.003\">https://doi.org/10.1016/j.ejpoleco.2016.11.003</a>"},"file_date_updated":"2018-08-09T09:19:40Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"ama":"Platenius MC. <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn; 2016.","bibtex":"@book{Platenius_2016, title={Fuzzy Matching of Comprehensive Service Specifications}, publisher={Universität Paderborn}, author={Platenius, Marie Christin}, year={2016} }","mla":"Platenius, Marie Christin. <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn, 2016.","chicago":"Platenius, Marie Christin. <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn, 2016.","short":"M.C. Platenius, Fuzzy Matching of Comprehensive Service Specifications, Universität Paderborn, 2016.","apa":"Platenius, M. C. (2016). <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn.","ieee":"M. C. Platenius, <i>Fuzzy Matching of Comprehensive Service Specifications</i>. Universität Paderborn, 2016."},"supervisor":[{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"file_date_updated":"2018-03-21T12:15:58Z","department":[{"_id":"76"}],"type":"dissertation","date_created":"2017-10-17T12:41:30Z","file":[{"file_id":"1527","success":1,"content_type":"application/pdf","file_name":"195-Dissertation_-_Marie_Christin_Platenius.pdf","access_level":"closed","file_size":18246710,"relation":"main_file","date_updated":"2018-03-21T12:15:58Z","date_created":"2018-03-21T12:15:58Z","creator":"florida"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:54:06Z","author":[{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"}],"title":"Fuzzy Matching of Comprehensive Service Specifications","status":"public","year":"2016","user_id":"14052","ddc":["040"],"publisher":"Universität Paderborn","_id":"195"},{"date_updated":"2022-01-06T06:54:07Z","title":"Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League","status":"public","year":"2016","author":[{"last_name":"Aykanat","first_name":"Cengiz","full_name":"Aykanat, Cengiz"}],"user_id":"42447","publisher":"Universität Paderborn","_id":"196","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"supervisor":[{"id":"37339","last_name":"Hehenkamp","first_name":"Burkhard","full_name":"Hehenkamp, Burkhard"}],"citation":{"mla":"Aykanat, Cengiz. <i>Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League</i>. Universität Paderborn, 2016.","ama":"Aykanat C. <i>Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League</i>. Universität Paderborn; 2016.","bibtex":"@book{Aykanat_2016, title={Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League}, publisher={Universität Paderborn}, author={Aykanat, Cengiz}, year={2016} }","apa":"Aykanat, C. (2016). <i>Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League</i>. Universität Paderborn.","ieee":"C. Aykanat, <i>Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League</i>. Universität Paderborn, 2016.","short":"C. Aykanat, Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League, Universität Paderborn, 2016.","chicago":"Aykanat, Cengiz. <i>Fußwallwunder Leicester City - Auch in der Bundesliga möglich? Ein ökonomischer Vergleich des Wettbewerbs in der Bundesliga mit der englischen Premier League</i>. Universität Paderborn, 2016."},"type":"bachelorsthesis","department":[{"_id":"280"}],"date_created":"2017-10-17T12:41:30Z"},{"user_id":"477","language":[{"iso":"ger"}],"_id":"197","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:54:10Z","title":"Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content","year":"2016","status":"public","author":[{"id":"27578","first_name":"Markus","last_name":"Dollmann","full_name":"Dollmann, Markus"}],"type":"mastersthesis","date_created":"2017-10-17T12:41:30Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"short":"M. Dollmann, Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content, Universität Paderborn, 2016.","ama":"Dollmann M. <i>Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content</i>. Universität Paderborn; 2016.","chicago":"Dollmann, Markus. <i>Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content</i>. Universität Paderborn, 2016.","bibtex":"@book{Dollmann_2016, title={Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content}, publisher={Universität Paderborn}, author={Dollmann, Markus}, year={2016} }","mla":"Dollmann, Markus. <i>Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content</i>. Universität Paderborn, 2016.","apa":"Dollmann, M. (2016). <i>Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content</i>. Universität Paderborn.","ieee":"M. Dollmann, <i>Frag die Anwender: Extraktion und Klassifikation von funktionalen Softwareanforderungen aus User-Generated-Content</i>. Universität Paderborn, 2016."}},{"language":[{"iso":"eng"}],"_id":"198","publisher":"Universität Paderborn","user_id":"477","ddc":["040"],"author":[{"first_name":"Bahar","last_name":"Jazayeri","full_name":"Jazayeri, Bahar","id":"36399"},{"last_name":"Platenius","first_name":"Marie Christin","full_name":"Platenius, Marie Christin"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"},{"full_name":"Kundisch, Dennis","last_name":"Kundisch","first_name":"Dennis","id":"21117"}],"status":"public","year":"2016","title":"Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)","has_accepted_license":"1","date_updated":"2022-01-06T06:54:13Z","date_created":"2017-10-17T12:41:30Z","file":[{"date_created":"2018-11-12T19:11:20Z","creator":"bahareh","file_id":"5534","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-12T19:11:20Z","file_name":"MarketSurvey_Techreport (1).pdf","file_size":1024328,"access_level":"closed"}],"department":[{"_id":"276"},{"_id":"66"},{"_id":"76"}],"type":"report","citation":{"short":"B. Jazayeri, M.C. Platenius, G. Engels, D. Kundisch, Features of IT Service Markets: A Systematic Literature Review (Supplementary Material), Universität Paderborn, 2016.","chicago":"Jazayeri, Bahar, Marie Christin Platenius, Gregor Engels, and Dennis Kundisch. <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn, 2016.","apa":"Jazayeri, B., Platenius, M. C., Engels, G., &#38; Kundisch, D. (2016). <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn.","ieee":"B. Jazayeri, M. C. Platenius, G. Engels, and D. Kundisch, <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn, 2016.","ama":"Jazayeri B, Platenius MC, Engels G, Kundisch D. <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn; 2016.","bibtex":"@book{Jazayeri_Platenius_Engels_Kundisch_2016, title={Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)}, publisher={Universität Paderborn}, author={Jazayeri, Bahar and Platenius, Marie Christin and Engels, Gregor and Kundisch, Dennis}, year={2016} }","mla":"Jazayeri, Bahar, et al. <i>Features of IT Service Markets: A Systematic Literature Review (Supplementary Material)</i>. Universität Paderborn, 2016."},"file_date_updated":"2018-11-12T19:11:20Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C5","_id":"17"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"place":"Banff, Canada","project":[{"name":"SFB 901","_id":"1"},{"_id":"17","name":"SFB 901 - Subprojekt C5"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-21T12:15:24Z","citation":{"apa":"Jazayeri, B., Platenius, M., Engels, G., &#38; Kundisch, D. (2016). Features of IT Service Markets: A Systematic Literature Review. In <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i> (Vol. 9936, pp. 301–316). Banff, Canada: Springer. <a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">https://doi.org/10.1007/978-3-319-46295-0_19</a>","mla":"Jazayeri, Bahar, et al. “Features of IT Service Markets: A Systematic Literature Review.” <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>, vol. 9936, Springer, 2016, pp. 301–16, doi:<a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">10.1007/978-3-319-46295-0_19</a>.","ieee":"B. Jazayeri, M. Platenius, G. Engels, and D. Kundisch, “Features of IT Service Markets: A Systematic Literature Review,” in <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>, 2016, vol. 9936, pp. 301–316.","short":"B. Jazayeri, M. Platenius, G. Engels, D. Kundisch, in: Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC), Springer, Banff, Canada, 2016, pp. 301–316.","ama":"Jazayeri B, Platenius M, Engels G, Kundisch D. Features of IT Service Markets: A Systematic Literature Review. In: <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>. Vol 9936. Lecture Notes in Computer Science (LNCS). Banff, Canada: Springer; 2016:301-316. doi:<a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">10.1007/978-3-319-46295-0_19</a>","chicago":"Jazayeri, Bahar, Marie Platenius, Gregor Engels, and Dennis Kundisch. “Features of IT Service Markets: A Systematic Literature Review.” In <i>Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)</i>, 9936:301–16. Lecture Notes in Computer Science (LNCS). Banff, Canada: Springer, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">https://doi.org/10.1007/978-3-319-46295-0_19</a>.","bibtex":"@inproceedings{Jazayeri_Platenius_Engels_Kundisch_2016, place={Banff, Canada}, series={Lecture Notes in Computer Science (LNCS)}, title={Features of IT Service Markets: A Systematic Literature Review}, volume={9936}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-46295-0_19\">10.1007/978-3-319-46295-0_19</a>}, booktitle={Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)}, publisher={Springer}, author={Jazayeri, Bahar and Platenius, Marie and Engels, Gregor and Kundisch, Dennis}, year={2016}, pages={301–316}, collection={Lecture Notes in Computer Science (LNCS)} }"},"user_id":"477","ddc":["040"],"volume":9936,"page":"301-316","_id":"199","publisher":"Springer","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"66"},{"_id":"276"},{"_id":"76"}],"file":[{"date_created":"2018-03-21T12:15:24Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1526","date_updated":"2018-03-21T12:15:24Z","relation":"main_file","access_level":"closed","file_size":765410,"file_name":"199-chp_3A10.1007_2F978-3-319-46295-0_19.pdf"}],"date_created":"2017-10-17T12:41:30Z","abstract":[{"lang":"eng","text":"The provision of IT solutions over electronic marketplaces became prominent in recent years. We call such marketplaces IT service markets. IT service markets have some core architectural building blocks that impact the quality attributes of these markets. However, these building blocks and their impacts are not well-known. Thus, design choices for IT service markets have been made ad-hoc until now. Furthermore, only single aspects of such markets have been investigated until now, but a comprehensive view is missing.In this paper, we identify common features and their interrelations on the basis of a systematic literature review of 60 publications using grounded theory.This knowledge provides an empirical evidence on the interdisciplinary design choices of IT service markets and it serves as a basis to support market providers and developers to integrate market features. Thereby, we make a first step towards the creation of a reference model for IT service markets that provides a holistic integrated view that can be used to create and maintain successful markets in the future."}],"publication":"Proceedings of the 14th International Conference on Service Oriented Computing (ICSOC)","doi":"10.1007/978-3-319-46295-0_19","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science (LNCS)","date_updated":"2022-01-06T06:54:14Z","intvolume":"      9936","year":"2016","title":"Features of IT Service Markets: A Systematic Literature Review","author":[{"last_name":"Jazayeri","first_name":"Bahar","full_name":"Jazayeri, Bahar","id":"36399"},{"full_name":"Platenius, Marie","last_name":"Platenius","first_name":"Marie"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"},{"id":"21117","last_name":"Kundisch","first_name":"Dennis","full_name":"Kundisch, Dennis"}]}]