[{"conference":{"location":"Helsinki","end_date":"2018-08-24","start_date":"2018-08-23","name":"14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) "},"title":"Competitive Routing in Hybrid Communication Networks","date_created":"2018-10-02T07:06:05Z","author":[{"first_name":"Daniel","id":"37827","full_name":"Jung, Daniel","last_name":"Jung"},{"first_name":"Christina","id":"43647","full_name":"Kolb, Christina","last_name":"Kolb"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"last_name":"Sundermeier","full_name":"Sundermeier, Jannik","id":"38705","first_name":"Jannik"}],"publisher":"Springer","date_updated":"2022-01-06T07:01:11Z","citation":{"apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Helsinki: Springer.","mla":"Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Springer, 2018.","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Competitive Routing in Hybrid Communication Networks}, booktitle={Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) }, publisher={Springer}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer; 2018.","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>. Springer, 2018.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) </i>, Helsinki, 2018."},"year":"2018","has_accepted_license":"1","file_date_updated":"2019-01-11T10:32:38Z","language":[{"iso":"eng"}],"keyword":["greedy routing","ad hoc networks","convex hulls","c-competitiveness"],"ddc":["000"],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"38705","_id":"4563","project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","file":[{"date_created":"2019-01-11T10:32:38Z","creator":"ups","date_updated":"2019-01-11T10:32:38Z","file_id":"6621","file_name":"23hybrid.pdf","access_level":"closed","file_size":349034,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"Routing is a challenging problem for wireless ad hoc networks, especially when the nodes are mobile and spread so widely that in most cases multiple hops are needed to route a message from one node to another. In fact, it is known that any online routing protocol has a poor performance in the worst case, in a sense that there is a distribution of nodes resulting in bad routing paths for that protocol, even if the nodes know their geographic positions and the geographic position of the destination of a message is known. The reason for that is that radio holes in the ad hoc network may require messages to take long detours in order to get to a destination, which are hard to find in an online fashion.\r\n\r\nIn this paper, we assume that the wireless ad hoc network can make limited use of long-range links provided by a global communication infrastructure like a cellular infrastructure or a satellite in order to compute an abstraction of the wireless ad hoc network that allows the messages to be sent along near-shortest paths in the ad hoc network. We present distributed algorithms that compute an abstraction of the ad hoc network in $\\mathcal{O}\\left(\\log ^2 n\\right)$ time using long-range links, which results in $c$-competitive routing paths between any two nodes of the ad hoc network for some constant $c$ if the convex hulls of the radio holes do not intersect. We also show that the storage needed for the abstraction just depends on the number and size of the radio holes in the wireless ad hoc network and is independent on the total number of nodes, and this information just has to be known to a few nodes for the routing to work.\r\n"}],"publication":"Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ","type":"conference"},{"date_updated":"2022-01-06T07:01:11Z","volume":27,"author":[{"last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Sonja","full_name":"Recker, Sonja","last_name":"Recker"}],"doi":"10.1007/s10726-018-9592-8","has_accepted_license":"1","publication_status":"published","page":"905-932","intvolume":"        27","citation":{"ama":"Haake C-J, Recker S. The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. <i>Group Decision and Negotiation</i>. 2018;27(6):905-932. doi:<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>","chicago":"Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information.” <i>Group Decision and Negotiation</i> 27, no. 6 (2018): 905–32. <a href=\"https://doi.org/10.1007/s10726-018-9592-8\">https://doi.org/10.1007/s10726-018-9592-8</a>.","ieee":"C.-J. Haake and S. Recker, “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information,” <i>Group Decision and Negotiation</i>, vol. 27, no. 6, pp. 905–932, 2018.","mla":"Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information.” <i>Group Decision and Negotiation</i>, vol. 27, no. 6, Springer, 2018, pp. 905–32, doi:<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>.","bibtex":"@article{Haake_Recker_2018, title={The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information}, volume={27}, DOI={<a href=\"https://doi.org/10.1007/s10726-018-9592-8\">10.1007/s10726-018-9592-8</a>}, number={6}, journal={Group Decision and Negotiation}, publisher={Springer}, author={Haake, Claus-Jochen and Recker, Sonja}, year={2018}, pages={905–932} }","short":"C.-J. Haake, S. Recker, Group Decision and Negotiation 27 (2018) 905–932.","apa":"Haake, C.-J., &#38; Recker, S. (2018). The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. <i>Group Decision and Negotiation</i>, <i>27</i>(6), 905–932. <a href=\"https://doi.org/10.1007/s10726-018-9592-8\">https://doi.org/10.1007/s10726-018-9592-8</a>"},"jel":["C78"],"_id":"4564","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"205"},{"_id":"475"}],"user_id":"477","article_type":"original","file_date_updated":"2018-10-31T07:43:31Z","type":"journal_article","status":"public","publisher":"Springer","date_created":"2018-10-02T07:15:26Z","title":"The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information","quality_controlled":"1","issue":"6","year":"2018","ddc":["040"],"language":[{"iso":"eng"}],"publication":"Group Decision and Negotiation","abstract":[{"lang":"eng","text":"  In our model two divisions negotiate over type-dependent contracts to\r\n  determine an intrafirm transfer price for an intermediate product. Since the\r\n  upstream division's (seller's) costs and downstream division's (buyer's)\r\n  revenues are supposed to be private information, we formally consider\r\n  cooperative bargaining problems under incomplete information.  This means\r\n  that the two divisions consider allocations of expected utility generated by\r\n  mechanisms that satisfy (interim) individual rationality, incentive\r\n  compatibility and/or ex post efficiency.  Assuming two possible types for\r\n  buyer and seller each, we first establish that the bargaining problem is\r\n  regular, regardless whether or not incentive and/or efficiency constraints\r\n  are imposed. This allows us to apply the generalized Nash bargaining\r\n  solution to determine fair transfer payments and transfer\r\n  quantities. In particular, the generalized Nash bargaining solution tries to\r\n  balance divisional profits, while incentive constraints are still in\r\n  place. In that sense a fair profit division is generated. Furthermore, by\r\n  means of illustrative examples we derive general properties of this solution\r\n  for the transfer pricing problem and compare the model developed here with\r\n  the models existing in the literature. We demonstrate that there is a\r\n  tradeoff between ex post efficiency and fairness.\r\n"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":636521,"file_name":"The Generalized Nash Bargaining Solution for Transfer Price Negotiations Under Incomplete Information.pdf","access_level":"closed","file_id":"5107","date_updated":"2018-10-31T07:43:31Z","date_created":"2018-10-31T07:43:31Z","creator":"stela"}]},{"date_created":"2018-10-02T07:34:47Z","author":[{"full_name":"Jung, Daniel","id":"37827","last_name":"Jung","first_name":"Daniel"},{"full_name":"Kolb, Christina","id":"43647","last_name":"Kolb","first_name":"Christina"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik","first_name":"Jannik"}],"publisher":"ACM Press","date_updated":"2022-01-06T07:01:12Z","conference":{"start_date":"2018-07-17","name":"SPAA'18","location":"Wien","end_date":"2018-07-18"},"doi":"10.1145/3210377.3210663","title":"Brief Announcement: Competitive Routing in Hybrid Communication Networks","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9781450357999"]},"citation":{"ama":"Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>","chicago":"Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>.","ieee":"D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, Wien, 2018.","apa":"Jung, D., Kolb, C., Scheideler, C., &#38; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. Wien: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210663\">https://doi.org/10.1145/3210377.3210663</a>","mla":"Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>.","bibtex":"@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210663\">10.1145/3210377.3210663</a>}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM Press}, author={Jung, Daniel and Kolb, Christina and Scheideler, Christian and Sundermeier, Jannik}, year={2018} }","short":"D. Jung, C. Kolb, C. Scheideler, J. Sundermeier, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018."},"year":"2018","user_id":"38705","department":[{"_id":"63"},{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"4565","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T13:48:10Z","ddc":["000"],"type":"conference","publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA)","file":[{"file_size":1025077,"access_level":"closed","file_id":"5254","file_name":"p231-jung-1.pdf","date_updated":"2018-11-02T13:48:10Z","creator":"ups","date_created":"2018-11-02T13:48:10Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public"},{"has_accepted_license":"1","year":"2018","citation":{"apa":"Bohn, N., &#38; Kundisch, D. (2018). An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model. In <i>Proceedings of the 39th International Conference on Information Systems (ICIS)</i>. San Francisco, USA.","bibtex":"@inproceedings{Bohn_Kundisch_2018, title={An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model}, booktitle={Proceedings of the 39th International Conference on Information Systems (ICIS)}, author={Bohn, Nicolai and Kundisch, Dennis}, year={2018} }","short":"N. Bohn, D. Kundisch, in: Proceedings of the 39th International Conference on Information Systems (ICIS), 2018.","mla":"Bohn, Nicolai, and Dennis Kundisch. “An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model.” <i>Proceedings of the 39th International Conference on Information Systems (ICIS)</i>, 2018.","ama":"Bohn N, Kundisch D. An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model. In: <i>Proceedings of the 39th International Conference on Information Systems (ICIS)</i>. ; 2018.","chicago":"Bohn, Nicolai, and Dennis Kundisch. “An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model.” In <i>Proceedings of the 39th International Conference on Information Systems (ICIS)</i>, 2018.","ieee":"N. Bohn and D. Kundisch, “An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model,” in <i>Proceedings of the 39th International Conference on Information Systems (ICIS)</i>, San Francisco, USA, 2018."},"date_updated":"2022-01-06T07:01:13Z","date_created":"2018-10-02T13:05:12Z","author":[{"id":"10342","full_name":"Bohn, Nicolai","last_name":"Bohn","first_name":"Nicolai"},{"first_name":"Dennis","last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117"}],"title":"An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model","conference":{"name":"39th International Conference on Information Systems (ICIS)","location":"San Francisco, USA"},"type":"conference","publication":"Proceedings of the 39th International Conference on Information Systems (ICIS)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5988","file_name":"An Extended Perspective of Technology Pivots in Software Startups.pdf","file_size":808601,"creator":"abursig","date_created":"2018-12-03T15:17:56Z","date_updated":"2018-12-03T15:17:56Z"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C5","_id":"17"}],"_id":"4577","user_id":"16205","department":[{"_id":"276"}],"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-12-03T15:17:56Z"},{"year":"2018","citation":{"bibtex":"@book{Wu_2018, title={Essays on Competition in Health Care Markets}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>}, publisher={Universität Paderborn}, author={Wu, Xing}, year={2018} }","short":"X. Wu, Essays on Competition in Health Care Markets, Universität Paderborn, 2018.","mla":"Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>.","apa":"Wu, X. (2018). <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-358\">https://doi.org/10.17619/UNIPB/1-358</a>","ama":"Wu X. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn; 2018. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-358\">10.17619/UNIPB/1-358</a>","chicago":"Wu, Xing. <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018. <a href=\"https://doi.org/10.17619/UNIPB/1-358\">https://doi.org/10.17619/UNIPB/1-358</a>.","ieee":"X. Wu, <i>Essays on Competition in Health Care Markets</i>. Universität Paderborn, 2018."},"has_accepted_license":"1","title":"Essays on Competition in Health Care Markets","doi":"10.17619/UNIPB/1-358","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:23Z","author":[{"first_name":"Xing","full_name":"Wu, Xing","id":"47829","last_name":"Wu"}],"supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2018-10-23T08:13:11Z","status":"public","file":[{"file_size":893726,"access_level":"closed","file_id":"5381","file_name":"Xing Wu_Essays on Competition in Health Care Markets.pdf","date_updated":"2018-11-06T14:23:51Z","creator":"xwu","date_created":"2018-11-06T14:23:51Z","relation":"main_file","content_type":"application/pdf"}],"type":"dissertation","ddc":["330"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-06T14:23:51Z","_id":"4797","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"280"}],"user_id":"477"},{"type":"bachelorsthesis","status":"public","user_id":"477","department":[{"_id":"280"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"4802","language":[{"iso":"eng"}],"citation":{"ieee":"Y. Akcay, <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb</i>. Universität Paderborn, 2018.","chicago":"Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn, 2018.","ama":"Akcay Y. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn; 2018.","short":"Y. Akcay, Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb, Universität Paderborn, 2018.","mla":"Akcay, Yasemen. <i>Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb</i>. Universität Paderborn, 2018.","bibtex":"@book{Akcay_2018, title={Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb}, publisher={Universität Paderborn}, author={Akcay, Yasemen}, year={2018} }","apa":"Akcay, Y. (2018). <i>Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb</i>. Universität Paderborn."},"year":"2018","supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"date_created":"2018-10-24T06:41:13Z","author":[{"full_name":"Akcay, Yasemen","last_name":"Akcay","first_name":"Yasemen"}],"date_updated":"2022-01-06T07:01:24Z","publisher":"Universität Paderborn","title":"Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb"},{"citation":{"apa":"Görken, E. (2018). <i>Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität Paderborn.","mla":"Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn, 2018.","bibtex":"@book{Görken_2018, title={Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern}, publisher={Universität Paderborn}, author={Görken, Emre}, year={2018} }","short":"E. Görken, Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern, Universität Paderborn, 2018.","chicago":"Görken, Emre. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn, 2018.","ieee":"E. Görken, <i>Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern</i>. Universität Paderborn, 2018.","ama":"Görken E. <i>Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern</i>. Universität Paderborn; 2018."},"year":"2018","title":"Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern","author":[{"last_name":"Görken","full_name":"Görken, Emre","first_name":"Emre"}],"supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2018-10-24T07:05:18Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"280"}],"user_id":"477","_id":"4804","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"}]},{"year":"2018","citation":{"ieee":"A. Dalkiran, <i>Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen</i>. Universität Paderborn, 2018.","chicago":"Dalkiran, Alpaslan. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn, 2018.","ama":"Dalkiran A. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn; 2018.","short":"A. Dalkiran, Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen, Universität Paderborn, 2018.","mla":"Dalkiran, Alpaslan. <i>Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen</i>. Universität Paderborn, 2018.","bibtex":"@book{Dalkiran_2018, title={Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen}, publisher={Universität Paderborn}, author={Dalkiran, Alpaslan}, year={2018} }","apa":"Dalkiran, A. (2018). <i>Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:01:24Z","publisher":"Universität Paderborn","author":[{"first_name":"Alpaslan","last_name":"Dalkiran","full_name":"Dalkiran, Alpaslan"}],"supervisor":[{"first_name":"Burkhard","full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp"}],"date_created":"2018-10-24T07:09:05Z","title":"Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen","type":"bachelorsthesis","status":"public","_id":"4805","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"280"}],"user_id":"477","language":[{"iso":"eng"}]},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"280"}],"user_id":"477","_id":"4806","project":[{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"1","name":"SFB 901"}],"citation":{"chicago":"Gräper, Gerrit. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn, 2018.","ieee":"G. Gräper, <i>The Suitability of Equilibrium Concepts to evaluate competitive behaviour</i>. Universität Paderborn, 2018.","ama":"Gräper G. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn; 2018.","apa":"Gräper, G. (2018). <i>The Suitability of Equilibrium Concepts to evaluate competitive behaviour</i>. Universität Paderborn.","short":"G. Gräper, The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour, Universität Paderborn, 2018.","bibtex":"@book{Gräper_2018, title={The Suitability of Equilibrium Concepts to evaluate competitive behaviour}, publisher={Universität Paderborn}, author={Gräper, Gerrit}, year={2018} }","mla":"Gräper, Gerrit. <i>The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour</i>. Universität Paderborn, 2018."},"year":"2018","title":"The Suitability of Equilibrium Concepts to evaluate competitive behaviour","date_created":"2018-10-24T07:13:33Z","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"author":[{"full_name":"Gräper, Gerrit","last_name":"Gräper","first_name":"Gerrit"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z"},{"language":[{"iso":"eng"}],"_id":"4807","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"280"}],"user_id":"477","status":"public","type":"mastersthesis","title":"Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:24Z","author":[{"full_name":"Hammo, Hüssein","last_name":"Hammo","first_name":"Hüssein"}],"supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"date_created":"2018-10-24T07:17:10Z","year":"2018","citation":{"chicago":"Hammo, Hüssein. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn, 2018.","ieee":"H. Hammo, <i>Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft</i>. Universität Paderborn, 2018.","ama":"Hammo H. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn; 2018.","apa":"Hammo, H. (2018). <i>Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft</i>. Universität Paderborn.","short":"H. Hammo, Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft, Universität Paderborn, 2018.","bibtex":"@book{Hammo_2018, title={Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft}, publisher={Universität Paderborn}, author={Hammo, Hüssein}, year={2018} }","mla":"Hammo, Hüssein. <i>Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft</i>. Universität Paderborn, 2018."}},{"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"author":[{"first_name":"Jessica","last_name":"Brachmann","full_name":"Brachmann, Jessica"}],"date_created":"2018-10-24T08:27:02Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:25Z","title":"Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse","citation":{"bibtex":"@book{Brachmann_2018, title={Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Brachmann, Jessica}, year={2018} }","mla":"Brachmann, Jessica. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","short":"J. Brachmann, Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018.","apa":"Brachmann, J. (2018). <i>Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","ieee":"J. Brachmann, <i>Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","chicago":"Brachmann, Jessica. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ama":"Brachmann J. <i>Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn; 2018."},"year":"2018","department":[{"_id":"280"}],"user_id":"477","_id":"4821","project":[{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901","_id":"1"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2018-10-24T08:34:27Z","author":[{"full_name":"Förstenberg, Niklas","last_name":"Förstenberg","first_name":"Niklas"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:25Z","title":"Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse","citation":{"ieee":"N. Förstenberg, <i>Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","chicago":"Förstenberg, Niklas. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","ama":"Förstenberg N. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn; 2018.","apa":"Förstenberg, N. (2018). <i>Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse</i>. Universität Paderborn.","mla":"Förstenberg, Niklas. <i>Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse</i>. Universität Paderborn, 2018.","bibtex":"@book{Förstenberg_2018, title={Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Förstenberg, Niklas}, year={2018} }","short":"N. Förstenberg, Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018."},"year":"2018","department":[{"_id":"280"}],"user_id":"477","_id":"4822","project":[{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"1","name":"SFB 901"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public"},{"_id":"4827","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"department":[{"_id":"280"}],"user_id":"477","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:25Z","author":[{"last_name":"Khan","full_name":"Khan, Zohaib Ahmad","first_name":"Zohaib Ahmad"}],"supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_created":"2018-10-24T10:02:54Z","title":"How can choice sets be architectured to nudge People into certain decisions?","year":"2018","citation":{"ama":"Khan ZA. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn; 2018.","chicago":"Khan, Zohaib Ahmad. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn, 2018.","ieee":"Z. A. Khan, <i>How can choice sets be architectured to nudge People into certain decisions?</i> Universität Paderborn, 2018.","apa":"Khan, Z. A. (2018). <i>How can choice sets be architectured to nudge People into certain decisions?</i> Universität Paderborn.","bibtex":"@book{Khan_2018, title={How can choice sets be architectured to nudge People into certain decisions?}, publisher={Universität Paderborn}, author={Khan, Zohaib Ahmad}, year={2018} }","mla":"Khan, Zohaib Ahmad. <i>How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?</i> Universität Paderborn, 2018.","short":"Z.A. Khan, How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?, Universität Paderborn, 2018."}},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"4828","user_id":"477","department":[{"_id":"280"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:25Z","date_created":"2018-10-24T10:05:50Z","supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"author":[{"last_name":"Kusch","full_name":"Kusch, Thomas","first_name":"Thomas"}],"title":"Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse","year":"2018","citation":{"apa":"Kusch, T. (2018). <i>Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse</i>. Universität Paderborn.","bibtex":"@book{Kusch_2018, title={Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse}, publisher={Universität Paderborn}, author={Kusch, Thomas}, year={2018} }","mla":"Kusch, Thomas. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn, 2018.","short":"T. Kusch, Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse, Universität Paderborn, 2018.","ieee":"T. Kusch, <i>Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse</i>. Universität Paderborn, 2018.","chicago":"Kusch, Thomas. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn, 2018.","ama":"Kusch T. <i>Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse</i>. Universität Paderborn; 2018."}},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"file_size":492018,"access_level":"closed","file_id":"5296","file_name":"games-09-00089.pdf","date_updated":"2018-11-02T15:15:21Z","date_created":"2018-11-02T15:15:21Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Games","title":" Determinants of Equilibrium Selection in Network Formation - An Experiment","date_created":"2018-10-29T10:27:40Z","publisher":"MDPI","year":"2018","issue":"4","file_date_updated":"2018-11-02T15:15:21Z","article_number":"89","user_id":"42447","department":[{"_id":"280"},{"_id":"475"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"4982","status":"public","type":"journal_article","main_file_link":[{"url":"http://www.mdpi.com/2073-4336/9/4/89/","open_access":"1"}],"author":[{"first_name":"Britta","last_name":"Hoyer","id":"42447","full_name":"Hoyer, Britta"},{"full_name":"Rosenkranz, Stephanie","last_name":"Rosenkranz","first_name":"Stephanie"}],"volume":9,"oa":"1","date_updated":"2022-01-06T07:01:33Z","citation":{"ama":"Hoyer B, Rosenkranz S.  Determinants of Equilibrium Selection in Network Formation - An Experiment. <i>Games</i>. 2018;9(4).","ieee":"B. Hoyer and S. Rosenkranz, “ Determinants of Equilibrium Selection in Network Formation - An Experiment,” <i>Games</i>, vol. 9, no. 4, 2018.","chicago":"Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” <i>Games</i> 9, no. 4 (2018).","apa":"Hoyer, B., &#38; Rosenkranz, S. (2018).  Determinants of Equilibrium Selection in Network Formation - An Experiment. <i>Games</i>, <i>9</i>(4).","mla":"Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” <i>Games</i>, vol. 9, no. 4, 89, MDPI, 2018.","bibtex":"@article{Hoyer_Rosenkranz_2018, title={ Determinants of Equilibrium Selection in Network Formation - An Experiment}, volume={9}, number={489}, journal={Games}, publisher={MDPI}, author={Hoyer, Britta and Rosenkranz, Stephanie}, year={2018} }","short":"B. Hoyer, S. Rosenkranz, Games 9 (2018)."},"intvolume":"         9","has_accepted_license":"1"},{"_id":"7570","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"user_id":"30291","file_date_updated":"2019-02-06T14:18:35Z","type":"conference","status":"public","date_updated":"2022-01-06T07:03:40Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Johannes Sebastian","id":"30291","full_name":"Schaefer, Johannes Sebastian","last_name":"Schaefer"}],"conference":{"name":"30th Symposium on Parallelism in Algorithms and Architectures","start_date":"2018-07-16","end_date":"2018-07-18","location":"Vienna"},"doi":"10.1145/3210377.3210662","publication_identifier":{"isbn":["9781450357999"]},"has_accepted_license":"1","publication_status":"published","citation":{"ama":"Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>","chicago":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>.","ieee":"F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, Vienna, 2018.","bibtex":"@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>}, booktitle={Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18}, publisher={ACM Press}, author={Meyer auf der Heide, Friedhelm and Schaefer, Johannes Sebastian}, year={2018} }","short":"F. Meyer auf der Heide, J.S. Schaefer, in: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018.","mla":"Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3210377.3210662\">10.1145/3210377.3210662</a>.","apa":"Meyer auf der Heide, F., &#38; Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In <i>Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18</i>. Vienna: ACM Press. <a href=\"https://doi.org/10.1145/3210377.3210662\">https://doi.org/10.1145/3210377.3210662</a>"},"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA '18","file":[{"creator":"jschaef","date_created":"2019-02-06T14:18:35Z","date_updated":"2019-02-06T14:18:35Z","file_id":"7576","file_name":"p359-meyer-auf-der-heide.pdf","access_level":"closed","file_size":1504739,"content_type":"application/pdf","relation":"main_file"}],"publisher":"ACM Press","date_created":"2019-02-06T14:16:19Z","title":"Brief Announcement: Communication in Systems of Home Based Mobile Agents","year":"2018"},{"date_updated":"2022-01-06T07:00:57Z","volume":920,"author":[{"last_name":"Bäumer","id":"38837","full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon"},{"first_name":"Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos","id":"42496","full_name":"Geierhos, Michaela"}],"doi":"10.1007/978-3-319-99972-2_46","conference":{"start_date":"2018-10-04","name":"24th International Conference on Information and Software Technologies (ICIST 2018)","location":"Vilnius, Lithuania","end_date":"2018-10-06"},"publication_identifier":{"issn":["1865-0929","1865-0937"],"isbn":["9783319999715","9783319999722"]},"has_accepted_license":"1","publication_status":"published","place":"Cham, Switzerland","page":"559-570","intvolume":"       920","citation":{"apa":"Bäumer, F. S., &#38; Geierhos, M. (2018). NLP in OTF Computing: Current Approaches and Open Challenges. In R. Damaševičius &#38; G. Vasiljevienė (Eds.), <i>Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)</i> (Vol. 920, pp. 559–570). Cham, Switzerland: Springer. <a href=\"https://doi.org/10.1007/978-3-319-99972-2_46\">https://doi.org/10.1007/978-3-319-99972-2_46</a>","mla":"Bäumer, Frederik Simon, and Michaela Geierhos. “NLP in OTF Computing: Current Approaches and Open Challenges.” <i>Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)</i>, edited by Robertas Damaševičius and Giedrė Vasiljevienė, vol. 920, Springer, 2018, pp. 559–70, doi:<a href=\"https://doi.org/10.1007/978-3-319-99972-2_46\">10.1007/978-3-319-99972-2_46</a>.","bibtex":"@inproceedings{Bäumer_Geierhos_2018, place={Cham, Switzerland}, series={Communications in Computer and Information Science}, title={NLP in OTF Computing: Current Approaches and Open Challenges}, volume={920}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-99972-2_46\">10.1007/978-3-319-99972-2_46</a>}, booktitle={Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)}, publisher={Springer}, author={Bäumer, Frederik Simon and Geierhos, Michaela}, editor={Damaševičius, Robertas and Vasiljevienė, GiedrėEditors}, year={2018}, pages={559–570}, collection={Communications in Computer and Information Science} }","short":"F.S. Bäumer, M. Geierhos, in: R. Damaševičius, G. Vasiljevienė (Eds.), Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018), Springer, Cham, Switzerland, 2018, pp. 559–570.","ieee":"F. S. Bäumer and M. Geierhos, “NLP in OTF Computing: Current Approaches and Open Challenges,” in <i>Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)</i>, Vilnius, Lithuania, 2018, vol. 920, pp. 559–570.","chicago":"Bäumer, Frederik Simon, and Michaela Geierhos. “NLP in OTF Computing: Current Approaches and Open Challenges.” In <i>Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)</i>, edited by Robertas Damaševičius and Giedrė Vasiljevienė, 920:559–70. Communications in Computer and Information Science. Cham, Switzerland: Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-99972-2_46\">https://doi.org/10.1007/978-3-319-99972-2_46</a>.","ama":"Bäumer FS, Geierhos M. NLP in OTF Computing: Current Approaches and Open Challenges. In: Damaševičius R, Vasiljevienė G, eds. <i>Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)</i>. Vol 920. Communications in Computer and Information Science. Cham, Switzerland: Springer; 2018:559-570. doi:<a href=\"https://doi.org/10.1007/978-3-319-99972-2_46\">10.1007/978-3-319-99972-2_46</a>"},"_id":"4339","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"series_title":"Communications in Computer and Information Science","user_id":"38837","file_date_updated":"2019-01-11T11:36:10Z","type":"conference","editor":[{"last_name":"Damaševičius","full_name":"Damaševičius, Robertas","first_name":"Robertas"},{"full_name":"Vasiljevienė, Giedrė","last_name":"Vasiljevienė","first_name":"Giedrė"}],"status":"public","publisher":"Springer","date_created":"2018-09-01T08:52:36Z","title":"NLP in OTF Computing: Current Approaches and Open Challenges","quality_controlled":"1","year":"2018","keyword":["Inaccuracy detection","Natural language software requirements"],"ddc":["004"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018)","abstract":[{"text":"On-The-Fly Computing is the vision of covering software needs of end users by fully-automatic compositions of existing software services. End users will receive so-called service compositions tailored to their very individual needs, based on natural language software descriptions. This everyday language may contain inaccuracies and incompleteness, which are well-known challenges in requirements engineering. In addition to existing approaches that try to automatically identify and correct these deficits, there are also new trends to involve users more in the elaboration and refinement process. In this paper, we present the relevant state of the art in the field of automated detection and compensation of multiple inaccuracies in natural language service descriptions and name open challenges needed to be tackled in NL-based software service composition. ","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-01-11T11:36:10Z","creator":"fbaeumer","date_created":"2019-01-11T11:36:10Z","file_size":1053017,"file_id":"6624","access_level":"closed","file_name":"baeumer-4315.pdf"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"4351","series_title":"Lecture Notes in Computer Science","user_id":"23538","department":[{"_id":"79"}],"file_date_updated":"2018-10-31T13:24:17Z","type":"conference","status":"public","date_updated":"2022-01-06T07:00:58Z","author":[{"first_name":"Michael","last_name":"Feldmann","id":"23538","full_name":"Feldmann, Michael"},{"last_name":"Kolb","id":"43647","full_name":"Kolb, Christina","first_name":"Christina"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"volume":11201,"doi":"10.1007/978-3-030-03232-6_2","publication_identifier":{"unknown":["978-3-030-03231-9"]},"has_accepted_license":"1","citation":{"ieee":"M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2018, vol. 11201, pp. 16–31.","chicago":"Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>.","ama":"Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>","apa":"Feldmann, M., Kolb, C., &#38; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (Vol. 11201, pp. 16–31). Springer, Cham. <a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">https://doi.org/10.1007/978-3-030-03232-6_2</a>","mla":"Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” <i>Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>.","bibtex":"@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-03232-6_2\">10.1007/978-3-030-03232-6_2</a>}, booktitle={Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, publisher={Springer, Cham}, author={Feldmann, Michael and Kolb, Christina and Scheideler, Christian}, year={2018}, pages={16–31}, collection={Lecture Notes in Computer Science} }","short":"M. Feldmann, C. Kolb, C. Scheideler, in: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2018, pp. 16–31."},"page":"16-31 ","intvolume":"     11201","external_id":{"arxiv":["1808.10300"]},"ddc":["040"],"language":[{"iso":"eng"}],"publication":"Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","abstract":[{"lang":"eng","text":"\tWe extend the concept of monotonic searchability~\\cite{DBLP:conf/opodis/ScheidelerSS15}~\\cite{DBLP:conf/wdag/ScheidelerSS16} for self-stabilizing systems from one to multiple dimensions.\r\n\tA system is self-stabilizing if it can recover to a legitimate state from any initial illegal state.\r\n\tThese kind of systems are most often used in distributed applications.\r\n\tMonotonic searchability provides guarantees when searching for nodes while the recovery process is going on.\r\n\tMore precisely, if a search request started at some node $u$ succeeds in reaching its destination $v$, then all future search requests from $u$ to $v$ succeed as well.\r\n\tAlthough there already exists a self-stabilizing protocol for a two-dimensional topology~\\cite{DBLP:journals/tcs/JacobRSS12} and an universal approach for monotonic searchability~\\cite{DBLP:conf/wdag/ScheidelerSS16}, it is not clear how both of these concepts fit together effectively.\r\n\tThe latter concept even comes with some restrictive assumptions on messages, which is not the case for our protocol.\r\n\tWe propose a simple novel protocol for a self-stabilizing two-dimensional quadtree that satisfies monotonic searchability.\r\n\tOur protocol can easily be extended to higher dimensions and offers routing in $\\mathcal O(\\log n)$ hops for any search request.\r\n"}],"file":[{"file_size":329823,"access_level":"closed","file_name":"Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf","file_id":"5210","date_updated":"2018-10-31T13:24:17Z","date_created":"2018-10-31T13:24:17Z","creator":"mfeldma2","success":1,"relation":"main_file","content_type":"application/pdf"}],"publisher":"Springer, Cham","date_created":"2018-09-04T14:15:39Z","title":"Self-stabilizing Overlays for high-dimensional Monotonic Searchability","year":"2018"},{"_id":"4373","project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"department":[{"_id":"276"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-11-29T15:03:20Z","language":[{"iso":"eng"}],"publication":"Bosch Business Model Innovation Summit 2018","type":"conference_abstract","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-29T15:03:20Z","creator":"dsz","date_created":"2018-11-29T15:03:20Z","file_size":1180782,"file_name":"Bosch BMI Summit 2018.pdf","access_level":"closed","file_id":"5982"}],"date_updated":"2022-01-06T07:00:59Z","author":[{"id":"36372","full_name":"Szopinski, Daniel","last_name":"Szopinski","first_name":"Daniel"}],"date_created":"2018-09-10T12:26:14Z","title":"Towards software-based tools for business model development: Using external stimuli for business model idea generation","conference":{"location":"Renningen, Germany","name":"Bosch Business Model Innovation Summit 2018"},"quality_controlled":"1","has_accepted_license":"1","year":"2018","citation":{"ama":"Szopinski D. Towards software-based tools for business model development: Using external stimuli for business model idea generation. In: <i>Bosch Business Model Innovation Summit 2018</i>. ; 2018.","ieee":"D. Szopinski, “Towards software-based tools for business model development: Using external stimuli for business model idea generation,” in <i>Bosch Business Model Innovation Summit 2018</i>, Renningen, Germany, 2018.","chicago":"Szopinski, Daniel. “Towards Software-Based Tools for Business Model Development: Using External Stimuli for Business Model Idea Generation.” In <i>Bosch Business Model Innovation Summit 2018</i>, 2018.","bibtex":"@inproceedings{Szopinski_2018, title={Towards software-based tools for business model development: Using external stimuli for business model idea generation}, booktitle={Bosch Business Model Innovation Summit 2018}, author={Szopinski, Daniel}, year={2018} }","mla":"Szopinski, Daniel. “Towards Software-Based Tools for Business Model Development: Using External Stimuli for Business Model Idea Generation.” <i>Bosch Business Model Innovation Summit 2018</i>, 2018.","short":"D. Szopinski, in: Bosch Business Model Innovation Summit 2018, 2018.","apa":"Szopinski, D. (2018). Towards software-based tools for business model development: Using external stimuli for business model idea generation. In <i>Bosch Business Model Innovation Summit 2018</i>. Renningen, Germany."}},{"language":[{"iso":"eng"}],"file_date_updated":"2018-11-27T10:03:33Z","keyword":["Distributed Storage","Multi-Dimensional Range Queries","Peer-to-Peer","Hilbert Curve"],"ddc":["000"],"department":[{"_id":"63"},{"_id":"79"}],"user_id":"14955","_id":"4375","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"status":"public","file":[{"date_updated":"2018-11-27T10:03:33Z","date_created":"2018-11-27T10:03:33Z","creator":"tillk","file_size":1122875,"file_id":"5863","access_level":"closed","file_name":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"We present a peer-to-peer network that supports the efficient processing of orthogonal range queries $R=\\bigtimes_{i=1}^{d}[a_i,\\,b_i]$ in a $d$-dimensional point space.\\\\\r\nThe  network is the same for each dimension, namely a distance halving network like the one introduced by Naor and Wieder (ACM TALG'07).\r\nWe show how to execute such range queries using $\\mathcal{O}\\left(2^{d'}d\\,\\log m + d\\,|R|\\right)$ hops (and the same number of messages) in total. Here $[m]^d$ is the ground set, $|R|$ is the size and $d'$ the dimension of the queried range.\r\nFurthermore, if the peers form a distributed network, the query can be answered in $\\mathcal{O}\\left(d\\,\\log m + d\\,\\sum_{i=1}^{d}(b_i-a_i+1)\\right)$ communication rounds.\r\nOur algorithms are based on a mapping of the Hilbert Curve through $[m]^d$ to the peers."}],"publication":"Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","type":"conference","doi":"10.1007/978-3-030-19759-9_4","conference":{"name":"4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)","start_date":"2018-08-20","end_date":"2018-08-21","location":"Helsinki"},"title":"A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension","author":[{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"first_name":"Till","id":"39241","full_name":"Knollmann, Till","orcid":"0000-0003-2014-4696","last_name":"Knollmann"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Alexander","last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108"},{"first_name":"Jannik","last_name":"Sundermeier","id":"38705","full_name":"Sundermeier, Jannik"}],"date_created":"2018-09-11T05:26:59Z","date_updated":"2022-01-06T07:01:00Z","citation":{"ama":"Benter M, Knollmann T, Meyer auf der Heide F, Setzer A, Sundermeier J. A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In: <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. ; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>","ieee":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, and J. Sundermeier, “A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension,” in <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, Helsinki, 2018.","chicago":"Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>.","apa":"Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &#38; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>. Helsinki. <a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">https://doi.org/10.1007/978-3-030-19759-9_4</a>","bibtex":"@inproceedings{Benter_Knollmann_Meyer auf der Heide_Setzer_Sundermeier_2018, title={A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>}, booktitle={Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)}, author={Benter, Markus and Knollmann, Till and Meyer auf der Heide, Friedhelm and Setzer, Alexander and Sundermeier, Jannik}, year={2018} }","mla":"Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” <i>Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD)</i>, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-030-19759-9_4\">10.1007/978-3-030-19759-9_4</a>.","short":"M. Benter, T. Knollmann, F. Meyer auf der Heide, A. Setzer, J. Sundermeier, in: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018."},"year":"2018","has_accepted_license":"1"}]