[{"_id":"97","conference":{"end_date":"2017-09-08","start_date":"2017-09-04","name":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","location":"Lisbon, Portugal"},"citation":{"bibtex":"@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017, place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, DOI={10.1109/REW.2017.26}, booktitle={2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}, publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017}, pages={379–385} }","mla":"van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, 2017, pp. 379–85, doi:10.1109/REW.2017.26.","chicago":"Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), 379–85. Piscataway, NJ, USA: IEEE, 2017. https://doi.org/10.1109/REW.2017.26.","apa":"van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., & Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW) (pp. 379–385). Piscataway, NJ, USA: IEEE. https://doi.org/10.1109/REW.2017.26","ama":"van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW). Piscataway, NJ, USA: IEEE; 2017:379-385. doi:10.1109/REW.2017.26","ieee":"L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), Lisbon, Portugal, 2017, pp. 379–385.","short":"L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G. Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385."},"year":"2017","type":"conference","page":"379-385","abstract":[{"lang":"eng","text":"Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets."}],"ddc":["000"],"user_id":"57458","author":[{"last_name":"van Rooijen","id":"58843","first_name":"Lorijn","full_name":"van Rooijen, Lorijn"},{"last_name":"Bäumer","id":"38837","first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon"},{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"},{"full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","first_name":"Michaela","id":"42496","last_name":"Geierhos"},{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"id":"107","last_name":"Engels","full_name":"Engels, Gregor","first_name":"Gregor"}],"quality_controlled":"1","publisher":"IEEE","file_date_updated":"2018-11-02T14:50:35Z","keyword":["Software","Unified modeling language","Requirements engineering","Ontologies","Search problems","Natural languages"],"publication":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","file":[{"file_size":433613,"creator":"ups","file_id":"5285","content_type":"application/pdf","date_updated":"2018-11-02T14:50:35Z","success":1,"relation":"main_file","date_created":"2018-11-02T14:50:35Z","file_name":"08054881.pdf","access_level":"closed"}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:10Z","date_updated":"2022-01-06T07:04:18Z","doi":"10.1109/REW.2017.26","language":[{"iso":"eng"}],"place":"Piscataway, NJ, USA","title":"From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"},{"_id":"34"},{"_id":"7"},{"_id":"66"},{"_id":"238"},{"_id":"63"}],"publication_identifier":{"eisbn":["978-1-5386-3488-2 "],"isbn":["978-1-5386-3489-9"]},"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"date_updated":"2022-01-06T07:01:56Z","doi":"10.1145/3087556.3087575","language":[{"iso":"eng"}],"title":"The Mobile Server Problem","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"55","page":"313-319","year":"2017","citation":{"ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–19, doi:10.1145/3087556.3087575.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server Problem}, DOI={10.1145/3087556.3087575}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2017}, pages={313–319} }","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 313–19, 2017. https://doi.org/10.1145/3087556.3087575.","apa":"Feldkord, B., & Meyer auf der Heide, F. (2017). The Mobile Server Problem. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 313–319). https://doi.org/10.1145/3087556.3087575","ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2017:313-319. doi:10.1145/3087556.3087575"},"type":"conference","abstract":[{"lang":"eng","text":"We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence."}],"user_id":"477","ddc":["000"],"file":[{"date_created":"2018-11-02T14:55:10Z","file_name":"p313-feldkord.pdf","access_level":"closed","file_size":691691,"creator":"ups","file_id":"5288","content_type":"application/pdf","date_updated":"2018-11-02T14:55:10Z","success":1,"relation":"main_file"}],"file_date_updated":"2018-11-02T14:55:10Z","publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","author":[{"first_name":"Björn","full_name":"Feldkord, Björn","last_name":"Feldkord","id":"22704"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2017-10-17T12:41:02Z","status":"public","has_accepted_license":"1"},{"_id":"66","type":"conference","citation":{"short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017. https://doi.org/10.1007/978-3-319-62389-4_15.","apa":"Drees, M., Feldotto, M., Riechers, S., & Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON) (pp. 175--187). https://doi.org/10.1007/978-3-319-62389-4_15","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted Budget Games. In: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON). LNCS. ; 2017:175--187. doi:10.1007/978-3-319-62389-4_15","bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure Nash Equilibria in Restricted Budget Games}, DOI={10.1007/978-3-319-62389-4_15}, booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15."},"year":"2017","page":"175--187","ddc":["000"],"user_id":"14052","abstract":[{"lang":"eng","text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player."}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:04Z","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"orcid":"0000-0003-1348-6516","full_name":"Feldotto, Matthias","first_name":"Matthias","id":"14052","last_name":"Feldotto"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"publication":"Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)","file_date_updated":"2018-10-31T16:58:42Z","file":[{"file_name":"Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf","date_created":"2018-10-31T16:58:42Z","access_level":"closed","file_size":346390,"creator":"feldi","file_id":"5228","content_type":"application/pdf","date_updated":"2018-10-31T16:58:42Z","relation":"main_file","success":1}],"doi":"10.1007/978-3-319-62389-4_15","date_updated":"2022-01-06T07:03:13Z","language":[{"iso":"eng"}],"series_title":"LNCS","title":"Pure Nash Equilibria in Restricted Budget Games","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"541"},{"_id":"63"}]},{"language":[{"iso":"ger"}],"citation":{"ieee":"J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.","short":"J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen, Universität Paderborn, 2017.","bibtex":"@book{Nowack_2017, title={On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen}, publisher={Universität Paderborn}, author={Nowack, Joshua}, year={2017} }","mla":"Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017.","ama":"Nowack J. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn; 2017.","apa":"Nowack, J. (2017). On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn.","chicago":"Nowack, Joshua. On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen. Universität Paderborn, 2017."},"year":"2017","type":"bachelorsthesis","_id":"695","date_updated":"2022-01-06T07:03:23Z","publisher":"Universität Paderborn","author":[{"full_name":"Nowack, Joshua","first_name":"Joshua","last_name":"Nowack"}],"department":[{"_id":"63"}],"status":"public","date_created":"2017-11-14T06:57:49Z","user_id":"14052","title":"On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen"},{"user_id":"15415","title":"Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)","place":"Paderborn","status":"public","date_created":"2020-04-07T06:36:06Z","publication_status":"published","author":[{"last_name":"Gausemeier","full_name":"Gausemeier, Jürgen","first_name":"Jürgen"},{"full_name":"Bodden, Eric","first_name":"Eric","last_name":"Bodden"},{"last_name":" Dressler","first_name":"Falko","full_name":" Dressler, Falko"},{"first_name":"Roman","full_name":"Dumitrescu, Roman","last_name":"Dumitrescu"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Scheytt","full_name":"Scheytt, Christoph","first_name":"Christoph"},{"first_name":"Ansgar","full_name":"Trächtler, Ansgar","last_name":"Trächtler"}],"department":[{"_id":"63"}],"_id":"16444","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"citation":{"ieee":"J. Gausemeier et al., Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn, 2017.","short":"J. Gausemeier, E. Bodden, F. Dressler, R. Dumitrescu, F. Meyer auf der Heide, C. Scheytt, A. Trächtler, Wissenschaftsforum Intelligente Technische Systeme (WInTeSys), Paderborn, 2017.","bibtex":"@book{Gausemeier_Bodden_ Dressler_Dumitrescu_Meyer auf der Heide_Scheytt_Trächtler_2017, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)}, author={Gausemeier, Jürgen and Bodden, Eric and Dressler, Falko and Dumitrescu, Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, Ansgar}, year={2017}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}} }","mla":"Gausemeier, Jürgen, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). 2017.","chicago":"Gausemeier, Jürgen, Eric Bodden, Falko Dressler, Roman Dumitrescu, Friedhelm Meyer auf der Heide, Christoph Scheytt, and Ansgar Trächtler. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn}. Paderborn, 2017.","ama":"Gausemeier J, Bodden E, Dressler F, et al. Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn; 2017.","apa":"Gausemeier, J., Bodden, E., Dressler, F., Dumitrescu, R., Meyer auf der Heide, F., Scheytt, C., & Trächtler, A. (2017). Wissenschaftsforum Intelligente Technische Systeme (WInTeSys). Paderborn."},"year":"2017","type":"book","page":"369","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}"},{"doi":"10.1007/978-3-319-72050-0_13","_id":"16461","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"type":"book_chapter","citation":{"short":"P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.","ieee":"P. Bemmann et al., “Monitoring of Domain-Related Problems in Distributed Data Streams,” in Structural Information and Communication Complexity, Cham, 2017.","chicago":"Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” In Structural Information and Communication Complexity. Cham, 2017. https://doi.org/10.1007/978-3-319-72050-0_13.","apa":"Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., & Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In Structural Information and Communication Complexity. https://doi.org/10.1007/978-3-319-72050-0_13","ama":"Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: Structural Information and Communication Complexity. ; 2017. doi:10.1007/978-3-319-72050-0_13","mla":"Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” Structural Information and Communication Complexity, 2017, doi:10.1007/978-3-319-72050-0_13.","bibtex":"@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems in Distributed Data Streams}, DOI={10.1007/978-3-319-72050-0_13}, booktitle={Structural Information and Communication Complexity}, author={Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }"},"year":"2017","user_id":"15415","title":"Monitoring of Domain-Related Problems in Distributed Data Streams","external_id":{"arxiv":["arXiv:1706.03568 "]},"place":"Cham","date_created":"2020-04-08T07:20:20Z","status":"public","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319720494","9783319720500"]},"department":[{"_id":"63"}],"publication":"Structural Information and Communication Complexity","author":[{"last_name":"Bemmann","full_name":"Bemmann, Pascal","first_name":"Pascal"},{"last_name":"Biermeier","full_name":"Biermeier, Felix","first_name":"Felix"},{"first_name":"Jan","full_name":"Bürmann, Jan","last_name":"Bürmann"},{"full_name":"Kemper, Arne","first_name":"Arne","last_name":"Kemper"},{"first_name":"Till","orcid":"0000-0003-2014-4696","full_name":"Knollmann, Till","last_name":"Knollmann","id":"39241"},{"full_name":"Knorr, Steffen","first_name":"Steffen","last_name":"Knorr"},{"first_name":"Nils","full_name":"Kothe, Nils","last_name":"Kothe"},{"full_name":"Mäcker, Alexander","first_name":"Alexander","id":"13536","last_name":"Mäcker"},{"first_name":"Manuel","full_name":"Malatyali, Manuel","last_name":"Malatyali","id":"41265"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"first_name":"Johannes Sebastian","full_name":"Schaefer, Johannes Sebastian","last_name":"Schaefer","id":"30291"},{"last_name":"Sundermeier","id":"38705","first_name":"Jannik","full_name":"Sundermeier, Jannik"}]},{"user_id":"14052","title":"Sortieren dynamischer Daten","department":[{"_id":"63"},{"_id":"541"}],"author":[{"first_name":"Simon","full_name":"Nachtigall, Simon","last_name":"Nachtigall"}],"publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2017-12-19T09:59:32Z","status":"public","_id":"1073","date_updated":"2022-01-06T06:50:50Z","language":[{"iso":"ger"}],"supervisor":[{"first_name":"Alexander","full_name":"Skopalik, Alexander","last_name":"Skopalik","id":"40384"}],"citation":{"ieee":"S. Nachtigall, Sortieren dynamischer Daten. Universität Paderborn, 2017.","short":"S. Nachtigall, Sortieren dynamischer Daten, Universität Paderborn, 2017.","mla":"Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017.","bibtex":"@book{Nachtigall_2017, title={Sortieren dynamischer Daten}, publisher={Universität Paderborn}, author={Nachtigall, Simon}, year={2017} }","apa":"Nachtigall, S. (2017). Sortieren dynamischer Daten. Universität Paderborn.","ama":"Nachtigall S. Sortieren dynamischer Daten. Universität Paderborn; 2017.","chicago":"Nachtigall, Simon. Sortieren dynamischer Daten. Universität Paderborn, 2017."},"type":"bachelorsthesis","year":"2017"},{"title":"Robuste Optimierung in Congestion Games","user_id":"14052","status":"public","date_created":"2017-12-19T10:00:25Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"author":[{"full_name":"Pukrop, Simon","first_name":"Simon","last_name":"Pukrop"}],"publisher":"Universität Paderborn","department":[{"_id":"63"},{"_id":"541"}],"_id":"1074","date_updated":"2022-01-06T06:50:50Z","citation":{"short":"S. Pukrop, Robuste Optimierung in Congestion Games, Universität Paderborn, 2017.","ieee":"S. Pukrop, Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","apa":"Pukrop, S. (2017). Robuste Optimierung in Congestion Games. Universität Paderborn.","ama":"Pukrop S. Robuste Optimierung in Congestion Games. Universität Paderborn; 2017.","chicago":"Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","mla":"Pukrop, Simon. Robuste Optimierung in Congestion Games. Universität Paderborn, 2017.","bibtex":"@book{Pukrop_2017, title={Robuste Optimierung in Congestion Games}, publisher={Universität Paderborn}, author={Pukrop, Simon}, year={2017} }"},"type":"bachelorsthesis","year":"2017","supervisor":[{"id":"40384","last_name":"Skopalik","full_name":"Skopalik, Alexander","first_name":"Alexander"}],"language":[{"iso":"ger"}]},{"_id":"1080","date_updated":"2022-01-06T06:50:50Z","year":"2017","type":"mastersthesis","citation":{"bibtex":"@book{Bürmann_2017, title={Complexity of Signalling in Routing Games under Uncertainty}, publisher={Universität Paderborn}, author={Bürmann, Jan}, year={2017} }","mla":"Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","chicago":"Bürmann, Jan. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","apa":"Bürmann, J. (2017). Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn.","ama":"Bürmann J. Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn; 2017.","ieee":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty. Universität Paderborn, 2017.","short":"J. Bürmann, Complexity of Signalling in Routing Games under Uncertainty, Universität Paderborn, 2017."},"supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"title":"Complexity of Signalling in Routing Games under Uncertainty","user_id":"14052","date_created":"2017-12-19T10:07:35Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"status":"public","department":[{"_id":"63"},{"_id":"541"}],"publisher":"Universität Paderborn","author":[{"full_name":"Bürmann, Jan","first_name":"Jan","last_name":"Bürmann"}]},{"user_id":"14052","title":"Bounding the Inefficiency of Equilibria in Congestion Games under Taxation","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"date_created":"2017-12-19T10:08:44Z","status":"public","department":[{"_id":"63"},{"_id":"541"}],"author":[{"first_name":"Vipin Ravindran","full_name":"Vijayalakshmi, Vipin Ravindran","last_name":"Vijayalakshmi"}],"publisher":"Universität Paderborn","_id":"1081","date_updated":"2022-01-06T06:50:51Z","supervisor":[{"last_name":"Skopalik","id":"40384","first_name":"Alexander","full_name":"Skopalik, Alexander"}],"year":"2017","type":"mastersthesis","citation":{"ieee":"V. R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","short":"V.R. Vijayalakshmi, Bounding the Inefficiency of Equilibria in Congestion Games under Taxation, Universität Paderborn, 2017.","bibtex":"@book{Vijayalakshmi_2017, title={Bounding the Inefficiency of Equilibria in Congestion Games under Taxation}, publisher={Universität Paderborn}, author={Vijayalakshmi, Vipin Ravindran}, year={2017} }","mla":"Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017.","apa":"Vijayalakshmi, V. R. (2017). Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn.","ama":"Vijayalakshmi VR. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn; 2017.","chicago":"Vijayalakshmi, Vipin Ravindran. Bounding the Inefficiency of Equilibria in Congestion Games under Taxation. Universität Paderborn, 2017."}}]