[{"author":[{"full_name":"Bader, Christoph","last_name":"Bader","first_name":"Christoph"},{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"},{"last_name":"Li","full_name":"Li, Yong","first_name":"Yong"}],"date_created":"2018-06-07T09:20:48Z","date_updated":"2022-01-06T06:58:57Z","doi":"10.1007/978-3-662-46494-6_26","title":"Tightly-Secure Authenticated Key Exchange","page":"629--658","citation":{"chicago":"Bader, Christoph, Dennis Hofheinz, Tibor Jager, Eike Kiltz, and Yong Li. “Tightly-Secure Authenticated Key Exchange.” In <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>, 629--658, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">https://doi.org/10.1007/978-3-662-46494-6_26</a>.","ieee":"C. Bader, D. Hofheinz, T. Jager, E. Kiltz, and Y. Li, “Tightly-Secure Authenticated Key Exchange,” in <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>, 2015, pp. 629--658.","ama":"Bader C, Hofheinz D, Jager T, Kiltz E, Li Y. Tightly-Secure Authenticated Key Exchange. In: <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>. ; 2015:629--658. doi:<a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">10.1007/978-3-662-46494-6_26</a>","apa":"Bader, C., Hofheinz, D., Jager, T., Kiltz, E., &#38; Li, Y. (2015). Tightly-Secure Authenticated Key Exchange. In <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i> (pp. 629--658). <a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">https://doi.org/10.1007/978-3-662-46494-6_26</a>","bibtex":"@inproceedings{Bader_Hofheinz_Jager_Kiltz_Li_2015, title={Tightly-Secure Authenticated Key Exchange}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">10.1007/978-3-662-46494-6_26</a>}, booktitle={Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I}, author={Bader, Christoph and Hofheinz, Dennis and Jager, Tibor and Kiltz, Eike and Li, Yong}, year={2015}, pages={629--658} }","mla":"Bader, Christoph, et al. “Tightly-Secure Authenticated Key Exchange.” <i>Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I</i>, 2015, pp. 629--658, doi:<a href=\"https://doi.org/10.1007/978-3-662-46494-6_26\">10.1007/978-3-662-46494-6_26</a>.","short":"C. Bader, D. Hofheinz, T. Jager, E. Kiltz, Y. Li, in: Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, 2015, pp. 629--658."},"year":"2015","department":[{"_id":"558"}],"user_id":"38235","_id":"3126","extern":"1","publication":"Theory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I","type":"conference","status":"public"},{"abstract":[{"lang":"eng","text":"Nowadays, many service providers offer software components in the form of Software as a Service. Requesters that want to discover those services in order to use or to integrate them, need to find out which service satisfies their requirements best. For this purpose, service matching approaches determine how well the specifications of provided services satisfy their requirements (including structural, behavioral, and non-functional requirements). In this paper, we describe the tool-suite MatchBox that allows the integration of existing service matchers and their combination as part of flexibly configurable matching processes. Taking requirements and service specifications as an input, MatchBox is able to execute such matching processes and deliver rich matching results. In contrast to related tools, MatchBox allows users to take into account many different kinds of requirements, while it also provides the flexibility to control the matching process in many different ways. "}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1438","file_name":"313-p974-boerding.pdf","access_level":"closed","file_size":875687,"creator":"florida","date_created":"2018-03-20T07:44:26Z","date_updated":"2018-03-20T07:44:26Z"}],"status":"public","type":"conference","publication":"10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE'15)","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-20T07:44:26Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"313","user_id":"477","department":[{"_id":"76"}],"year":"2015","citation":{"ama":"Börding P, Bruns M, Platenius MC. Comprehensive Service Matching with MatchBox. In: <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>. ; 2015:974--977. doi:<a href=\"https://doi.org/10.1145/2786805.2803181\">10.1145/2786805.2803181</a>","ieee":"P. Börding, M. Bruns, and M. C. Platenius, “Comprehensive Service Matching with MatchBox,” in <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>, 2015, pp. 974--977.","chicago":"Börding, Paul, Melanie Bruns, and Marie Christin Platenius. “Comprehensive Service Matching with MatchBox.” In <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>, 974--977, 2015. <a href=\"https://doi.org/10.1145/2786805.2803181\">https://doi.org/10.1145/2786805.2803181</a>.","bibtex":"@inproceedings{Börding_Bruns_Platenius_2015, title={Comprehensive Service Matching with MatchBox}, DOI={<a href=\"https://doi.org/10.1145/2786805.2803181\">10.1145/2786805.2803181</a>}, booktitle={10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)}, author={Börding, Paul and Bruns, Melanie and Platenius, Marie Christin}, year={2015}, pages={974--977} }","short":"P. Börding, M. Bruns, M.C. Platenius, in: 10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15), 2015, pp. 974--977.","mla":"Börding, Paul, et al. “Comprehensive Service Matching with MatchBox.” <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i>, 2015, pp. 974--977, doi:<a href=\"https://doi.org/10.1145/2786805.2803181\">10.1145/2786805.2803181</a>.","apa":"Börding, P., Bruns, M., &#38; Platenius, M. C. (2015). Comprehensive Service Matching with MatchBox. In <i>10th Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE’15)</i> (pp. 974--977). <a href=\"https://doi.org/10.1145/2786805.2803181\">https://doi.org/10.1145/2786805.2803181</a>"},"page":"974--977","has_accepted_license":"1","title":"Comprehensive Service Matching with MatchBox","doi":"10.1145/2786805.2803181","date_updated":"2022-01-06T06:58:58Z","date_created":"2017-10-17T12:41:53Z","author":[{"first_name":"Paul","last_name":"Börding","full_name":"Börding, Paul"},{"last_name":"Bruns","full_name":"Bruns, Melanie","first_name":"Melanie"},{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"}]},{"title":"Budget Games with priced strategies","date_created":"2017-10-17T12:41:53Z","supervisor":[{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"author":[{"first_name":"Jannis","last_name":"Pautz","full_name":"Pautz, Jannis"}],"date_updated":"2022-01-06T06:59:01Z","publisher":"Universität Paderborn","citation":{"bibtex":"@book{Pautz_2015, title={Budget Games with priced strategies}, publisher={Universität Paderborn}, author={Pautz, Jannis}, year={2015} }","mla":"Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität Paderborn, 2015.","short":"J. Pautz, Budget Games with Priced Strategies, Universität Paderborn, 2015.","apa":"Pautz, J. (2015). <i>Budget Games with priced strategies</i>. Universität Paderborn.","ama":"Pautz J. <i>Budget Games with Priced Strategies</i>. Universität Paderborn; 2015.","ieee":"J. Pautz, <i>Budget Games with priced strategies</i>. Universität Paderborn, 2015.","chicago":"Pautz, Jannis. <i>Budget Games with Priced Strategies</i>. Universität Paderborn, 2015."},"year":"2015","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"316","status":"public","type":"bachelorsthesis"},{"citation":{"ama":"Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration. <i>Computer Science - R &#38; D</i>. 2015;(3-4):303--320. doi:<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>","ieee":"S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,” <i>Computer Science - R &#38; D</i>, no. 3–4, pp. 303--320, 2015.","chicago":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” <i>Computer Science - R &#38; D</i>, no. 3–4 (2015): 303--320. <a href=\"https://doi.org/10.1007/s00450-014-0259-7\">https://doi.org/10.1007/s00450-014-0259-7</a>.","short":"S. Ziegert, H. Wehrheim, Computer Science - R &#38; D (2015) 303--320.","bibtex":"@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture reconfiguration}, DOI={<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>}, number={3–4}, journal={Computer Science - R &#38; D}, author={Ziegert, Steffen and Wehrheim, Heike}, year={2015}, pages={303--320} }","mla":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” <i>Computer Science - R &#38; D</i>, no. 3–4, 2015, pp. 303--320, doi:<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>.","apa":"Ziegert, S., &#38; Wehrheim, H. (2015). Temporal plans for software architecture reconfiguration. <i>Computer Science - R &#38; D</i>, (3–4), 303--320. <a href=\"https://doi.org/10.1007/s00450-014-0259-7\">https://doi.org/10.1007/s00450-014-0259-7</a>"},"page":"303--320","year":"2015","issue":"3-4","has_accepted_license":"1","doi":"10.1007/s00450-014-0259-7","title":"Temporal plans for software architecture reconfiguration","author":[{"first_name":"Steffen","full_name":"Ziegert, Steffen","last_name":"Ziegert"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2018-06-13T07:47:56Z","date_updated":"2022-01-06T06:59:01Z","file":[{"date_updated":"2018-11-02T15:52:13Z","creator":"ups","date_created":"2018-11-02T15:52:13Z","file_size":2136451,"file_id":"5315","access_level":"closed","file_name":"TemporalPlansForSoftwareArchit.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"journal_article","publication":"Computer Science - R & D","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T15:52:13Z","ddc":["000"],"user_id":"477","department":[{"_id":"77"}],"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"_id":"3162"},{"_id":"3163","series_title":"Lecture Notes in Computer Science","user_id":"29719","department":[{"_id":"77"}],"type":"conference","publication":"Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings","editor":[{"first_name":"Roland","last_name":"Meyer","full_name":"Meyer, Roland"},{"first_name":"Andr{\\'{e}}","full_name":"Platzer, Andr{\\'{e}}","last_name":"Platzer"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"status":"public","date_updated":"2022-01-06T06:59:01Z","author":[{"full_name":"Meyer, Roland","last_name":"Meyer","first_name":"Roland"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2018-06-13T07:49:28Z","title":"From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog","doi":"10.1007/978-3-319-23506-6_1","year":"2015","citation":{"ama":"Meyer R, Wehrheim H. From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog. In: Meyer R, Platzer A, Wehrheim H, eds. <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>. Lecture Notes in Computer Science. ; 2015:3--4. doi:<a href=\"https://doi.org/10.1007/978-3-319-23506-6_1\">10.1007/978-3-319-23506-6_1</a>","chicago":"Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog.” In <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>, edited by Roland Meyer, Andr{\\’{e}} Platzer, and Heike Wehrheim, 3--4. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-23506-6_1\">https://doi.org/10.1007/978-3-319-23506-6_1</a>.","ieee":"R. Meyer and H. Wehrheim, “From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog,” in <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>, 2015, pp. 3--4.","apa":"Meyer, R., &#38; Wehrheim, H. (2015). From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog. In R. Meyer, A. Platzer, &#38; H. Wehrheim (Eds.), <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i> (pp. 3--4). <a href=\"https://doi.org/10.1007/978-3-319-23506-6_1\">https://doi.org/10.1007/978-3-319-23506-6_1</a>","mla":"Meyer, Roland, and Heike Wehrheim. “From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog.” <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>, edited by Roland Meyer et al., 2015, pp. 3--4, doi:<a href=\"https://doi.org/10.1007/978-3-319-23506-6_1\">10.1007/978-3-319-23506-6_1</a>.","short":"R. Meyer, H. Wehrheim, in: R. Meyer, A. Platzer, H. Wehrheim (Eds.), Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015, pp. 3--4.","bibtex":"@inproceedings{Meyer_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={From Program Verification to Time and Space: The Scientific Life of Ernst-R{\\\"{u}}diger Olderog}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-23506-6_1\">10.1007/978-3-319-23506-6_1</a>}, booktitle={Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}, author={Meyer, Roland and Wehrheim, Heike}, editor={Meyer, Roland and Platzer, Andr{\\’{e}} and Wehrheim, HeikeEditors}, year={2015}, pages={3--4}, collection={Lecture Notes in Computer Science} }"},"page":"3--4"},{"doi":"10.1007/978-3-319-19249-9_11","title":"Verifying Opacity of a Transactional Mutex Lock","author":[{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"last_name":"Travkin","full_name":"Travkin, Oleg","first_name":"Oleg"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2018-06-13T07:50:43Z","date_updated":"2022-01-06T06:59:01Z","page":"161--177","citation":{"short":"J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, in: N. Bj{\\o}rner, F. S. de Boer (Eds.), {FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings, 2015, pp. 161--177.","mla":"Derrick, John, et al. “Verifying Opacity of a Transactional Mutex Lock.” <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>, edited by Nikolaj Bj{\\o}rner and Frank S. de Boer, 2015, pp. 161--177, doi:<a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">10.1007/978-3-319-19249-9_11</a>.","bibtex":"@inproceedings{Derrick_Dongol_Schellhorn_Travkin_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Verifying Opacity of a Transactional Mutex Lock}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">10.1007/978-3-319-19249-9_11</a>}, booktitle={{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings}, author={Derrick, John and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Bj{\\o}rner, Nikolaj and S. de Boer, FrankEditors}, year={2015}, pages={161--177}, collection={Lecture Notes in Computer Science} }","apa":"Derrick, J., Dongol, B., Schellhorn, G., Travkin, O., &#38; Wehrheim, H. (2015). Verifying Opacity of a Transactional Mutex Lock. In N. Bj{\\o}rner &#38; F. S. de Boer (Eds.), <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i> (pp. 161--177). <a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">https://doi.org/10.1007/978-3-319-19249-9_11</a>","ama":"Derrick J, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Verifying Opacity of a Transactional Mutex Lock. In: Bj{\\o}rner N, S. de Boer F, eds. <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>. Lecture Notes in Computer Science. ; 2015:161--177. doi:<a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">10.1007/978-3-319-19249-9_11</a>","chicago":"Derrick, John, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Verifying Opacity of a Transactional Mutex Lock.” In <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>, edited by Nikolaj Bj{\\o}rner and Frank S. de Boer, 161--177. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-19249-9_11\">https://doi.org/10.1007/978-3-319-19249-9_11</a>.","ieee":"J. Derrick, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Verifying Opacity of a Transactional Mutex Lock,” in <i>{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings</i>, 2015, pp. 161--177."},"year":"2015","department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","_id":"3164","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"status":"public","editor":[{"first_name":"Nikolaj","full_name":"Bj{\\o}rner, Nikolaj","last_name":"Bj{\\o}rner"},{"full_name":"S. de Boer, Frank","last_name":"S. de Boer","first_name":"Frank"}],"publication":"{FM} 2015: Formal Methods - 20th International Symposium, Oslo, Norway, June 24-26, 2015, Proceedings","type":"conference"},{"citation":{"apa":"Wehrheim, H., &#38; Travkin, O. (2015). {TSO} to {SC} via Symbolic Execution. In N. Piterman (Ed.), <i>Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings</i> (pp. 104--119). <a href=\"https://doi.org/10.1007/978-3-319-26287-1_7\">https://doi.org/10.1007/978-3-319-26287-1_7</a>","short":"H. Wehrheim, O. Travkin, in: N. Piterman (Ed.), Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings, 2015, pp. 104--119.","bibtex":"@inproceedings{Wehrheim_Travkin_2015, series={Lecture Notes in Computer Science}, title={{TSO} to {SC} via Symbolic Execution}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-26287-1_7\">10.1007/978-3-319-26287-1_7</a>}, booktitle={Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings}, author={Wehrheim, Heike and Travkin, Oleg}, editor={Piterman, NirEditor}, year={2015}, pages={104--119}, collection={Lecture Notes in Computer Science} }","mla":"Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.” <i>Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings</i>, edited by Nir Piterman, 2015, pp. 104--119, doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_7\">10.1007/978-3-319-26287-1_7</a>.","chicago":"Wehrheim, Heike, and Oleg Travkin. “{TSO} to {SC} via Symbolic Execution.” In <i>Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings</i>, edited by Nir Piterman, 104--119. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-26287-1_7\">https://doi.org/10.1007/978-3-319-26287-1_7</a>.","ieee":"H. Wehrheim and O. Travkin, “{TSO} to {SC} via Symbolic Execution,” in <i>Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings</i>, 2015, pp. 104--119.","ama":"Wehrheim H, Travkin O. {TSO} to {SC} via Symbolic Execution. In: Piterman N, ed. <i>Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings</i>. Lecture Notes in Computer Science. ; 2015:104--119. doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_7\">10.1007/978-3-319-26287-1_7</a>"},"page":"104--119","year":"2015","date_created":"2018-06-13T07:52:44Z","author":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"first_name":"Oleg","last_name":"Travkin","full_name":"Travkin, Oleg"}],"date_updated":"2022-01-06T06:59:01Z","doi":"10.1007/978-3-319-26287-1_7","title":"{TSO} to {SC} via Symbolic Execution","type":"conference","publication":"Hardware and Software: Verification and Testing - 11th International Haifa Verification Conference, {HVC} 2015, Haifa, Israel, November 17-19, 2015, Proceedings","status":"public","editor":[{"full_name":"Piterman, Nir","last_name":"Piterman","first_name":"Nir"}],"series_title":"Lecture Notes in Computer Science","user_id":"29719","department":[{"_id":"77"}],"_id":"3165"},{"_id":"3166","department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","editor":[{"first_name":"Roland","full_name":"Meyer, Roland","last_name":"Meyer"},{"first_name":"Andr{\\'{e}}","last_name":"Platzer","full_name":"Platzer, Andr{\\'{e}}"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"status":"public","type":"conference_editor","title":"Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings","doi":"10.1007/978-3-319-23506-6","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:54:06Z","year":"2015","citation":{"apa":"Meyer, R., Platzer, A., &#38; Wehrheim, H. (Eds.). (2015). <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>. <a href=\"https://doi.org/10.1007/978-3-319-23506-6\">https://doi.org/10.1007/978-3-319-23506-6</a>","short":"R. Meyer, A. Platzer, H. Wehrheim, eds., Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, 2015.","bibtex":"@book{Meyer_Platzer_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-23506-6\">10.1007/978-3-319-23506-6</a>}, year={2015}, collection={Lecture Notes in Computer Science} }","mla":"Meyer, Roland, et al., editors. <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>. 2015, doi:<a href=\"https://doi.org/10.1007/978-3-319-23506-6\">10.1007/978-3-319-23506-6</a>.","ama":"Meyer R, Platzer A, Wehrheim H, eds. <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>.; 2015. doi:<a href=\"https://doi.org/10.1007/978-3-319-23506-6\">10.1007/978-3-319-23506-6</a>","chicago":"Meyer, Roland, Andr{\\’{e}} Platzer, and Heike Wehrheim, eds. <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-23506-6\">https://doi.org/10.1007/978-3-319-23506-6</a>.","ieee":"R. Meyer, A. Platzer, and H. Wehrheim, Eds., <i>Correct System Design - Symposium in Honor of Ernst-R{\\\"{u}}diger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings</i>. 2015."},"publication_identifier":{"isbn":["978-3-319-23505-9"]}},{"_id":"317","user_id":"14052","department":[{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-03-21T09:20:34Z","language":[{"iso":"ger"}],"type":"dissertation","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"317-Dissertation_ClaudiusJaehn.pdf","access_level":"closed","file_id":"1462","file_size":20442332,"creator":"florida","date_created":"2018-03-21T09:20:34Z","date_updated":"2018-03-21T09:20:34Z"}],"status":"public","date_updated":"2022-01-06T06:59:02Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:41:53Z","author":[{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"}],"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen","has_accepted_license":"1","year":"2015","citation":{"ama":"Jähn C. <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn; 2015.","ieee":"C. Jähn, <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn, 2015.","chicago":"Jähn, Claudius. <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn, 2015.","apa":"Jähn, C. (2015). <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn.","bibtex":"@book{Jähn_2015, title={Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen}, publisher={Universität Paderborn}, author={Jähn, Claudius}, year={2015} }","mla":"Jähn, Claudius. <i>Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen</i>. Universität Paderborn, 2015.","short":"C. Jähn, Bewertung von Renderingalgorithmen für komplexe 3-D-Szenen, Universität Paderborn, 2015."}},{"title":"Automatic Service Discovery and Composition for heterogeneous service partners","date_created":"2017-10-17T12:41:54Z","author":[{"full_name":"Huma, Zille","last_name":"Huma","first_name":"Zille"}],"supervisor":[{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"}],"date_updated":"2022-01-06T06:59:03Z","publisher":"Universität Paderborn","citation":{"short":"Z. Huma, Automatic Service Discovery and Composition for Heterogeneous Service Partners, Universität Paderborn, 2015.","bibtex":"@book{Huma_2015, title={Automatic Service Discovery and Composition for heterogeneous service partners}, publisher={Universität Paderborn}, author={Huma, Zille}, year={2015} }","mla":"Huma, Zille. <i>Automatic Service Discovery and Composition for Heterogeneous Service Partners</i>. Universität Paderborn, 2015.","apa":"Huma, Z. (2015). <i>Automatic Service Discovery and Composition for heterogeneous service partners</i>. Universität Paderborn.","ama":"Huma Z. <i>Automatic Service Discovery and Composition for Heterogeneous Service Partners</i>. Universität Paderborn; 2015.","chicago":"Huma, Zille. <i>Automatic Service Discovery and Composition for Heterogeneous Service Partners</i>. Universität Paderborn, 2015.","ieee":"Z. Huma, <i>Automatic Service Discovery and Composition for heterogeneous service partners</i>. Universität Paderborn, 2015."},"year":"2015","has_accepted_license":"1","file_date_updated":"2018-03-20T07:42:30Z","ddc":["040"],"user_id":"477","department":[{"_id":"66"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"318","file":[{"file_size":8011875,"file_name":"318-Dissertation_-_Huma.pdf","access_level":"closed","file_id":"1435","date_updated":"2018-03-20T07:42:30Z","creator":"florida","date_created":"2018-03-20T07:42:30Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"dissertation"},{"citation":{"ama":"Mohr F, Jungmann A, Kleine Büning H. Automated Online Service Composition. In: <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>. ; 2015:57--64. doi:<a href=\"https://doi.org/10.1109/SCC.2015.18\">10.1109/SCC.2015.18</a>","ieee":"F. Mohr, A. Jungmann, and H. Kleine Büning, “Automated Online Service Composition,” in <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>, 2015, pp. 57--64.","chicago":"Mohr, Felix, Alexander Jungmann, and Hans Kleine Büning. “Automated Online Service Composition.” In <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>, 57--64, 2015. <a href=\"https://doi.org/10.1109/SCC.2015.18\">https://doi.org/10.1109/SCC.2015.18</a>.","apa":"Mohr, F., Jungmann, A., &#38; Kleine Büning, H. (2015). Automated Online Service Composition. In <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i> (pp. 57--64). <a href=\"https://doi.org/10.1109/SCC.2015.18\">https://doi.org/10.1109/SCC.2015.18</a>","short":"F. Mohr, A. Jungmann, H. Kleine Büning, in: Proceedings of the 12th IEEE International Conference on Services Computing (SCC), 2015, pp. 57--64.","bibtex":"@inproceedings{Mohr_Jungmann_Kleine Büning_2015, title={Automated Online Service Composition}, DOI={<a href=\"https://doi.org/10.1109/SCC.2015.18\">10.1109/SCC.2015.18</a>}, booktitle={Proceedings of the 12th IEEE International Conference on Services Computing (SCC)}, author={Mohr, Felix and Jungmann, Alexander and Kleine Büning, Hans}, year={2015}, pages={57--64} }","mla":"Mohr, Felix, et al. “Automated Online Service Composition.” <i>Proceedings of the 12th IEEE International Conference on Services Computing (SCC)</i>, 2015, pp. 57--64, doi:<a href=\"https://doi.org/10.1109/SCC.2015.18\">10.1109/SCC.2015.18</a>."},"page":"57--64","year":"2015","has_accepted_license":"1","doi":"10.1109/SCC.2015.18","title":"Automated Online Service Composition","author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"first_name":"Alexander","last_name":"Jungmann","full_name":"Jungmann, Alexander"},{"first_name":"Hans","last_name":"Kleine Büning","full_name":"Kleine Büning, Hans"}],"date_created":"2017-10-17T12:41:54Z","date_updated":"2022-01-06T06:59:04Z","file":[{"file_id":"1434","access_level":"closed","file_name":"319-07207336.pdf","file_size":345742,"date_created":"2018-03-20T07:42:03Z","creator":"florida","date_updated":"2018-03-20T07:42:03Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Services are self-contained and platform independent software components that aim at maximizing software reuse. The automated composition of services to a target software artifact has been tackled with many AI techniques, but existing approaches make unreasonably strong assumptions such as a predefined data flow, are limited to tiny problem sizes, ignore non-functional properties, or assume offline service repositories. This paper presents an algorithm that automatically composes services without making such assumptions. We employ a backward search algorithm that starts from an empty composition and prepends service calls to already discovered candidates until a solution is found. Available services are determined during the search process. We implemented our algorithm, performed an experimental evaluation, and compared it to other approaches."}],"type":"conference","publication":"Proceedings of the 12th IEEE International Conference on Services Computing (SCC)","file_date_updated":"2018-03-20T07:42:03Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"355"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"319"},{"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:30:02Z","date_created":"2018-03-21T09:30:02Z","creator":"florida","file_size":448614,"file_id":"1476","file_name":"270-Dissertation_-_Abshoff.pdf","access_level":"closed"}],"status":"public","type":"dissertation","ddc":["040"],"file_date_updated":"2018-03-21T09:30:02Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"270","user_id":"477","department":[{"_id":"63"}],"year":"2015","citation":{"ieee":"S. Abshoff, <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn, 2015.","chicago":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","ama":"Abshoff S. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn; 2015.","short":"S. Abshoff, On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks, Universität Paderborn, 2015.","bibtex":"@book{Abshoff_2015, title={On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks}, publisher={Universität Paderborn}, author={Abshoff, Sebastian}, year={2015} }","mla":"Abshoff, Sebastian. <i>On the Complexity of Fundamental Problems in Dynamic Ad-Hoc Networks</i>. Universität Paderborn, 2015.","apa":"Abshoff, S. (2015). <i>On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks</i>. Universität Paderborn."},"has_accepted_license":"1","title":"On the Complexity of Fundamental Problems in Dynamic Ad-hoc Networks","date_updated":"2022-01-06T06:57:32Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"author":[{"first_name":"Sebastian","full_name":"Abshoff, Sebastian","last_name":"Abshoff"}],"date_created":"2017-10-17T12:41:44Z"},{"ddc":["040"],"external_id":{"arxiv":["1507.02908"]},"file":[{"date_created":"2018-03-21T09:29:34Z","creator":"florida","date_updated":"2018-03-21T09:29:34Z","access_level":"closed","file_id":"1475","file_name":"271-chp_3A10.1007_2F978-3-662-48433-3_14.pdf","file_size":256718,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"In \\emph{bandwidth allocation games} (BAGs), the strategy of a player consists of various demands on different resources. The player's utility is at most the sum of these demands, provided they are fully satisfied. Every resource has a limited capacity and if it is exceeded by the total demand, it has to be split between the players. Since these games generally do not have pure Nash equilibria, we consider approximate pure Nash equilibria, in which no player can improve her utility by more than some fixed factor $\\alpha$ through unilateral strategy changes. There is a threshold $\\alpha_\\delta$ (where $\\delta$ is a parameter that limits the demand of each player on a specific resource) such that $\\alpha$-approximate pure Nash equilibria always exist for $\\alpha \\geq \\alpha_\\delta$, but not for $\\alpha < \\alpha_\\delta$. We give both upper and lower bounds on this threshold $\\alpha_\\delta$ and show that the corresponding decision problem is ${\\sf NP}$-hard. We also show that the $\\alpha$-approximate price of anarchy for BAGs is $\\alpha+1$. For a restricted version of the game, where demands of players only differ slightly from each other (e.g. symmetric games), we show that approximate Nash equilibria can be reached (and thus also be computed) in polynomial time using the best-response dynamic. Finally, we show that a broader class of utility-maximization games (which includes BAGs) converges quickly towards states whose social welfare is close to the optimum."}],"publication":"Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)","title":"On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games","date_created":"2017-10-17T12:41:45Z","year":"2015","file_date_updated":"2018-03-21T09:29:34Z","department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","series_title":"Lecture Notes in Computer Science","_id":"271","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"status":"public","type":"conference","doi":"10.1007/978-3-662-48433-3_14","author":[{"first_name":"Maximilian","full_name":"Drees, Maximilian","last_name":"Drees"},{"first_name":"Matthias","full_name":"Feldotto, Matthias","id":"14052","orcid":"0000-0003-1348-6516","last_name":"Feldotto"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"},{"last_name":"Skopalik","full_name":"Skopalik, Alexander","id":"40384","first_name":"Alexander"}],"date_updated":"2022-01-06T06:57:34Z","page":"178-189","citation":{"chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” In <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 178–89. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">https://doi.org/10.1007/978-3-662-48433-3_14</a>.","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games,” in <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2015, pp. 178–189.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In: <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>. Lecture Notes in Computer Science. ; 2015:178-189. doi:<a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">10.1007/978-3-662-48433-3_14</a>","mla":"Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2015, pp. 178–89, doi:<a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">10.1007/978-3-662-48433-3_14</a>.","bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2015, series={Lecture Notes in Computer Science}, title={On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">10.1007/978-3-662-48433-3_14</a>}, booktitle={Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2015}, pages={178–189}, collection={Lecture Notes in Computer Science} }","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–189.","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2015). On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. In <i>Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 178–189). <a href=\"https://doi.org/10.1007/978-3-662-48433-3_14\">https://doi.org/10.1007/978-3-662-48433-3_14</a>"},"has_accepted_license":"1"},{"publication_status":"published","year":"2015","page":"39-53","intvolume":"       330","citation":{"apa":"Keil,  Reinhard , &#38; Selke, H. (2015). <i>Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten</i> (R. Keil &#38;  Harald Selke, Eds.; Vol. 330, pp. 39–53). publishing series of the Heinz Nixdorf Institute, Paderborn.","bibtex":"@inproceedings{Keil_Selke_2015, title={Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten}, volume={330}, publisher={publishing series of the Heinz Nixdorf Institute, Paderborn}, author={Keil,  Reinhard  and Selke, Harald}, editor={Keil, Reinhard  and Selke,  Harald}, year={2015}, pages={39–53} }","mla":"Keil,  Reinhard , and Harald Selke. <i>Virtual Knowledge {\\ “A} Ume - From the Presentation of Content to Virtual Learning {\\” A} Tten</i>. Edited by Reinhard  Keil and  Harald Selke, vol. 330, publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","short":"Reinhard  Keil, H. Selke, in: R. Keil,  Harald Selke (Eds.), publishing series of the Heinz Nixdorf Institute, Paderborn, 2015, pp. 39–53.","ieee":"Reinhard  Keil and H. Selke, “Virtual knowledge {\\ ‘a} ume - From the presentation of content to virtual learning {\\’ a} tten,” 2015, vol. 330, pp. 39–53.","chicago":"Keil,  Reinhard , and Harald Selke. “Virtual Knowledge {\\ ‘A} Ume - From the Presentation of Content to Virtual Learning {\\’ A} Tten.” edited by Reinhard  Keil and  Harald Selke, 330:39–53. publishing series of the Heinz Nixdorf Institute, Paderborn, 2015.","ama":"Keil  Reinhard , Selke H. Virtual knowledge {\\ “a} ume - From the presentation of content to virtual learning {\\” a} tten. In: Keil R, Selke  Harald, eds. Vol 330. publishing series of the Heinz Nixdorf Institute, Paderborn; 2015:39-53."},"date_updated":"2022-01-06T06:57:35Z","publisher":"publishing series of the Heinz Nixdorf Institute, Paderborn","volume":330,"author":[{"first_name":" Reinhard ","last_name":"Keil","full_name":"Keil,  Reinhard "},{"last_name":"Selke","full_name":"Selke, Harald","id":"497","first_name":"Harald"}],"date_created":"2021-11-05T22:48:51Z","title":"Virtual knowledge {\\ \"a} ume - From the presentation of content to virtual learning {\\\" a} tten","type":"conference","editor":[{"first_name":"Reinhard ","last_name":"Keil","full_name":"Keil, Reinhard "},{"full_name":"Selke,  Harald","last_name":"Selke","first_name":" Harald"}],"status":"public","_id":"27163","department":[{"_id":"71"}],"user_id":"71124","language":[{"iso":"eng"}]},{"author":[{"first_name":"Florian","last_name":"Klompmaker","full_name":"Klompmaker, Florian"}],"date_created":"2021-11-05T22:52:55Z","publisher":"Universitaetsbibliothek Paderborn","date_updated":"2022-01-06T06:57:35Z","title":"Development of a structured process of interaction design for {\\ \"u} r nat {\\\" u} local user interfaces","citation":{"ama":"Klompmaker F. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn; 2015.","chicago":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","ieee":"F. Klompmaker, <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science: Universitaetsbibliothek Paderborn, 2015.","bibtex":"@book{Klompmaker_2015, place={Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science}, title={Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces}, publisher={Universitaetsbibliothek Paderborn}, author={Klompmaker, Florian}, year={2015} }","mla":"Klompmaker, Florian. <i>Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces</i>. Universitaetsbibliothek Paderborn, 2015.","short":"F. Klompmaker, Development of a Structured Process of Interaction Design for {\\ “U} r Nat {\\” U} Local User Interfaces, Universitaetsbibliothek Paderborn, Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science, 2015.","apa":"Klompmaker, F. (2015). <i>Development of a structured process of interaction design for {\\ “u} r nat {\\” u} local user interfaces</i>. Universitaetsbibliothek Paderborn."},"year":"2015","place":"Universit {\\ \"a} t Paderborn, Heinz Nixdorf Institute, Contextual Computer Science","user_id":"71124","department":[{"_id":"71"}],"_id":"27164","language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"type":"conference","status":"public","abstract":[{"text":"Patterns serve to codify design knowledge. By embedding them in a hypothesis-driven design, it is possible to develop them further into sample languages. For this it is necessary to resolve the underlying conflicts in the form of design hypotheses and to validate them empirically in order to enable further use and generalization. In this article, an experiment is presented that describes this procedure and demonstrates the interplay between theory formation and codification of design knowledge using two examples.","lang":"eng"}],"user_id":"71124","department":[{"_id":"71"}],"_id":"27165","language":[{"iso":"eng"}],"publication_status":"published","citation":{"mla":"Schild,  Christian, and Vanessa  Petrausch. <i>Empirical Validation of Design Patterns </i>. De Gruyter Oldenbourg, 2015, pp. 173–82.","short":"Christian Schild, V.  Petrausch, in: De Gruyter Oldenbourg, Berlin, 2015, pp. 173–182.","bibtex":"@inproceedings{Schild_ Petrausch_2015, place={Berlin}, title={Empirical validation of design patterns }, publisher={De Gruyter Oldenbourg}, author={Schild,  Christian and  Petrausch, Vanessa}, year={2015}, pages={173–182} }","apa":"Schild,  Christian, &#38;  Petrausch, V. (2015). <i>Empirical validation of design patterns </i>. 173–182.","ama":"Schild  Christian,  Petrausch V. Empirical validation of design patterns . In: De Gruyter Oldenbourg; 2015:173-182.","ieee":"Christian Schild and V.  Petrausch, “Empirical validation of design patterns ,” 2015, pp. 173–182.","chicago":"Schild,  Christian, and Vanessa  Petrausch. “Empirical Validation of Design Patterns ,” 173–82. Berlin: De Gruyter Oldenbourg, 2015."},"page":"173-182","place":"Berlin","year":"2015","author":[{"last_name":"Schild","full_name":"Schild,  Christian","first_name":" Christian"},{"full_name":" Petrausch, Vanessa","last_name":" Petrausch","first_name":"Vanessa"}],"date_created":"2021-11-05T22:57:59Z","publisher":"De Gruyter Oldenbourg","date_updated":"2022-01-06T06:57:35Z","title":"Empirical validation of design patterns "},{"type":"mastersthesis","status":"public","_id":"273","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":"477","year":"2015","citation":{"ieee":"K. Kohn, <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn, 2015.","chicago":"Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","ama":"Kohn K. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn; 2015.","bibtex":"@book{Kohn_2015, title={Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2015} }","mla":"Kohn, Kathlén. <i>Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms</i>. Universität Paderborn, 2015.","short":"K. Kohn, Number of Voronoi-Relevant Vectors in Lattices with Respect to Arbitrary Norms, Universität Paderborn, 2015.","apa":"Kohn, K. (2015). <i>Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms</i>. Universität Paderborn."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:57:37Z","author":[{"full_name":"Kohn, Kathlén","last_name":"Kohn","first_name":"Kathlén"}],"date_created":"2017-10-17T12:41:45Z","supervisor":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"title":"Number of Voronoi-relevant vectors in lattices with respect to arbitrary norms"},{"status":"public","file":[{"date_updated":"2018-03-21T09:28:34Z","date_created":"2018-03-21T09:28:34Z","creator":"florida","file_size":215498,"access_level":"closed","file_id":"1473","file_name":"274-chp_3A10.1007_2F978-3-319-21840-3_45.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s time units before processing jobs of a given type. The objective is to minimize the makespan of the resulting schedule. We design and analyze an approximation algorithm that runs in time polynomial in n,m and k and computes a solution with an approximation factor that can be made arbitrarily close to 3/2.","lang":"eng"}],"editor":[{"last_name":"Dehne","full_name":"Dehne, Frank","first_name":"Frank"},{"full_name":"Sack, Jörg Rüdiger","last_name":"Sack","first_name":"Jörg Rüdiger"},{"first_name":"Ulrike","last_name":"Stege","full_name":"Stege, Ulrike"}],"publication":"Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings","type":"conference","file_date_updated":"2018-03-21T09:28:34Z","ddc":["040"],"department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","_id":"274","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"page":"542--553","citation":{"ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Non-preemptive Scheduling on Machines with Setup Times. In: Dehne F, Sack JR, Stege U, eds. <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>. Lecture Notes in Computer Science. ; 2015:542--553. doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Non-preemptive Scheduling on Machines with Setup Times,” in <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, 2015, pp. 542--553.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Non-Preemptive Scheduling on Machines with Setup Times.” In <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne, Jörg Rüdiger Sack, and Ulrike Stege, 542--553. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>.","bibtex":"@inproceedings{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2015, series={Lecture Notes in Computer Science}, title={Non-preemptive Scheduling on Machines with Setup Times}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>}, booktitle={Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, editor={Dehne, Frank and Sack, Jörg Rüdiger and Stege, UlrikeEditors}, year={2015}, pages={542--553}, collection={Lecture Notes in Computer Science} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, in: F. Dehne, J.R. Sack, U. Stege (Eds.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings, 2015, pp. 542--553.","mla":"Mäcker, Alexander, et al. “Non-Preemptive Scheduling on Machines with Setup Times.” <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i>, edited by Frank Dehne et al., 2015, pp. 542--553, doi:<a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">10.1007/978-3-319-21840-3_45</a>.","apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2015). Non-preemptive Scheduling on Machines with Setup Times. In F. Dehne, J. R. Sack, &#38; U. Stege (Eds.), <i>Algorithms and Data Structures: 14th International Symposium, WADS 2015, Victoria, BC, Canada, August 5-7, 2015. Proceedings</i> (pp. 542--553). <a href=\"https://doi.org/10.1007/978-3-319-21840-3_45\">https://doi.org/10.1007/978-3-319-21840-3_45</a>"},"year":"2015","has_accepted_license":"1","doi":"10.1007/978-3-319-21840-3_45","title":"Non-preemptive Scheduling on Machines with Setup Times","author":[{"first_name":"Alexander","last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Sören","full_name":"Riechers, Sören","last_name":"Riechers"}],"date_created":"2017-10-17T12:41:45Z","date_updated":"2022-01-06T06:57:39Z"},{"series_title":"LNCS","user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"275","file_date_updated":"2018-03-21T09:27:12Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"conference","publication":"Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)","file":[{"access_level":"closed","file_id":"1472","file_name":"275-978-3-662-48054-0_21.pdf","file_size":279995,"date_created":"2018-03-21T09:27:12Z","creator":"florida","date_updated":"2018-03-21T09:27:12Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bilò et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the Price of Anarchy."}],"date_created":"2017-10-17T12:41:45Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"full_name":"Lenzner, Pascal","last_name":"Lenzner","first_name":"Pascal"}],"date_updated":"2022-01-06T06:57:40Z","doi":"10.1007/978-3-662-48054-0_21","title":"Network Creation Games: Think Global - Act Local","has_accepted_license":"1","citation":{"ama":"Cord-Landwehr A, Lenzner P. Network Creation Games: Think Global - Act Local. In: <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>. LNCS. ; 2015:248--260. doi:<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>","ieee":"A. Cord-Landwehr and P. Lenzner, “Network Creation Games: Think Global - Act Local,” in <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 2015, pp. 248--260.","chicago":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” In <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 248--260. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">https://doi.org/10.1007/978-3-662-48054-0_21</a>.","apa":"Cord-Landwehr, A., &#38; Lenzner, P. (2015). Network Creation Games: Think Global - Act Local. In <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i> (pp. 248--260). <a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">https://doi.org/10.1007/978-3-662-48054-0_21</a>","bibtex":"@inproceedings{Cord-Landwehr_Lenzner_2015, series={LNCS}, title={Network Creation Games: Think Global - Act Local}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>}, booktitle={Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)}, author={Cord-Landwehr, Andreas and Lenzner, Pascal}, year={2015}, pages={248--260}, collection={LNCS} }","short":"A. Cord-Landwehr, P. Lenzner, in: Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS), 2015, pp. 248--260.","mla":"Cord-Landwehr, Andreas, and Pascal Lenzner. “Network Creation Games: Think Global - Act Local.” <i>Proceedings of the 40th Conference on Mathematical Foundations of Computer Science (MFCS)</i>, 2015, pp. 248--260, doi:<a href=\"https://doi.org/10.1007/978-3-662-48054-0_21\">10.1007/978-3-662-48054-0_21</a>."},"page":"248--260","year":"2015"},{"title":"Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk","date_updated":"2022-01-06T06:57:44Z","publisher":"Universität Paderborn","supervisor":[{"id":"40384","full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander"}],"date_created":"2017-10-17T12:41:46Z","author":[{"first_name":"Nils","last_name":"Kothe","full_name":"Kothe, Nils"}],"year":"2015","citation":{"ama":"Kothe N. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn; 2015.","ieee":"N. Kothe, <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.","chicago":"Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.","apa":"Kothe, N. (2015). <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn.","mla":"Kothe, Nils. <i>Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk</i>. Universität Paderborn, 2015.","bibtex":"@book{Kothe_2015, title={Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk}, publisher={Universität Paderborn}, author={Kothe, Nils}, year={2015} }","short":"N. Kothe, Multilevel Netzwerk Spiele mit konstanten Entfernungen im Highspeed-Netzwerk, Universität Paderborn, 2015."},"language":[{"iso":"ger"}],"_id":"277","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"63"},{"_id":"541"}],"user_id":"14052","status":"public","type":"bachelorsthesis"}]