--- _id: '4563' 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" author: - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer; 2018.' apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.' 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} }' chicago: Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018. ieee: D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Helsinki, 2018. mla: Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , 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.' conference: end_date: 2018-08-24 location: Helsinki name: '14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ' start_date: 2018-08-23 date_created: 2018-10-02T07:06:05Z date_updated: 2022-01-06T07:01:11Z ddc: - '000' department: - _id: '63' - _id: '79' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2019-01-11T10:32:38Z date_updated: 2019-01-11T10:32:38Z file_id: '6621' file_name: 23hybrid.pdf file_size: 349034 relation: main_file success: 1 file_date_updated: 2019-01-11T10:32:38Z has_accepted_license: '1' keyword: - greedy routing - ad hoc networks - convex hulls - c-competitiveness language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: 'Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) ' publisher: Springer status: public title: Competitive Routing in Hybrid Communication Networks type: conference user_id: '38705' year: '2018' ... --- _id: '4564' 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" article_type: original author: - first_name: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake - first_name: Sonja full_name: Recker, Sonja last_name: Recker citation: ama: Haake C-J, Recker S. The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. Group Decision and Negotiation. 2018;27(6):905-932. doi:10.1007/s10726-018-9592-8 apa: Haake, C.-J., & Recker, S. (2018). The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information. Group Decision and Negotiation, 27(6), 905–932. https://doi.org/10.1007/s10726-018-9592-8 bibtex: '@article{Haake_Recker_2018, title={The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information}, volume={27}, DOI={10.1007/s10726-018-9592-8}, number={6}, journal={Group Decision and Negotiation}, publisher={Springer}, author={Haake, Claus-Jochen and Recker, Sonja}, year={2018}, pages={905–932} }' chicago: 'Haake, Claus-Jochen, and Sonja Recker. “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information.” Group Decision and Negotiation 27, no. 6 (2018): 905–32. https://doi.org/10.1007/s10726-018-9592-8.' ieee: C.-J. Haake and S. Recker, “The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information,” Group Decision and Negotiation, 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.” Group Decision and Negotiation, vol. 27, no. 6, Springer, 2018, pp. 905–32, doi:10.1007/s10726-018-9592-8. short: C.-J. Haake, S. Recker, Group Decision and Negotiation 27 (2018) 905–932. date_created: 2018-10-02T07:15:26Z date_updated: 2022-01-06T07:01:11Z ddc: - '040' department: - _id: '205' - _id: '475' doi: 10.1007/s10726-018-9592-8 file: - access_level: closed content_type: application/pdf creator: stela date_created: 2018-10-31T07:43:31Z date_updated: 2018-10-31T07:43:31Z file_id: '5107' file_name: The Generalized Nash Bargaining Solution for Transfer Price Negotiations Under Incomplete Information.pdf file_size: 636521 relation: main_file success: 1 file_date_updated: 2018-10-31T07:43:31Z has_accepted_license: '1' intvolume: ' 27' issue: '6' jel: - C78 language: - iso: eng page: 905-932 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Group Decision and Negotiation publication_status: published publisher: Springer quality_controlled: '1' status: public title: The Generalized Nash Bargaining Solution for Transfer Price Negotiations under Incomplete Information type: journal_article user_id: '477' volume: 27 year: '2018' ... --- _id: '4565' author: - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier citation: ama: 'Jung D, Kolb C, Scheideler C, Sundermeier J. Brief Announcement: Competitive Routing in Hybrid Communication Networks. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press; 2018. doi:10.1145/3210377.3210663' apa: 'Jung, D., Kolb, C., Scheideler, C., & Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press. https://doi.org/10.1145/3210377.3210663' bibtex: '@inproceedings{Jung_Kolb_Scheideler_Sundermeier_2018, title={Brief Announcement: Competitive Routing in Hybrid Communication Networks}, DOI={10.1145/3210377.3210663}, 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} }' chicago: 'Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018. https://doi.org/10.1145/3210377.3210663.' ieee: 'D. Jung, C. Kolb, C. Scheideler, and J. Sundermeier, “Brief Announcement: Competitive Routing in Hybrid Communication Networks,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), Wien, 2018.' mla: 'Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.' 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.' conference: end_date: 2018-07-18 location: Wien name: SPAA'18 start_date: 2018-07-17 date_created: 2018-10-02T07:34:47Z date_updated: 2022-01-06T07:01:12Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1145/3210377.3210663 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:48:10Z date_updated: 2018-11-02T13:48:10Z file_id: '5254' file_name: p231-jung-1.pdf file_size: 1025077 relation: main_file success: 1 file_date_updated: 2018-11-02T13:48:10Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA) publication_identifier: isbn: - '9781450357999' publication_status: published publisher: ACM Press status: public title: 'Brief Announcement: Competitive Routing in Hybrid Communication Networks' type: conference user_id: '38705' year: '2018' ... --- _id: '4577' author: - first_name: Nicolai full_name: Bohn, Nicolai id: '10342' last_name: Bohn - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: 'Bohn N, Kundisch D. An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model. In: Proceedings of the 39th International Conference on Information Systems (ICIS). ; 2018.' apa: 'Bohn, N., & Kundisch, D. (2018). An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model. In Proceedings of the 39th International Conference on Information Systems (ICIS). 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} }' chicago: 'Bohn, Nicolai, and Dennis Kundisch. “An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model.” In Proceedings of the 39th International Conference on Information Systems (ICIS), 2018.' ieee: 'N. Bohn and D. Kundisch, “An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model,” in Proceedings of the 39th International Conference on Information Systems (ICIS), San Francisco, USA, 2018.' mla: 'Bohn, Nicolai, and Dennis Kundisch. “An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model.” Proceedings of the 39th International Conference on Information Systems (ICIS), 2018.' short: 'N. Bohn, D. Kundisch, in: Proceedings of the 39th International Conference on Information Systems (ICIS), 2018.' conference: location: San Francisco, USA name: 39th International Conference on Information Systems (ICIS) date_created: 2018-10-02T13:05:12Z date_updated: 2022-01-06T07:01:13Z ddc: - '040' department: - _id: '276' file: - access_level: closed content_type: application/pdf creator: abursig date_created: 2018-12-03T15:17:56Z date_updated: 2018-12-03T15:17:56Z file_id: '5988' file_name: An Extended Perspective of Technology Pivots in Software Startups.pdf file_size: 808601 relation: main_file success: 1 file_date_updated: 2018-12-03T15:17:56Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 publication: Proceedings of the 39th International Conference on Information Systems (ICIS) status: public title: 'An Extended Perspective of Technology Pivots in Software Startups: Towards a Theoretical Model' type: conference user_id: '16205' year: '2018' ... --- _id: '4797' author: - first_name: Xing full_name: Wu, Xing id: '47829' last_name: Wu citation: ama: Wu X. Essays on Competition in Health Care Markets. Universität Paderborn; 2018. doi:10.17619/UNIPB/1-358 apa: Wu, X. (2018). Essays on Competition in Health Care Markets. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-358 bibtex: '@book{Wu_2018, title={Essays on Competition in Health Care Markets}, DOI={10.17619/UNIPB/1-358}, publisher={Universität Paderborn}, author={Wu, Xing}, year={2018} }' chicago: Wu, Xing. Essays on Competition in Health Care Markets. Universität Paderborn, 2018. https://doi.org/10.17619/UNIPB/1-358. ieee: X. Wu, Essays on Competition in Health Care Markets. Universität Paderborn, 2018. mla: Wu, Xing. Essays on Competition in Health Care Markets. Universität Paderborn, 2018, doi:10.17619/UNIPB/1-358. short: X. Wu, Essays on Competition in Health Care Markets, Universität Paderborn, 2018. date_created: 2018-10-23T08:13:11Z date_updated: 2022-01-06T07:01:23Z ddc: - '330' department: - _id: '280' doi: 10.17619/UNIPB/1-358 file: - access_level: closed content_type: application/pdf creator: xwu date_created: 2018-11-06T14:23:51Z date_updated: 2018-11-06T14:23:51Z file_id: '5381' file_name: Xing Wu_Essays on Competition in Health Care Markets.pdf file_size: 893726 relation: main_file file_date_updated: 2018-11-06T14:23:51Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Essays on Competition in Health Care Markets type: dissertation user_id: '477' year: '2018' ... --- _id: '4802' author: - first_name: Yasemen full_name: Akcay, Yasemen last_name: Akcay citation: ama: Akcay Y. Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb. Universität Paderborn; 2018. apa: Akcay, Y. (2018). Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb. Universität Paderborn. bibtex: '@book{Akcay_2018, title={Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb}, publisher={Universität Paderborn}, author={Akcay, Yasemen}, year={2018} }' chicago: Akcay, Yasemen. Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb. Universität Paderborn, 2018. ieee: Y. Akcay, Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb. Universität Paderborn, 2018. mla: Akcay, Yasemen. Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb. Universität Paderborn, 2018. short: Y. Akcay, Entrepreneurship - Zu Den Wechselwirkungen von Innovation Und Wettbewerb, Universität Paderborn, 2018. date_created: 2018-10-24T06:41:13Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Entrepreneurship - Zu den Wechselwirkungen von Innovation und Wettbewerb type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4804' author: - first_name: Emre full_name: Görken, Emre last_name: Görken citation: ama: Görken E. Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern. Universität Paderborn; 2018. apa: Görken, E. (2018). Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern. Universität Paderborn. 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} }' chicago: Görken, Emre. Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern. Universität Paderborn, 2018. ieee: E. Görken, Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern. Universität Paderborn, 2018. mla: Görken, Emre. Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern. Universität Paderborn, 2018. short: E. Görken, Neurowissenschaftliche Und Verhaltensökonomische Determinaten von Nachfrageverhalten Bei Such-, Erfahrungs- Und Vertrauensgütern, Universität Paderborn, 2018. date_created: 2018-10-24T07:05:18Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Neurowissenschaftliche und verhaltensökonomische Determinaten von Nachfrageverhalten bei Such-, Erfahrungs- und Vertrauensgütern type: mastersthesis user_id: '477' year: '2018' ... --- _id: '4805' author: - first_name: Alpaslan full_name: Dalkiran, Alpaslan last_name: Dalkiran citation: ama: Dalkiran A. Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen. Universität Paderborn; 2018. apa: Dalkiran, A. (2018). Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen. Universität Paderborn. bibtex: '@book{Dalkiran_2018, title={Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen}, publisher={Universität Paderborn}, author={Dalkiran, Alpaslan}, year={2018} }' chicago: Dalkiran, Alpaslan. Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen. Universität Paderborn, 2018. ieee: A. Dalkiran, Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen. Universität Paderborn, 2018. mla: Dalkiran, Alpaslan. Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen. Universität Paderborn, 2018. short: A. Dalkiran, Bitcoin - Gemeinsamkeiten Und Unterschiede Im Vergleich Mit Anderen Währungen, Universität Paderborn, 2018. date_created: 2018-10-24T07:09:05Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Bitcoin - Gemeinsamkeiten und Unterschiede im Vergleich mit anderen Währungen type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4806' author: - first_name: Gerrit full_name: Gräper, Gerrit last_name: Gräper citation: ama: Gräper G. The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour. Universität Paderborn; 2018. apa: Gräper, G. (2018). The Suitability of Equilibrium Concepts to evaluate competitive behaviour. Universität Paderborn. 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} }' chicago: Gräper, Gerrit. The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour. Universität Paderborn, 2018. ieee: G. Gräper, The Suitability of Equilibrium Concepts to evaluate competitive behaviour. Universität Paderborn, 2018. mla: Gräper, Gerrit. The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour. Universität Paderborn, 2018. short: G. Gräper, The Suitability of Equilibrium Concepts to Evaluate Competitive Behaviour, Universität Paderborn, 2018. date_created: 2018-10-24T07:13:33Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '7' name: SFB 901 - Subproject A3 - _id: '2' name: SFB 901 - Project Area A - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: The Suitability of Equilibrium Concepts to evaluate competitive behaviour type: mastersthesis user_id: '477' year: '2018' ... --- _id: '4807' author: - first_name: Hüssein full_name: Hammo, Hüssein last_name: Hammo citation: ama: Hammo H. Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft. Universität Paderborn; 2018. apa: Hammo, H. (2018). Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft. Universität Paderborn. 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} }' chicago: Hammo, Hüssein. Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft. Universität Paderborn, 2018. ieee: H. Hammo, Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft. Universität Paderborn, 2018. mla: Hammo, Hüssein. Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft. Universität Paderborn, 2018. short: H. Hammo, Die Sharing Economy Und Ihre Bedeutung Für Die Deutsche Wirtschaft, Universität Paderborn, 2018. date_created: 2018-10-24T07:17:10Z date_updated: 2022-01-06T07:01:24Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Die Sharing Economy und ihre Bedeutung für die deutsche Wirtschaft type: mastersthesis user_id: '477' year: '2018' ... --- _id: '4821' author: - first_name: Jessica full_name: Brachmann, Jessica last_name: Brachmann citation: ama: Brachmann J. Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse. Universität Paderborn; 2018. apa: Brachmann, J. (2018). Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse. Universität Paderborn. bibtex: '@book{Brachmann_2018, title={Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse}, publisher={Universität Paderborn}, author={Brachmann, Jessica}, year={2018} }' chicago: Brachmann, Jessica. Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. ieee: J. Brachmann, Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse. Universität Paderborn, 2018. mla: Brachmann, Jessica. Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. short: J. Brachmann, Chancen Und Risiken Vertikaler Zusammenschlüsse - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018. date_created: 2018-10-24T08:27:02Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Chancen und Risiken vertikaler Zusammenschlüsse - Eine wettbewerbspolitische Analyse type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4822' author: - first_name: Niklas full_name: Förstenberg, Niklas last_name: Förstenberg citation: ama: Förstenberg N. Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse. Universität Paderborn; 2018. apa: Förstenberg, N. (2018). Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse. Universität Paderborn. 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} }' chicago: Förstenberg, Niklas. Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. ieee: N. Förstenberg, Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse. Universität Paderborn, 2018. mla: Förstenberg, Niklas. Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse. Universität Paderborn, 2018. short: N. Förstenberg, Marktmissbrauch Im Fall Germania Fluggesellschaft MbH versus Deutsche Lufthansa AG - Eine Wettbewerbspolitische Analyse, Universität Paderborn, 2018. date_created: 2018-10-24T08:34:27Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 - _id: '1' name: SFB 901 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Marktmissbrauch im Fall Germania Fluggesellschaft mbH versus Deutsche Lufthansa AG - Eine wettbewerbspolitische Analyse type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4827' author: - first_name: Zohaib Ahmad full_name: Khan, Zohaib Ahmad last_name: Khan citation: ama: Khan ZA. How Can Choice Sets Be Architectured to Nudge People into Certain Decisions? Universität Paderborn; 2018. apa: Khan, Z. A. (2018). How can choice sets be architectured to nudge People into certain decisions? 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} }' chicago: Khan, Zohaib Ahmad. How Can Choice Sets Be Architectured to Nudge People into Certain Decisions? Universität Paderborn, 2018. ieee: Z. A. Khan, How can choice sets be architectured to nudge People into certain decisions? Universität Paderborn, 2018. mla: Khan, Zohaib Ahmad. How Can Choice Sets Be Architectured to Nudge People into Certain Decisions? Universität Paderborn, 2018. short: Z.A. Khan, How Can Choice Sets Be Architectured to Nudge People into Certain Decisions?, Universität Paderborn, 2018. date_created: 2018-10-24T10:02:54Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: How can choice sets be architectured to nudge People into certain decisions? type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4828' author: - first_name: Thomas full_name: Kusch, Thomas last_name: Kusch citation: ama: Kusch T. Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse. Universität Paderborn; 2018. apa: Kusch, T. (2018). Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse. 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} }' chicago: Kusch, Thomas. Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse. Universität Paderborn, 2018. ieee: T. Kusch, Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse. Universität Paderborn, 2018. mla: Kusch, Thomas. Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse. Universität Paderborn, 2018. short: T. Kusch, Zum Einfluss von Krankenhauswettbewerb Auf Den Patienten - Eine Ökonomische Analyse, Universität Paderborn, 2018. date_created: 2018-10-24T10:05:50Z date_updated: 2022-01-06T07:01:25Z department: - _id: '280' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: Universität Paderborn status: public supervisor: - first_name: Burkhard full_name: Hehenkamp, Burkhard id: '37339' last_name: Hehenkamp title: Zum Einfluss von Krankenhauswettbewerb auf den Patienten - eine ökonomische Analyse type: bachelorsthesis user_id: '477' year: '2018' ... --- _id: '4982' article_number: '89' author: - first_name: Britta full_name: Hoyer, Britta id: '42447' last_name: Hoyer - first_name: Stephanie full_name: Rosenkranz, Stephanie last_name: Rosenkranz citation: ama: Hoyer B, Rosenkranz S. Determinants of Equilibrium Selection in Network Formation - An Experiment. Games. 2018;9(4). apa: Hoyer, B., & Rosenkranz, S. (2018). Determinants of Equilibrium Selection in Network Formation - An Experiment. Games, 9(4). 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} }' chicago: Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” Games 9, no. 4 (2018). ieee: B. Hoyer and S. Rosenkranz, “ Determinants of Equilibrium Selection in Network Formation - An Experiment,” Games, vol. 9, no. 4, 2018. mla: Hoyer, Britta, and Stephanie Rosenkranz. “ Determinants of Equilibrium Selection in Network Formation - An Experiment.” Games, vol. 9, no. 4, 89, MDPI, 2018. short: B. Hoyer, S. Rosenkranz, Games 9 (2018). date_created: 2018-10-29T10:27:40Z date_updated: 2022-01-06T07:01:33Z ddc: - '000' department: - _id: '280' - _id: '475' file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:15:21Z date_updated: 2018-11-02T15:15:21Z file_id: '5296' file_name: games-09-00089.pdf file_size: 492018 relation: main_file success: 1 file_date_updated: 2018-11-02T15:15:21Z has_accepted_license: '1' intvolume: ' 9' issue: '4' language: - iso: eng main_file_link: - open_access: '1' url: http://www.mdpi.com/2073-4336/9/4/89/ oa: '1' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publication: Games publisher: MDPI status: public title: ' Determinants of Equilibrium Selection in Network Formation - An Experiment' type: journal_article user_id: '42447' volume: 9 year: '2018' ... --- _id: '7570' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Johannes Sebastian full_name: Schaefer, Johannes Sebastian id: '30291' last_name: Schaefer citation: ama: 'Meyer auf der Heide F, Schaefer JS. Brief Announcement: Communication in Systems of Home Based Mobile Agents. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press; 2018. doi:10.1145/3210377.3210662' apa: 'Meyer auf der Heide, F., & Schaefer, J. S. (2018). Brief Announcement: Communication in Systems of Home Based Mobile Agents. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. Vienna: ACM Press. https://doi.org/10.1145/3210377.3210662' bibtex: '@inproceedings{Meyer auf der Heide_Schaefer_2018, title={Brief Announcement: Communication in Systems of Home Based Mobile Agents}, DOI={10.1145/3210377.3210662}, 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} }' chicago: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18. ACM Press, 2018. https://doi.org/10.1145/3210377.3210662.' ieee: 'F. Meyer auf der Heide and J. S. Schaefer, “Brief Announcement: Communication in Systems of Home Based Mobile Agents,” in Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, Vienna, 2018.' mla: 'Meyer auf der Heide, Friedhelm, and Johannes Sebastian Schaefer. “Brief Announcement: Communication in Systems of Home Based Mobile Agents.” Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, doi:10.1145/3210377.3210662.' 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.' conference: end_date: 2018-07-18 location: Vienna name: 30th Symposium on Parallelism in Algorithms and Architectures start_date: 2018-07-16 date_created: 2019-02-06T14:16:19Z date_updated: 2022-01-06T07:03:40Z ddc: - '000' department: - _id: '63' doi: 10.1145/3210377.3210662 file: - access_level: closed content_type: application/pdf 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 file_size: 1504739 relation: main_file file_date_updated: 2019-02-06T14:18:35Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA '18 publication_identifier: isbn: - '9781450357999' publication_status: published publisher: ACM Press status: public title: 'Brief Announcement: Communication in Systems of Home Based Mobile Agents' type: conference user_id: '30291' year: '2018' ... --- _id: '4339' abstract: - lang: eng 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. ' author: - first_name: Frederik Simon full_name: Bäumer, Frederik Simon id: '38837' last_name: Bäumer - first_name: Michaela full_name: Geierhos, Michaela id: '42496' last_name: Geierhos orcid: 0000-0002-8180-5606 citation: ama: 'Bäumer FS, Geierhos M. NLP in OTF Computing: Current Approaches and Open Challenges. In: Damaševičius R, Vasiljevienė G, eds. Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018). Vol 920. Communications in Computer and Information Science. Cham, Switzerland: Springer; 2018:559-570. doi:10.1007/978-3-319-99972-2_46' apa: 'Bäumer, F. S., & Geierhos, M. (2018). NLP in OTF Computing: Current Approaches and Open Challenges. In R. Damaševičius & G. Vasiljevienė (Eds.), Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018) (Vol. 920, pp. 559–570). Cham, Switzerland: Springer. https://doi.org/10.1007/978-3-319-99972-2_46' 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={10.1007/978-3-319-99972-2_46}, 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} }' chicago: 'Bäumer, Frederik Simon, and Michaela Geierhos. “NLP in OTF Computing: Current Approaches and Open Challenges.” In Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018), edited by Robertas Damaševičius and Giedrė Vasiljevienė, 920:559–70. Communications in Computer and Information Science. Cham, Switzerland: Springer, 2018. https://doi.org/10.1007/978-3-319-99972-2_46.' ieee: 'F. S. Bäumer and M. Geierhos, “NLP in OTF Computing: Current Approaches and Open Challenges,” in Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018), Vilnius, Lithuania, 2018, vol. 920, pp. 559–570.' mla: 'Bäumer, Frederik Simon, and Michaela Geierhos. “NLP in OTF Computing: Current Approaches and Open Challenges.” Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018), edited by Robertas Damaševičius and Giedrė Vasiljevienė, vol. 920, Springer, 2018, pp. 559–70, doi:10.1007/978-3-319-99972-2_46.' 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.' conference: end_date: 2018-10-06 location: Vilnius, Lithuania name: 24th International Conference on Information and Software Technologies (ICIST 2018) start_date: 2018-10-04 date_created: 2018-09-01T08:52:36Z date_updated: 2022-01-06T07:00:57Z ddc: - '004' department: - _id: '36' - _id: '1' - _id: '579' doi: 10.1007/978-3-319-99972-2_46 editor: - first_name: Robertas full_name: Damaševičius, Robertas last_name: Damaševičius - first_name: Giedrė full_name: Vasiljevienė, Giedrė last_name: Vasiljevienė file: - access_level: closed content_type: application/pdf creator: fbaeumer date_created: 2019-01-11T11:36:10Z date_updated: 2019-01-11T11:36:10Z file_id: '6624' file_name: baeumer-4315.pdf file_size: 1053017 relation: main_file success: 1 file_date_updated: 2019-01-11T11:36:10Z has_accepted_license: '1' intvolume: ' 920' keyword: - Inaccuracy detection - Natural language software requirements language: - iso: eng page: 559-570 place: Cham, Switzerland project: - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B - _id: '9' name: SFB 901 - Subproject B1 publication: Proceedings of the 24th International Conference on Information and Software Technologies (ICIST 2018) publication_identifier: isbn: - '9783319999715' - '9783319999722' issn: - 1865-0929 - 1865-0937 publication_status: published publisher: Springer quality_controlled: '1' series_title: Communications in Computer and Information Science status: public title: 'NLP in OTF Computing: Current Approaches and Open Challenges' type: conference user_id: '38837' volume: 920 year: '2018' ... --- _id: '4351' 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" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann - first_name: Christina full_name: Kolb, Christina id: '43647' last_name: Kolb - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Feldmann M, Kolb C, Scheideler C. Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS). Vol 11201. Lecture Notes in Computer Science. Springer, Cham; 2018:16-31. doi:10.1007/978-3-030-03232-6_2' apa: Feldmann, M., Kolb, C., & Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_2 bibtex: '@inproceedings{Feldmann_Kolb_Scheideler_2018, series={Lecture Notes in Computer Science}, title={Self-stabilizing Overlays for high-dimensional Monotonic Searchability}, volume={11201}, DOI={10.1007/978-3-030-03232-6_2}, 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} }' chicago: Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018. https://doi.org/10.1007/978-3-030-03232-6_2. ieee: M. Feldmann, C. Kolb, and C. Scheideler, “Self-stabilizing Overlays for high-dimensional Monotonic Searchability,” in Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2018, vol. 11201, pp. 16–31. mla: Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2. 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.' date_created: 2018-09-04T14:15:39Z date_updated: 2022-01-06T07:00:58Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-030-03232-6_2 external_id: arxiv: - '1808.10300' file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2018-10-31T13:24:17Z date_updated: 2018-10-31T13:24:17Z file_id: '5210' file_name: Feldmann2018_Chapter_Self-stabilizingOverlaysForHig.pdf file_size: 329823 relation: main_file success: 1 file_date_updated: 2018-10-31T13:24:17Z has_accepted_license: '1' intvolume: ' 11201' language: - iso: eng page: '16-31 ' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) publication_identifier: unknown: - 978-3-030-03231-9 publisher: Springer, Cham series_title: Lecture Notes in Computer Science status: public title: Self-stabilizing Overlays for high-dimensional Monotonic Searchability type: conference user_id: '23538' volume: 11201 year: '2018' ... --- _id: '4373' author: - first_name: Daniel full_name: Szopinski, Daniel id: '36372' last_name: Szopinski citation: ama: 'Szopinski D. Towards software-based tools for business model development: Using external stimuli for business model idea generation. 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 Bosch Business Model Innovation Summit 2018. Renningen, Germany.' 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} }' chicago: 'Szopinski, Daniel. “Towards Software-Based Tools for Business Model Development: Using External Stimuli for Business Model Idea Generation.” In Bosch Business Model Innovation Summit 2018, 2018.' ieee: 'D. Szopinski, “Towards software-based tools for business model development: Using external stimuli for business model idea generation,” in Bosch Business Model Innovation Summit 2018, Renningen, Germany, 2018.' mla: 'Szopinski, Daniel. “Towards Software-Based Tools for Business Model Development: Using External Stimuli for Business Model Idea Generation.” Bosch Business Model Innovation Summit 2018, 2018.' short: 'D. Szopinski, in: Bosch Business Model Innovation Summit 2018, 2018.' conference: location: Renningen, Germany name: Bosch Business Model Innovation Summit 2018 date_created: 2018-09-10T12:26:14Z date_updated: 2022-01-06T07:00:59Z ddc: - '040' department: - _id: '276' file: - access_level: closed content_type: application/pdf creator: dsz date_created: 2018-11-29T15:03:20Z date_updated: 2018-11-29T15:03:20Z file_id: '5982' file_name: Bosch BMI Summit 2018.pdf file_size: 1180782 relation: main_file success: 1 file_date_updated: 2018-11-29T15:03:20Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 publication: Bosch Business Model Innovation Summit 2018 quality_controlled: '1' status: public title: 'Towards software-based tools for business model development: Using external stimuli for business model idea generation' type: conference_abstract user_id: '477' year: '2018' ... --- _id: '4375' 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." author: - first_name: Markus full_name: Benter, Markus last_name: Benter - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer - first_name: Jannik full_name: Sundermeier, Jannik id: '38705' last_name: Sundermeier 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: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). ; 2018. doi:10.1007/978-3-030-19759-9_4' apa: Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., & Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki. https://doi.org/10.1007/978-3-030-19759-9_4 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={10.1007/978-3-030-19759-9_4}, 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} }' 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 Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018. https://doi.org/10.1007/978-3-030-19759-9_4. 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 Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), Helsinki, 2018. mla: Benter, Markus, et al. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.” Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018, doi:10.1007/978-3-030-19759-9_4. 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.' conference: end_date: 2018-08-21 location: Helsinki name: 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) start_date: 2018-08-20 date_created: 2018-09-11T05:26:59Z date_updated: 2022-01-06T07:01:00Z ddc: - '000' department: - _id: '63' - _id: '79' doi: 10.1007/978-3-030-19759-9_4 file: - access_level: closed content_type: application/pdf creator: tillk date_created: 2018-11-27T10:03:33Z date_updated: 2018-11-27T10:03:33Z file_id: '5863' file_name: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension.pdf file_size: 1122875 relation: main_file success: 1 file_date_updated: 2018-11-27T10:03:33Z has_accepted_license: '1' keyword: - Distributed Storage - Multi-Dimensional Range Queries - Peer-to-Peer - Hilbert Curve language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) status: public title: A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension type: conference user_id: '14955' year: '2018' ...