[{"type":"bachelorsthesis","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"42948","user_id":"37953","department":[{"_id":"280"}],"language":[{"iso":"ger"}],"year":"2022","citation":{"ama":"Kuzuoglu MN. <i>Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse</i>.; 2022.","ieee":"M. N. Kuzuoglu, <i>Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse</i>. 2022.","chicago":"Kuzuoglu, Muhammed Numan. <i>Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse</i>, 2022.","apa":"Kuzuoglu, M. N. (2022). <i>Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse</i>.","short":"M.N. Kuzuoglu, Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse, 2022.","bibtex":"@book{Kuzuoglu_2022, title={Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse}, author={Kuzuoglu, Muhammed Numan}, year={2022} }","mla":"Kuzuoglu, Muhammed Numan. <i>Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse</i>. 2022."},"date_updated":"2023-03-10T10:38:15Z","date_created":"2023-03-10T10:38:02Z","author":[{"first_name":"Muhammed Numan","last_name":"Kuzuoglu","full_name":"Kuzuoglu, Muhammed Numan"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"title":"Der Marktplatz von Amazon - Eine wettbewerbspolitische Analyse"},{"date_updated":"2023-03-14T09:58:52Z","author":[{"last_name":"Gottschalk","full_name":"Gottschalk, Sebastian","id":"47208","first_name":"Sebastian"},{"first_name":"Enes","id":"8447","full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","last_name":"Yigitbas"},{"full_name":"Nowosad, Alexander","last_name":"Nowosad","first_name":"Alexander"},{"full_name":"Engels, Gregor","id":"107","last_name":"Engels","first_name":"Gregor"}],"date_created":"2022-07-01T08:08:03Z","title":"Continuous Situation-specific Development of Business Models: Knowledge Provision, Method Composition, Method Enactment","year":"2022","citation":{"ieee":"S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Continuous Situation-specific Development of Business Models: Knowledge Provision, Method Composition, Method Enactment,” <i>International Journal on Software and Systems Modeling (SoSyM) </i>, 2022.","chicago":"Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels. “Continuous Situation-Specific Development of Business Models: Knowledge Provision, Method Composition, Method Enactment.” <i>International Journal on Software and Systems Modeling (SoSyM) </i>, 2022.","ama":"Gottschalk S, Yigitbas E, Nowosad A, Engels G. Continuous Situation-specific Development of Business Models: Knowledge Provision, Method Composition, Method Enactment. <i>International Journal on Software and Systems Modeling (SoSyM) </i>. Published online 2022.","short":"S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, International Journal on Software and Systems Modeling (SoSyM)  (2022).","bibtex":"@article{Gottschalk_Yigitbas_Nowosad_Engels_2022, title={Continuous Situation-specific Development of Business Models: Knowledge Provision, Method Composition, Method Enactment}, journal={International Journal on Software and Systems Modeling (SoSyM) }, author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2022} }","mla":"Gottschalk, Sebastian, et al. “Continuous Situation-Specific Development of Business Models: Knowledge Provision, Method Composition, Method Enactment.” <i>International Journal on Software and Systems Modeling (SoSyM) </i>, 2022.","apa":"Gottschalk, S., Yigitbas, E., Nowosad, A., &#38; Engels, G. (2022). Continuous Situation-specific Development of Business Models: Knowledge Provision, Method Composition, Method Enactment. <i>International Journal on Software and Systems Modeling (SoSyM) </i>."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"_id":"32307","user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"keyword":["Business Model Development","Situational Method Engineering","Situation-specific","Business Model Canvas","Continuous Development"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"International Journal on Software and Systems Modeling (SoSyM) ","abstract":[{"lang":"eng","text":"The development of new business models is essential for startups to become successful, as well as  for established companies to explore new business opportunities. However, developing such business models is a continuous challenging activity where different tasks need to be performed, and business decisions need to be made. Both have to fit the constantly changeable situation in which the business model is developed to reduce the risk of developing ineffective business models with low market penetration. Therefore, a method for developing situation-specific business models is needed. As a solution, we refine the concept of situational method engineering (SME) to business model development. SME, in turn, provides means to construct situation-specific development methods out of fragments from a method repository.\r\n\r\nWe develop a concept for the continuous situation-specific development of business models based on design science. The approach uses the roles of a domain expert,  a method engineer, and a business developer together with a repository with method fragments for developing business models and a repository with modeling artifacts for supporting the development. Both repositories are filled by utilizing the experience of domain experts. Out of these repositories, situation-specific development methods for developing business models can be continuously composed based on the changeable situation by the method engineer and enacted by the business developer. We implement it as an open-source tool and evaluate its applicability in an industrial case study of developing a business model for a local event platform. Our results show that situation awareness supports the continuous development of business models."}],"status":"public"},{"title":"Towards Situation-specific Software Support for Cross-organizational Design Thinking Processes","date_created":"2022-07-01T08:14:16Z","author":[{"first_name":"Sebastian","id":"47208","full_name":"Gottschalk, Sebastian","last_name":"Gottschalk"},{"orcid":"0000-0002-5967-833X","last_name":"Yigitbas","id":"8447","full_name":"Yigitbas, Enes","first_name":"Enes"},{"first_name":"Alexander","full_name":"Nowosad, Alexander","last_name":"Nowosad"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"publisher":"ACM","date_updated":"2023-03-14T09:59:05Z","citation":{"chicago":"Gottschalk, Sebastian, Enes Yigitbas, Alexander Nowosad, and Gregor Engels. “Towards Situation-Specific Software Support for Cross-Organizational Design Thinking Processes.” In <i>Proceedings of the 5th International Workshop on Software-Intensive Business (IWSiB’22) </i>. ACM, 2022.","ieee":"S. Gottschalk, E. Yigitbas, A. Nowosad, and G. Engels, “Towards Situation-specific Software Support for Cross-organizational Design Thinking Processes,” 2022.","ama":"Gottschalk S, Yigitbas E, Nowosad A, Engels G. Towards Situation-specific Software Support for Cross-organizational Design Thinking Processes. In: <i>Proceedings of the 5th International Workshop on Software-Intensive Business (IWSiB’22) </i>. ACM; 2022.","short":"S. Gottschalk, E. Yigitbas, A. Nowosad, G. Engels, in: Proceedings of the 5th International Workshop on Software-Intensive Business (IWSiB’22) , ACM, 2022.","bibtex":"@inproceedings{Gottschalk_Yigitbas_Nowosad_Engels_2022, title={Towards Situation-specific Software Support for Cross-organizational Design Thinking Processes}, booktitle={Proceedings of the 5th International Workshop on Software-intensive Business (IWSiB’22) }, publisher={ACM}, author={Gottschalk, Sebastian and Yigitbas, Enes and Nowosad, Alexander and Engels, Gregor}, year={2022} }","mla":"Gottschalk, Sebastian, et al. “Towards Situation-Specific Software Support for Cross-Organizational Design Thinking Processes.” <i>Proceedings of the 5th International Workshop on Software-Intensive Business (IWSiB’22) </i>, ACM, 2022.","apa":"Gottschalk, S., Yigitbas, E., Nowosad, A., &#38; Engels, G. (2022). Towards Situation-specific Software Support for Cross-organizational Design Thinking Processes. <i>Proceedings of the 5th International Workshop on Software-Intensive Business (IWSiB’22) </i>."},"year":"2022","language":[{"iso":"eng"}],"keyword":["design thinking","situation-specific","cross-organizational","software support"],"department":[{"_id":"66"},{"_id":"534"}],"user_id":"8447","_id":"32309","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"}],"status":"public","abstract":[{"text":"Due to the increasing influences of a VUCA world, design thinking workshops have been established as a standard technique to build solutions according to uncertain customer needs. Concerning the ongoing pandemic and rising development of solutions across organizations, more and more workshops were conducted online with software support. However, existing software tools insufficiently address the different workshop situations in terms of the process (i.e., fixed tasks to conduct), the place (e.g., static online whiteboards), and people (i.e., synchronous working of all stakeholders).\r\nTherefore, we propose a design science study to develop a situation-specific software support that can be configured with flexible development processes, different places, and task-related people. Based on practical experience in existing research projects, we derive the initial design requirements and map them to a set of design principles. Out of that, we design a concept with its implementation as a software tool and point out open challenges. ","lang":"eng"}],"publication":"Proceedings of the 5th International Workshop on Software-intensive Business (IWSiB'22) ","type":"conference"},{"language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Subproject A1"}],"_id":"30239","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"dissertation","title":"Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks","doi":"10.17619/UNIPB/1-1673 ","date_updated":"2023-03-17T07:22:04Z","date_created":"2022-03-11T06:05:54Z","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"author":[{"last_name":"Kolb","full_name":"Kolb, Christina","first_name":"Christina"}],"year":"2022","citation":{"apa":"Kolb, C. (2022). <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>","mla":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>.","short":"C. Kolb, Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022.","bibtex":"@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>}, author={Kolb, Christina}, year={2022} }","ama":"Kolb C. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">10.17619/UNIPB/1-1673 </a>","chicago":"Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1673 \">https://doi.org/10.17619/UNIPB/1-1673 </a>.","ieee":"C. Kolb, <i>Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks</i>. 2022."}},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"43057","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"37953","year":"2022","citation":{"ieee":"O. Sowinski, <i>Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. 2022.","chicago":"Sowinski, Olivia. <i>Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse</i>, 2022.","ama":"Sowinski O. <i>Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse</i>.; 2022.","apa":"Sowinski, O. (2022). <i>Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse</i>.","mla":"Sowinski, Olivia. <i>Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. 2022.","bibtex":"@book{Sowinski_2022, title={Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse}, author={Sowinski, Olivia}, year={2022} }","short":"O. Sowinski, Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse, 2022."},"title":"Zu den Auswirkungen von Big Data auf personalisierte Angebote in digitalen Märkten - eine wettbewerbspolitische Analyse","date_updated":"2023-03-22T08:01:48Z","author":[{"first_name":"Olivia","last_name":"Sowinski","full_name":"Sowinski, Olivia"}],"date_created":"2023-03-22T08:01:45Z","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}]},{"citation":{"short":"T. Schmidt, Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates, 2022.","bibtex":"@book{Schmidt_2022, title={Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates}, author={Schmidt, Thomas}, year={2022} }","mla":"Schmidt, Thomas. <i>Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates</i>. 2022.","apa":"Schmidt, T. (2022). <i>Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates</i>.","chicago":"Schmidt, Thomas. <i>Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates</i>, 2022.","ieee":"T. Schmidt, <i>Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates</i>. 2022.","ama":"Schmidt T. <i>Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates</i>.; 2022."},"year":"2022","title":"Zu den Vor- und Nachteilen von Luftfahrtallianzen - Eine wettbewerbspolitische Perspektive auf den Alleingang von Emirates","date_created":"2023-03-22T08:00:00Z","author":[{"first_name":"Thomas","full_name":"Schmidt, Thomas","last_name":"Schmidt"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"date_updated":"2023-03-22T08:00:08Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"user_id":"37953","department":[{"_id":"280"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"43056"},{"date_updated":"2023-03-22T08:05:52Z","author":[{"last_name":"Yeboah","full_name":"Yeboah, Amoabeng","first_name":"Amoabeng"}],"supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"date_created":"2023-03-22T08:05:40Z","title":"An Economic Analysis of Mergers and Aquisitions - The case of Facebook and WhatsApp","year":"2022","citation":{"ama":"Yeboah A. <i>An Economic Analysis of Mergers and Aquisitions - The Case of Facebook and WhatsApp</i>.; 2022.","ieee":"A. Yeboah, <i>An Economic Analysis of Mergers and Aquisitions - The case of Facebook and WhatsApp</i>. 2022.","chicago":"Yeboah, Amoabeng. <i>An Economic Analysis of Mergers and Aquisitions - The Case of Facebook and WhatsApp</i>, 2022.","apa":"Yeboah, A. (2022). <i>An Economic Analysis of Mergers and Aquisitions - The case of Facebook and WhatsApp</i>.","short":"A. Yeboah, An Economic Analysis of Mergers and Aquisitions - The Case of Facebook and WhatsApp, 2022.","bibtex":"@book{Yeboah_2022, title={An Economic Analysis of Mergers and Aquisitions - The case of Facebook and WhatsApp}, author={Yeboah, Amoabeng}, year={2022} }","mla":"Yeboah, Amoabeng. <i>An Economic Analysis of Mergers and Aquisitions - The Case of Facebook and WhatsApp</i>. 2022."},"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"43059","user_id":"37953","department":[{"_id":"280"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"publication_status":"published","publication_identifier":{"issn":["0890-5401"]},"citation":{"ieee":"T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,” <i>Information and Computation</i>, Art. no. 104697, 2022, doi: <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","chicago":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 2022. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>.","ama":"Knollmann T, Scheideler C. A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>. Published online 2022. doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>","mla":"Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.” <i>Information and Computation</i>, 104697, 2022, doi:<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>.","bibtex":"@article{Knollmann_Scheideler_2022, title={A self-stabilizing Hashed Patricia Trie}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2021.104697\">10.1016/j.ic.2021.104697</a>}, number={104697}, journal={Information and Computation}, author={Knollmann, Till and Scheideler, Christian}, year={2022} }","short":"T. Knollmann, C. Scheideler, Information and Computation (2022).","apa":"Knollmann, T., &#38; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. <i>Information and Computation</i>, Article 104697. <a href=\"https://doi.org/10.1016/j.ic.2021.104697\">https://doi.org/10.1016/j.ic.2021.104697</a>"},"year":"2022","author":[{"orcid":"0000-0003-2014-4696","last_name":"Knollmann","full_name":"Knollmann, Till","id":"39241","first_name":"Till"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2021-01-29T09:39:40Z","date_updated":"2023-03-27T07:56:48Z","doi":"10.1016/j.ic.2021.104697","title":"A self-stabilizing Hashed Patricia Trie","type":"journal_article","publication":"Information and Computation","status":"public","abstract":[{"lang":"eng","text":"While many research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed data structures. However, when peers in peer-to-peer networks crash, a distributed data structure may not remain intact. We present a self-stabilizing protocol for a distributed data structure called the Hashed Patricia Trie (Kniesburges and Scheideler WALCOM'11) that enables efficient prefix search on a set of keys. The data structure has many applications while offering low overhead and efficient operations when embedded on top of a Distributed Hash Table. Especially, longest prefix matching for x can be done in O(log |x|) hash table read accesses. We show how to maintain the structure in a self-stabilizing way, while assuring a low overhead in a legal state and an asymptotically optimal memory demand of O(d) bits, where d is the number of bits needed for storing all keys."}],"user_id":"15504","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"21096","language":[{"iso":"eng"}],"article_number":"104697"},{"author":[{"first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","last_name":"Ahmed","id":"72764","full_name":"Ahmed, Qazi Arbab"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"date_created":"2022-07-12T19:56:48Z","publisher":"IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)","date_updated":"2023-04-19T15:04:30Z","conference":{"start_date":" July 4, 2022","name":"IEEE Computer Society Annual Symposium on VLSI Aliathon Resort,","location":"Pafos, Cyprus","end_date":"July 6, 2022"},"title":"On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs","citation":{"bibtex":"@inproceedings{Ahmed_Platzner_2022, place={Pafos, Cyprus}, title={On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs}, publisher={IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)}, author={Ahmed, Qazi Arbab and Platzner, Marco}, year={2022} }","mla":"Ahmed, Qazi Arbab, and Marco Platzner. <i>On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs</i>. IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022.","short":"Q.A. Ahmed, M. Platzner, in: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), Pafos, Cyprus, 2022.","apa":"Ahmed, Q. A., &#38; Platzner, M. (2022). <i>On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs</i>. IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus.","chicago":"Ahmed, Qazi Arbab, and Marco Platzner. “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs.” Pafos, Cyprus: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022.","ieee":"Q. A. Ahmed and M. Platzner, “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs,” presented at the IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus, 2022.","ama":"Ahmed QA, Platzner M. On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs. In: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022); 2022."},"place":"Pafos, Cyprus","year":"2022","user_id":"72764","department":[{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"_id":"32342","language":[{"iso":"eng"}],"type":"conference","status":"public"},{"year":"2022","citation":{"apa":"Hensel, J. (2022). <i>Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse</i>.","mla":"Hensel, Jason. <i>Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse</i>. 2022.","short":"J. Hensel, Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse, 2022.","bibtex":"@book{Hensel_2022, title={Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse}, author={Hensel, Jason}, year={2022} }","ieee":"J. Hensel, <i>Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse</i>. 2022.","chicago":"Hensel, Jason. <i>Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse</i>, 2022.","ama":"Hensel J. <i>Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse</i>.; 2022."},"status":"public","type":"mastersthesis","title":"Zu Online-Vergleichsportalen und deren Auswirkungen auf den Markt - Eine wettbewerbspolitische Analyse","language":[{"iso":"ger"}],"date_updated":"2023-03-10T10:02:56Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"42947","date_created":"2023-03-10T10:02:45Z","user_id":"37953","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"author":[{"full_name":"Hensel, Jason","last_name":"Hensel","first_name":"Jason"}],"department":[{"_id":"280"}]},{"title":"The Impact of Product Differentiation on Retail Bundling in a Vertical Market","author":[{"last_name":"Endres-Fröhlich","full_name":"Endres-Fröhlich, Angelika Elfriede","id":"48794","first_name":"Angelika Elfriede"},{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"},{"first_name":"Joachim","full_name":"Heinzel, Joachim","last_name":"Heinzel"}],"date_created":"2023-04-20T16:21:28Z","date_updated":"2023-04-20T17:15:48Z","page":"43","citation":{"short":"A.E. Endres-Fröhlich, B. Hehenkamp, J. Heinzel, The Impact of Product Differentiation on Retail Bundling in a Vertical Market, n.d.","bibtex":"@book{Endres-Fröhlich_Hehenkamp_Heinzel, title={The Impact of Product Differentiation on Retail Bundling in a Vertical Market}, author={Endres-Fröhlich, Angelika Elfriede and Hehenkamp, Burkhard and Heinzel, Joachim} }","mla":"Endres-Fröhlich, Angelika Elfriede, et al. <i>The Impact of Product Differentiation on Retail Bundling in a Vertical Market</i>.","apa":"Endres-Fröhlich, A. E., Hehenkamp, B., &#38; Heinzel, J. (n.d.). <i>The Impact of Product Differentiation on Retail Bundling in a Vertical Market</i>.","ama":"Endres-Fröhlich AE, Hehenkamp B, Heinzel J. <i>The Impact of Product Differentiation on Retail Bundling in a Vertical Market</i>.","chicago":"Endres-Fröhlich, Angelika Elfriede, Burkhard Hehenkamp, and Joachim Heinzel. <i>The Impact of Product Differentiation on Retail Bundling in a Vertical Market</i>, n.d.","ieee":"A. E. Endres-Fröhlich, B. Hehenkamp, and J. Heinzel, <i>The Impact of Product Differentiation on Retail Bundling in a Vertical Market</i>. ."},"jel":["D43","L13","L42"],"year":"2022","publication_status":"draft","language":[{"iso":"eng"}],"keyword":["Retail bundling","upstream market power","double marginalization","product differentiation"],"department":[{"_id":"280"},{"_id":"475"}],"user_id":"37339","_id":"44091","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"status":"public","abstract":[{"text":"We study the effects of product differentiation on the bundling incentives of a two-product retailer. Two monopolistic manufacturers each produce a differentiated good. One sells it to both retailers, while the other only supplies a single retailer. Retailers compete in prices. Retail bundling is profitable when the goods are close substitutes. Only then is competition so intense that the retailer uses bundling to relax competition both within and across product markets, despite an aggravation of the double marginalization problem. Our asymmetric market structure arises endogenously for the case of close substitutes. In this case, bundling reduces social welfare.","lang":"eng"}],"type":"report"},{"year":"2022","citation":{"chicago":"Ahmed, Mobeen. <i>Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing</i>, 2022.","ieee":"M. Ahmed, <i>Knowledge Base Enhanced &#38; User-centric Dialogue Design for OTF Computing</i>. 2022.","ama":"Ahmed M. <i>Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing</i>.; 2022.","short":"M. Ahmed, Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing, 2022.","mla":"Ahmed, Mobeen. <i>Knowledge Base Enhanced &#38; User-Centric Dialogue Design for OTF Computing</i>. 2022.","bibtex":"@book{Ahmed_2022, title={Knowledge Base Enhanced &#38; User-centric Dialogue Design for OTF Computing}, author={Ahmed, Mobeen}, year={2022} }","apa":"Ahmed, M. (2022). <i>Knowledge Base Enhanced &#38; User-centric Dialogue Design for OTF Computing</i>."},"publication_status":"published","has_accepted_license":"1","title":"Knowledge Base Enhanced & User-centric Dialogue Design for OTF Computing","date_updated":"2023-05-02T13:25:45Z","author":[{"full_name":"Ahmed, Mobeen","last_name":"Ahmed","first_name":"Mobeen"}],"date_created":"2021-12-16T15:13:07Z","supervisor":[{"last_name":"Kersting","id":"58701","full_name":"Kersting, Joschka","first_name":"Joschka"}],"abstract":[{"text":"This thesis aims to provide a bidirectional chatbot solution for the requirement engineering process. The Sonderforschungsbereich (SFB) 901 intends to provide the composition of software service On-the-Fly (OTF). The sub-project (B1) of the SFB 901 project deals with the parameters of service configuration. OTF Computing aims to eradicate the dependency on the requirement engineers for the software development process. However, there is no existing bidirectional chatbot solution that analyses user software requirements and provides viable suggestions to the user regarding their service. Previously, CORDULA chatbot was developed to analyze the software requirements but cannot keep the conversation’s context. The Rasa framework is integrated with the knowledge base to solve the issue, the knowledge base provides domain-specific knowledge to the chatbot. The software description is passed through the natural language understanding process to give consciousness to the chatbot. This process involves various machine learning models, including app family classification, to correctly identify the domain for user OTF service. The statistical models like naïve Bayes, kNN and SVM are compared with transformer models for this classification task. Furthermore, the entities (functional requirements) are also separated from the user description.\r\nThe chatbot provides the suggestion of requirements from the preliminary service template with the support of the knowledge base. Furthermore, the generated response is compared with the state-of-the-art DialoGPT transformer model and ChatterBot conversational library. These models are trained over the software development related conversational dataset. All the responses are ranked using the DialoRPT model, and the BLEU score to evaluates the models’ responses. Moreover, the chatbot mod- els are tested with human participants, they used and scored the chatbot responses based on effectiveness, efficiency and satisfaction. The overall response accuracy is also measured by averaging the user approval over the generated responses.","lang":"eng"}],"file":[{"date_created":"2023-05-02T13:25:27Z","creator":"jkers","date_updated":"2023-05-02T13:25:27Z","file_id":"44325","access_level":"closed","file_name":"Thesis-Report-MOBEEN-AHMED-6856465-Knowledge_Base_Enhanced___User_centric_Dialogue_Design_for_OTFComputing.pdf","file_size":3092211,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","type":"mastersthesis","ddc":["004"],"file_date_updated":"2023-05-02T13:25:27Z","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"_id":"29000","user_id":"58701","department":[{"_id":"600"}]},{"type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"}],"_id":"42326","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"language":[{"iso":"ger"}],"year":"2022","citation":{"ama":"N. N. <i>Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers</i>. Universität Paderborn; 2022.","chicago":"N., N. <i>Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers</i>. Universität Paderborn, 2022.","ieee":"N. N., <i>Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers</i>. Universität Paderborn, 2022.","apa":"N., N. (2022). <i>Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers</i>. Universität Paderborn.","bibtex":"@book{N._2022, title={Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }","short":"N. N., Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers, Universität Paderborn, 2022.","mla":"N., N. <i>Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers</i>. Universität Paderborn, 2022."},"date_updated":"2023-05-23T12:18:19Z","publisher":"Universität Paderborn","author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"supervisor":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"}],"date_created":"2023-02-22T11:45:26Z","title":"Manipulation durch Fake-Bewertungen: Einfluss von Such- und Erfahrungsgütern auf das manipulative Verhalten des Verkäufers"},{"year":"2022","citation":{"mla":"N., N. <i>An Analysis of Coalition Formation Methods to Achieve Maximum Social Surplus</i>. Universität Paderborn, 2022.","bibtex":"@book{N._2022, title={An Analysis of Coalition Formation Methods to achieve Maximum Social Surplus}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }","short":"N. N., An Analysis of Coalition Formation Methods to Achieve Maximum Social Surplus, Universität Paderborn, 2022.","apa":"N., N. (2022). <i>An Analysis of Coalition Formation Methods to achieve Maximum Social Surplus</i>. Universität Paderborn.","ama":"N. N. <i>An Analysis of Coalition Formation Methods to Achieve Maximum Social Surplus</i>. Universität Paderborn; 2022.","ieee":"N. N., <i>An Analysis of Coalition Formation Methods to achieve Maximum Social Surplus</i>. Universität Paderborn, 2022.","chicago":"N., N. <i>An Analysis of Coalition Formation Methods to Achieve Maximum Social Surplus</i>. Universität Paderborn, 2022."},"publisher":"Universität Paderborn","date_updated":"2023-05-23T12:42:41Z","supervisor":[{"last_name":"Duman","full_name":"Duman, Papatya","id":"72752","first_name":"Papatya"}],"date_created":"2023-02-22T11:38:07Z","author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"title":"An Analysis of Coalition Formation Methods to achieve Maximum Social Surplus","type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"42322","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"language":[{"iso":"eng"}]},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"42324","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"language":[{"iso":"ger"}],"type":"mastersthesis","status":"public","date_updated":"2023-05-23T12:43:37Z","publisher":"Universität Paderborn","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"}],"date_created":"2023-02-22T11:41:40Z","title":"Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse","year":"2022","citation":{"ama":"N. N. <i>Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse</i>. Universität Paderborn; 2022.","ieee":"N. N., <i>Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse</i>. Universität Paderborn, 2022.","chicago":"N., N. <i>Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse</i>. Universität Paderborn, 2022.","mla":"N., N. <i>Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse</i>. Universität Paderborn, 2022.","short":"N. N., Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse, Universität Paderborn, 2022.","bibtex":"@book{N._2022, title={Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }","apa":"N., N. (2022). <i>Die Möglichkeiten der Blockchain-Technologie im Supply Chain Management - eine spieltheoretische Analyse</i>. Universität Paderborn."}},{"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"42318","status":"public","type":"mastersthesis","title":"Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations","author":[{"first_name":"N.","full_name":"N., N.","last_name":"N."}],"date_created":"2023-02-22T11:33:00Z","supervisor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801","first_name":"Claus-Jochen"}],"publisher":"Universität Paderborn","date_updated":"2023-05-23T12:43:12Z","citation":{"apa":"N., N. (2022). <i>Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations</i>. Universität Paderborn.","short":"N. N., Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations, Universität Paderborn, 2022.","bibtex":"@book{N._2022, title={Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }","mla":"N., N. <i>Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations</i>. Universität Paderborn, 2022.","chicago":"N., N. <i>Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations</i>. Universität Paderborn, 2022.","ieee":"N. N., <i>Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations</i>. Universität Paderborn, 2022.","ama":"N. N. <i>Kindergarten Allocation and the Tradeoff between Stability and Diversity Considerations</i>. Universität Paderborn; 2022."},"year":"2022"},{"language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"_id":"42319","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"status":"public","type":"mastersthesis","title":"Effect of the Agent's bargaining positions in the efficiency of matching markets","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:43:03Z","date_created":"2023-02-22T11:34:11Z","supervisor":[{"first_name":"Papatya","last_name":"Duman","id":"72752","full_name":"Duman, Papatya"}],"author":[{"first_name":"N.","last_name":"N.","full_name":"N., N."}],"year":"2022","citation":{"bibtex":"@book{N._2022, title={Effect of the Agent’s bargaining positions in the efficiency of matching markets}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }","mla":"N., N. <i>Effect of the Agent’s Bargaining Positions in the Efficiency of Matching Markets</i>. Universität Paderborn, 2022.","short":"N. N., Effect of the Agent’s Bargaining Positions in the Efficiency of Matching Markets, Universität Paderborn, 2022.","apa":"N., N. (2022). <i>Effect of the Agent’s bargaining positions in the efficiency of matching markets</i>. Universität Paderborn.","chicago":"N., N. <i>Effect of the Agent’s Bargaining Positions in the Efficiency of Matching Markets</i>. Universität Paderborn, 2022.","ieee":"N. N., <i>Effect of the Agent’s bargaining positions in the efficiency of matching markets</i>. Universität Paderborn, 2022.","ama":"N. N. <i>Effect of the Agent’s Bargaining Positions in the Efficiency of Matching Markets</i>. Universität Paderborn; 2022."}},{"supervisor":[{"id":"13264","full_name":"Stroh-Maraun, Nadja","last_name":"Stroh-Maraun","first_name":"Nadja"}],"author":[{"last_name":"N.","full_name":"N., N.","first_name":"N."}],"date_created":"2023-02-22T11:40:00Z","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:42:53Z","title":"Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus","citation":{"chicago":"N., N. <i>Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus</i>. Universität Paderborn, 2022.","ieee":"N. N., <i>Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus</i>. Universität Paderborn, 2022.","ama":"N. N. <i>Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus</i>. Universität Paderborn; 2022.","mla":"N., N. <i>Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus</i>. Universität Paderborn, 2022.","bibtex":"@book{N._2022, title={Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }","short":"N. N., Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus, Universität Paderborn, 2022.","apa":"N., N. (2022). <i>Stabile Zuordnung mit Paaren - Der neue NRMP Algorithmus</i>. Universität Paderborn."},"year":"2022","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","_id":"42323","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"title":"School choice with reserves and quotas","publisher":"Universität Paderborn","date_updated":"2023-05-23T12:43:46Z","date_created":"2023-02-22T11:35:21Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"supervisor":[{"first_name":"Papatya","last_name":"Duman","full_name":"Duman, Papatya","id":"72752"}],"year":"2022","citation":{"ama":"N. N. <i>School Choice with Reserves and Quotas</i>. Universität Paderborn; 2022.","ieee":"N. N., <i>School choice with reserves and quotas</i>. Universität Paderborn, 2022.","chicago":"N., N. <i>School Choice with Reserves and Quotas</i>. Universität Paderborn, 2022.","apa":"N., N. (2022). <i>School choice with reserves and quotas</i>. Universität Paderborn.","short":"N. N., School Choice with Reserves and Quotas, Universität Paderborn, 2022.","mla":"N., N. <i>School Choice with Reserves and Quotas</i>. Universität Paderborn, 2022.","bibtex":"@book{N._2022, title={School choice with reserves and quotas}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }"},"language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"42320","user_id":"477","department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"status":"public","type":"mastersthesis"},{"type":"mastersthesis","status":"public","_id":"42325","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"204"},{"_id":"205"},{"_id":"475"},{"_id":"200"}],"user_id":"477","language":[{"iso":"ger"}],"year":"2022","citation":{"apa":"N., N. (2022). <i>Organisation von Zeitbörsen</i>. Universität Paderborn.","mla":"N., N. <i>Organisation von Zeitbörsen</i>. Universität Paderborn, 2022.","short":"N. N., Organisation von Zeitbörsen, Universität Paderborn, 2022.","bibtex":"@book{N._2022, title={Organisation von Zeitbörsen}, publisher={Universität Paderborn}, author={N., N.}, year={2022} }","ama":"N. N. <i>Organisation von Zeitbörsen</i>. Universität Paderborn; 2022.","ieee":"N. N., <i>Organisation von Zeitbörsen</i>. Universität Paderborn, 2022.","chicago":"N., N. <i>Organisation von Zeitbörsen</i>. Universität Paderborn, 2022."},"date_updated":"2023-05-23T12:43:29Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen","id":"20801"}],"date_created":"2023-02-22T11:42:32Z","author":[{"full_name":"N., N.","last_name":"N.","first_name":"N."}],"title":"Organisation von Zeitbörsen"}]