--- _id: '25174' author: - first_name: Michelle full_name: Müller, Michelle id: '50286' last_name: Müller - first_name: Janina full_name: Seutter, Janina id: '64464' last_name: Seutter - first_name: Stefanie Jutta Marianne full_name: Müller, Stefanie Jutta Marianne id: '70858' last_name: Müller - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: 'Müller M, Seutter J, Müller SJM, Kundisch D. Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns. In: Proceedings of the 42nd International Conference on Information Systems (ICIS).' apa: Müller, M., Seutter, J., Müller, S. J. M., & Kundisch, D. (n.d.). Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns. Proceedings of the 42nd International Conference on Information Systems (ICIS). Proceedings of the 42nd International Conference on Information Systems (ICIS). bibtex: '@inproceedings{Müller_Seutter_Müller_Kundisch, title={Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns}, booktitle={Proceedings of the 42nd International Conference on Information Systems (ICIS)}, author={Müller, Michelle and Seutter, Janina and Müller, Stefanie Jutta Marianne and Kundisch, Dennis} }' chicago: Müller, Michelle, Janina Seutter, Stefanie Jutta Marianne Müller, and Dennis Kundisch. “Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns.” In Proceedings of the 42nd International Conference on Information Systems (ICIS), n.d. ieee: M. Müller, J. Seutter, S. J. M. Müller, and D. Kundisch, “Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns,” presented at the Proceedings of the 42nd International Conference on Information Systems (ICIS). mla: Müller, Michelle, et al. “Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns.” Proceedings of the 42nd International Conference on Information Systems (ICIS). short: 'M. Müller, J. Seutter, S.J.M. Müller, D. Kundisch, in: Proceedings of the 42nd International Conference on Information Systems (ICIS), n.d.' conference: name: Proceedings of the 42nd International Conference on Information Systems (ICIS) date_created: 2021-09-30T12:45:10Z date_updated: 2022-01-06T06:56:54Z department: - _id: '276' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 - _id: '4' name: SFB 901 - Project Area C - _id: '17' name: SFB 901 - Subproject C5 - _id: '1' name: SFB 901 publication: Proceedings of the 42nd International Conference on Information Systems (ICIS) publication_status: accepted status: public title: Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns type: conference user_id: '477' year: '2021' ... --- _id: '25178' author: - first_name: Martin full_name: Poniatowski, Martin id: '32441' last_name: Poniatowski - first_name: Janina full_name: Seutter, Janina id: '64464' last_name: Seutter - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: 'Poniatowski M, Seutter J, Kundisch D. “Timing is Everything” — An Empirical Analysis of the Timing of Online Review Elicitation. In: Proceedings of the 42nd International Conference on Information Systems (ICIS).' apa: Poniatowski, M., Seutter, J., & Kundisch, D. (n.d.). “Timing is Everything” — An Empirical Analysis of the Timing of Online Review Elicitation. Proceedings of the 42nd International Conference on Information Systems (ICIS). Proceedings of the 42nd International Conference on Information Systems (ICIS). bibtex: '@inproceedings{Poniatowski_Seutter_Kundisch, title={“Timing is Everything” — An Empirical Analysis of the Timing of Online Review Elicitation}, booktitle={Proceedings of the 42nd International Conference on Information Systems (ICIS)}, author={Poniatowski, Martin and Seutter, Janina and Kundisch, Dennis} }' chicago: Poniatowski, Martin, Janina Seutter, and Dennis Kundisch. “‘Timing Is Everything’ — An Empirical Analysis of the Timing of Online Review Elicitation.” In Proceedings of the 42nd International Conference on Information Systems (ICIS), n.d. ieee: M. Poniatowski, J. Seutter, and D. Kundisch, “‘Timing is Everything’ — An Empirical Analysis of the Timing of Online Review Elicitation,” presented at the Proceedings of the 42nd International Conference on Information Systems (ICIS). mla: Poniatowski, Martin, et al. “‘Timing Is Everything’ — An Empirical Analysis of the Timing of Online Review Elicitation.” Proceedings of the 42nd International Conference on Information Systems (ICIS). short: 'M. Poniatowski, J. Seutter, D. Kundisch, in: Proceedings of the 42nd International Conference on Information Systems (ICIS), n.d.' conference: name: Proceedings of the 42nd International Conference on Information Systems (ICIS) date_created: 2021-09-30T12:48:07Z date_updated: 2022-01-06T06:56:54Z department: - _id: '276' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 publication: Proceedings of the 42nd International Conference on Information Systems (ICIS) publication_status: accepted status: public title: '"Timing is Everything" — An Empirical Analysis of the Timing of Online Review Elicitation' type: conference user_id: '477' year: '2021' ... --- _id: '27053' author: - first_name: Leon full_name: Everling, Leon last_name: Everling citation: ama: Everling L. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme.; 2021. apa: Everling, L. (2021). Selbststabilisierender Bakery Algorithmus für verteilte Systeme. bibtex: '@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für verteilte Systeme}, author={Everling, Leon}, year={2021} }' chicago: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021. ieee: L. Everling, Selbststabilisierender Bakery Algorithmus für verteilte Systeme. 2021. mla: Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme. 2021. short: L. Everling, Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021. date_created: 2021-11-02T10:13:51Z date_updated: 2022-01-06T06:57:33Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Selbststabilisierender Bakery Algorithmus für verteilte Systeme type: bachelorsthesis user_id: '15504' year: '2021' ... --- _id: '27072' author: - first_name: Vaibhav full_name: Adsul, Vaibhav last_name: Adsul citation: ama: Adsul V. Peer-to-Peer Matching for Distributed Systems.; 2021. apa: Adsul, V. (2021). Peer-to-Peer Matching for Distributed Systems. bibtex: '@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems}, author={Adsul, Vaibhav}, year={2021} }' chicago: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021. ieee: V. Adsul, Peer-to-Peer Matching for Distributed Systems. 2021. mla: Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems. 2021. short: V. Adsul, Peer-to-Peer Matching for Distributed Systems, 2021. date_created: 2021-11-03T06:12:47Z date_updated: 2022-01-06T06:57:33Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Peer-to-Peer Matching for Distributed Systems type: mastersthesis user_id: '15504' year: '2021' ... --- _id: '21084' author: - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: Werthmann J. Derandomization and Local Graph Problems in the Node-Capacitated Clique.; 2021. apa: Werthmann, J. (2021). Derandomization and Local Graph Problems in the Node-Capacitated Clique. bibtex: '@book{Werthmann_2021, title={Derandomization and Local Graph Problems in the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }' chicago: Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021. ieee: J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021. mla: Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique. 2021. short: J. Werthmann, Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021. date_created: 2021-01-26T13:58:14Z date_updated: 2022-01-06T06:54:44Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Derandomization and Local Graph Problems in the Node-Capacitated Clique type: mastersthesis user_id: '15504' year: '2021' ... --- _id: '21197' author: - first_name: Ma full_name: Mengshi, Ma last_name: Mengshi citation: ama: Mengshi M. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.; 2021. apa: Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. bibtex: '@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }' chicago: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021. ieee: M. Mengshi, Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021. mla: Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter. 2021. short: M. Mengshi, Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021. date_created: 2021-02-09T07:09:22Z date_updated: 2022-01-06T06:54:49Z department: - _id: '79' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C - _id: '5' name: SFB 901 - Subproject A1 - _id: '13' name: SFB 901 - Subproject C1 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter type: bachelorsthesis user_id: '15504' year: '2021' ... --- _id: '21525' author: - first_name: Dominik full_name: Gutt, Dominik last_name: Gutt - first_name: Jürgen full_name: Neumann, Jürgen id: '32456' last_name: Neumann - first_name: Wael full_name: Jabr, Wael last_name: Jabr - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch citation: ama: 'Gutt D, Neumann J, Jabr W, Kundisch D. The Fate of the App: Economic Implications of Updating under Reputation Resetting. In: ; 2021.' apa: 'Gutt, D., Neumann, J., Jabr, W., & Kundisch, D. (2021). The Fate of the App: Economic Implications of Updating under Reputation Resetting. Presented at the Sixth Workshop on Information System Design and Economic Behavior (ISDEB 2021), Virtual Conference/Workshop.' bibtex: '@inproceedings{Gutt_Neumann_Jabr_Kundisch_2021, title={The Fate of the App: Economic Implications of Updating under Reputation Resetting}, author={Gutt, Dominik and Neumann, Jürgen and Jabr, Wael and Kundisch, Dennis}, year={2021} }' chicago: 'Gutt, Dominik, Jürgen Neumann, Wael Jabr, and Dennis Kundisch. “The Fate of the App: Economic Implications of Updating under Reputation Resetting,” 2021.' ieee: 'D. Gutt, J. Neumann, W. Jabr, and D. Kundisch, “The Fate of the App: Economic Implications of Updating under Reputation Resetting,” presented at the Sixth Workshop on Information System Design and Economic Behavior (ISDEB 2021), Virtual Conference/Workshop, 2021.' mla: 'Gutt, Dominik, et al. The Fate of the App: Economic Implications of Updating under Reputation Resetting. 2021.' short: 'D. Gutt, J. Neumann, W. Jabr, D. Kundisch, in: 2021.' conference: location: Virtual Conference/Workshop name: Sixth Workshop on Information System Design and Economic Behavior (ISDEB 2021) date_created: 2021-03-17T13:11:24Z date_updated: 2022-01-06T06:55:03Z department: - _id: '276' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public title: 'The Fate of the App: Economic Implications of Updating under Reputation Resetting' type: conference user_id: '477' year: '2021' ... --- _id: '21628' abstract: - lang: eng text: "This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks.\r\n\r\nIn the first part of this thesis, we provide distributed protocols for queues, stacks and priority queues that serve the insertion and deletion of elements within a logarithmic amount of rounds.\r\nOur protocols respect semantic constraints such as sequential consistency or serializability and the individual semantic constraints given by the type (queue, stack, priority queue) of the data structure.\r\nWe furthermore provide a protocol that handles joining and leaving nodes.\r\nAs an important side product, we present a novel protocol solving the distributed $k$-selection problem in a logarithmic amount of rounds, that is, to find the $k$-smallest elements among a polynomial number of elements spread among $n$ nodes.\r\n\t\r\nThe second part of this thesis is devoted to the construction of protocols for self-stabilizing overlay networks, i.e., distributed protocols that transform an overlay network from any initial (potentially illegitimate) state into a legitimate state in finite time.\r\nWe present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings.\r\nEach of those protocols comes with unique properties that makes it interesting for certain distributed applications.\r\nGeneralized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests.\r\nThe protocol for the quadtree guarantees monotonic searchability as well as a geometric variant of monotonic searchability, making it interesting for wireless networks or applications needed in the area of computational geometry.\r\nThe supervised skip ring can be used to construct a self-stabilizing publish-subscribe system.\r\n" author: - first_name: Michael full_name: Feldmann, Michael id: '23538' last_name: Feldmann citation: ama: Feldmann M. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks.; 2021. doi:10.17619/UNIPB/1-1113 apa: Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. https://doi.org/10.17619/UNIPB/1-1113 bibtex: '@book{Feldmann_2021, title={Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}, DOI={10.17619/UNIPB/1-1113}, author={Feldmann, Michael}, year={2021} }' chicago: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. https://doi.org/10.17619/UNIPB/1-1113. ieee: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021. mla: Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks. 2021, doi:10.17619/UNIPB/1-1113. short: M. Feldmann, Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021. date_created: 2021-04-15T08:23:52Z date_updated: 2022-01-06T06:55:08Z ddc: - '006' department: - _id: '79' doi: 10.17619/UNIPB/1-1113 file: - access_level: closed content_type: application/pdf creator: mfeldma2 date_created: 2021-04-15T08:21:15Z date_updated: 2021-04-15T08:21:15Z file_id: '21629' file_name: Dissertation_Michael_Feldmann.pdf file_size: 2617069 relation: main_file success: 1 file_date_updated: 2021-04-15T08:21:15Z 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 status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks type: dissertation user_id: '23538' year: '2021' ... --- _id: '20683' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Till full_name: Knollmann, Till id: '39241' last_name: Knollmann orcid: 0000-0003-2014-4696 - first_name: Manuel full_name: Malatyali, Manuel id: '41265' last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. Managing Multiple Mobile Resources. Theory of Computing Systems. 2021;65:943–984. doi:10.1007/s00224-020-10023-8 apa: Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der Heide, F. (2021). Managing Multiple Mobile Resources. Theory of Computing Systems, 65, 943–984. https://doi.org/10.1007/s00224-020-10023-8 bibtex: '@article{Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2021, title={Managing Multiple Mobile Resources}, volume={65}, DOI={10.1007/s00224-020-10023-8}, journal={Theory of Computing Systems}, author={Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2021}, pages={943–984} }' chicago: 'Feldkord, Björn, Till Knollmann, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Managing Multiple Mobile Resources.” Theory of Computing Systems 65 (2021): 943–984. https://doi.org/10.1007/s00224-020-10023-8.' ieee: 'B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der Heide, “Managing Multiple Mobile Resources,” Theory of Computing Systems, vol. 65, pp. 943–984, 2021, doi: 10.1007/s00224-020-10023-8.' mla: Feldkord, Björn, et al. “Managing Multiple Mobile Resources.” Theory of Computing Systems, vol. 65, 2021, pp. 943–984, doi:10.1007/s00224-020-10023-8. short: B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide, Theory of Computing Systems 65 (2021) 943–984. date_created: 2020-12-08T08:40:10Z date_updated: 2022-01-06T06:54:31Z department: - _id: '63' doi: 10.1007/s00224-020-10023-8 intvolume: ' 65' language: - iso: eng page: 943–984 project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 publication: Theory of Computing Systems publication_status: published status: public title: Managing Multiple Mobile Resources type: journal_article user_id: '15415' volume: 65 year: '2021' ... --- _id: '20817' author: - first_name: Marcin full_name: Bienkowski, Marcin last_name: Bienkowski - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord - first_name: Pawel full_name: Schmidt, Pawel last_name: Schmidt citation: ama: 'Bienkowski M, Feldkord B, Schmidt P. A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS). ; 2021:14:1-14:17. doi:10.4230/LIPIcs.STACS.2021.14' apa: Bienkowski, M., Feldkord, B., & Schmidt, P. (2021). A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 14:1-14:17). https://doi.org/10.4230/LIPIcs.STACS.2021.14 bibtex: '@inproceedings{Bienkowski_Feldkord_Schmidt_2021, title={A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}, DOI={10.4230/LIPIcs.STACS.2021.14}, booktitle={Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}, author={Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}, year={2021}, pages={14:1-14:17} }' chicago: Bienkowski, Marcin, Björn Feldkord, and Pawel Schmidt. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 14:1-14:17, 2021. https://doi.org/10.4230/LIPIcs.STACS.2021.14. ieee: M. Bienkowski, B. Feldkord, and P. Schmidt, “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location,” in Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17. mla: Bienkowski, Marcin, et al. “A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location.” Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17, doi:10.4230/LIPIcs.STACS.2021.14. short: 'M. Bienkowski, B. Feldkord, P. Schmidt, in: Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS), 2021, pp. 14:1-14:17.' date_created: 2020-12-21T13:46:16Z date_updated: 2022-01-06T06:54:40Z department: - _id: '63' doi: 10.4230/LIPIcs.STACS.2021.14 language: - iso: eng page: 14:1 - 14:17 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 38th Symposium on Theoretical Aspects of Computer Science (STACS) publication_status: published status: public title: A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location type: conference user_id: '22704' year: '2021' ... --- _id: '22283' abstract: - lang: eng text: " We show how to construct an overlay network of constant degree and diameter $O(\\log n)$ in time $O(\\log n)$ starting from an arbitrary weakly connected graph.\r\n We assume a synchronous communication network in which nodes can send messages to nodes they know the identifier of and establish new connections by sending node identifiers.\r\n If the initial network's graph is weakly connected and has constant degree, then our algorithm constructs the desired topology with each node sending and receiving only $O(\\log n)$ messages in each round in time $O(\\log n)$, w.h.p., which beats the currently best $O(\\log^{3/2} n)$ time algorithm of [Götte et al., SIROCCO'19].\r\n Since the problem cannot be solved faster than by using pointer jumping for $O(\\log n)$ rounds (which would even require each node to communicate $\\Omega(n)$ bits), our algorithm is asymptotically optimal.\r\n \ We achieve this speedup by using short random walks to repeatedly establish random connections between the nodes that quickly reduce the conductance of the graph using an observation of [Kwok and Lau, APPROX'14].\r\n \r\n Additionally, we show how our algorithm can be used to efficiently solve graph problems in \\emph{hybrid networks} [Augustine et al., SODA'20].\r\n Motivated by the idea that nodes possess two different modes of communication, we assume that communication of the \\emph{initial} edges is unrestricted. In contrast, only polylogarithmically many messages can be communicated over edges that have been established throughout an algorithm's execution.\r\n For an (undirected) graph $G$ with arbitrary degree, we show how to compute connected components, a spanning tree, and biconnected components in time $O(\\log n)$, w.h.p.\r\n Furthermore, we show how to compute an MIS in time $O(\\log d + \\log \\log n)$, w.h.p., where $d$ is the initial degree of $G$." author: - first_name: Thorsten full_name: Götte, Thorsten id: '34727' last_name: Götte - first_name: Kristian full_name: Hinnenthal, Kristian id: '32229' last_name: Hinnenthal - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Julian full_name: Werthmann, Julian id: '50024' last_name: Werthmann citation: ama: 'Götte T, Hinnenthal K, Scheideler C, Werthmann J. Time-Optimal Construction of Overlays. In: Censor-Hillel K, ed. Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. doi:10.1145/3465084.3467932' apa: 'Götte, T., Hinnenthal, K., Scheideler, C., & Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM. https://doi.org/10.1145/3465084.3467932' bibtex: '@inproceedings{Götte_Hinnenthal_Scheideler_Werthmann, place={New York}, title={Time-Optimal Construction of Overlays}, DOI={10.1145/3465084.3467932}, booktitle={Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21)}, publisher={ACM}, author={Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}, editor={Censor-Hillel, KerenEditor} }' chicago: 'Götte, Thorsten, Kristian Hinnenthal, Christian Scheideler, and Julian Werthmann. “Time-Optimal Construction of Overlays.” In Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel. New York: ACM, n.d. https://doi.org/10.1145/3465084.3467932.' ieee: T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), Virtual. mla: Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.” Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932. short: 'T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.' conference: end_date: 2021-07-30 location: Virtual name: ACM Symposium on Principles of Distributed Computing (PODC) start_date: 2021-07-26 date_created: 2021-06-06T19:10:26Z date_updated: 2022-01-06T06:55:30Z ddc: - '000' department: - _id: '34' doi: 10.1145/3465084.3467932 editor: - first_name: Keren full_name: Censor-Hillel, Keren last_name: Censor-Hillel file: - access_level: closed content_type: application/pdf creator: thgoette date_created: 2021-06-06T19:12:49Z date_updated: 2021-06-06T19:12:49Z file_id: '22284' file_name: Wicked_Fast_Overlay_Construction(1).pdf file_size: 590875 relation: main_file success: 1 file_date_updated: 2021-06-06T19:12:49Z has_accepted_license: '1' language: - iso: eng place: New York project: - _id: '2' name: SFB 901 - Project Area A - _id: '5' name: SFB 901 - Subproject A1 - _id: '4' name: SFB 901 - Project Area C - _id: '13' name: SFB 901 - Subproject C1 - _id: '1' name: SFB 901 publication: Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21) publication_status: accepted publisher: ACM status: public title: Time-Optimal Construction of Overlays type: conference user_id: '477' year: '2021' ... --- _id: '21799' author: - first_name: K. full_name: Kutzner, K. last_name: Kutzner - first_name: M. full_name: Stadtländer, M. last_name: Stadtländer - first_name: Janina full_name: Seutter, Janina id: '64464' last_name: Seutter - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch - first_name: R. full_name: Knackstedt, R. last_name: Knackstedt citation: ama: 'Kutzner K, Stadtländer M, Seutter J, Kundisch D, Knackstedt R. ”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing. In: Proceedings of the 29th European Conference on Information Systems (ECIS). ; 2021.' apa: Kutzner, K., Stadtländer, M., Seutter, J., Kundisch, D., & Knackstedt, R. (2021). ”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing. In Proceedings of the 29th European Conference on Information Systems (ECIS). Virtual Conference/Workshop. bibtex: '@inproceedings{Kutzner_Stadtländer_Seutter_Kundisch_Knackstedt_2021, title={”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing}, booktitle={Proceedings of the 29th European Conference on Information Systems (ECIS)}, author={Kutzner, K. and Stadtländer, M. and Seutter, Janina and Kundisch, Dennis and Knackstedt, R.}, year={2021} }' chicago: Kutzner, K., M. Stadtländer, Janina Seutter, Dennis Kundisch, and R. Knackstedt. “”Sorry, Too Much Information” Designing Online Review Systems That Support Information Search and Processing.” In Proceedings of the 29th European Conference on Information Systems (ECIS), 2021. ieee: K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, and R. Knackstedt, “”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing,” in Proceedings of the 29th European Conference on Information Systems (ECIS), Virtual Conference/Workshop, 2021. mla: Kutzner, K., et al. “”Sorry, Too Much Information” Designing Online Review Systems That Support Information Search and Processing.” Proceedings of the 29th European Conference on Information Systems (ECIS), 2021. short: 'K. Kutzner, M. Stadtländer, J. Seutter, D. Kundisch, R. Knackstedt, in: Proceedings of the 29th European Conference on Information Systems (ECIS), 2021.' conference: location: Virtual Conference/Workshop name: 29th European Conference on Information Systems (ECIS) date_created: 2021-04-26T10:46:22Z date_updated: 2022-01-06T06:55:13Z department: - _id: '276' language: - iso: eng project: - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 - _id: '1' name: SFB 901 publication: Proceedings of the 29th European Conference on Information Systems (ECIS) status: public title: ”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing type: conference user_id: '477' year: '2021' ... --- _id: '24671' author: - first_name: Emina full_name: Ahmeckovic, Emina last_name: Ahmeckovic citation: ama: Ahmeckovic E. Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen.; 2021. apa: Ahmeckovic, E. (2021). Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen. bibtex: '@book{Ahmeckovic_2021, place={Universität Paderborn}, title={Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen}, author={Ahmeckovic, Emina}, year={2021} }' chicago: Ahmeckovic, Emina. Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen. Universität Paderborn, 2021. ieee: E. Ahmeckovic, Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen. Universität Paderborn, 2021. mla: Ahmeckovic, Emina. Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen. 2021. short: E. Ahmeckovic, Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen, Universität Paderborn, 2021. date_created: 2021-09-17T13:12:20Z date_updated: 2022-07-14T13:05:11Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen type: bachelorsthesis user_id: '16205' year: '2021' ... --- _id: '24576' author: - first_name: Daniel full_name: Funk, Daniel last_name: Funk citation: ama: Funk D. Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems.; 2021. apa: Funk, D. (2021). Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems. bibtex: '@book{Funk_2021, place={Universität Paderborn}, title={Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems}, author={Funk, Daniel}, year={2021} }' chicago: Funk, Daniel. Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems. Universität Paderborn, 2021. ieee: D. Funk, Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems. Universität Paderborn, 2021. mla: Funk, Daniel. Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems. 2021. short: D. Funk, Wer schreibt der bleibt – Eine quantitative Untersuchung der  Kundenbeziehung in Brand Communities und Smart Service Systems, Universität Paderborn, 2021. date_created: 2021-09-17T06:53:50Z date_updated: 2022-07-14T13:05:42Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Wer schreibt der bleibt – Eine quantitative Untersuchung der Kundenbeziehung in Brand Communities und Smart Service Systems type: bachelorsthesis user_id: '16205' year: '2021' ... --- _id: '25181' author: - first_name: Till full_name: Rümpker, Till last_name: Rümpker citation: ama: Rümpker T. Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen.; 2021. apa: Rümpker, T. (2021). Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen. bibtex: '@book{Rümpker_2021, place={Universität Paderborn}, title={Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen}, author={Rümpker, Till}, year={2021} }' chicago: Rümpker, Till. Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen. Universität Paderborn, 2021. ieee: T. Rümpker, Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen. Universität Paderborn, 2021. mla: Rümpker, Till. Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen. 2021. short: T. Rümpker, Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen, Universität Paderborn, 2021. date_created: 2021-09-30T13:11:52Z date_updated: 2022-07-14T13:04:56Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen type: bachelorsthesis user_id: '16205' year: '2021' ... --- _id: '24685' author: - first_name: Jan-Philipp full_name: Roslan, Jan-Philipp last_name: Roslan citation: ama: Roslan J-P. Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen.; 2021. apa: Roslan, J.-P. (2021). Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen. bibtex: '@book{Roslan_2021, place={Universität Paderborn}, title={Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen}, author={Roslan, Jan-Philipp}, year={2021} }' chicago: Roslan, Jan-Philipp. Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen. Universität Paderborn, 2021. ieee: J.-P. Roslan, Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen. Universität Paderborn, 2021. mla: Roslan, Jan-Philipp. Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen. 2021. short: J.-P. Roslan, Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen, Universität Paderborn, 2021. date_created: 2021-09-20T07:59:04Z date_updated: 2022-07-14T13:05:25Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen type: bachelorsthesis user_id: '16205' year: '2021' ... --- _id: '24577' author: - first_name: Laura full_name: Speer, Laura last_name: Speer citation: ama: Speer L. Digitale Diskriminierung – Ein systematischer Literaturüberblick.; 2021. apa: Speer, L. (2021). Digitale Diskriminierung – Ein systematischer Literaturüberblick. bibtex: '@book{Speer_2021, place={Universität Paderborn}, title={Digitale Diskriminierung – Ein systematischer Literaturüberblick}, author={Speer, Laura}, year={2021} }' chicago: Speer, Laura. Digitale Diskriminierung – Ein systematischer Literaturüberblick. Universität Paderborn, 2021. ieee: L. Speer, Digitale Diskriminierung – Ein systematischer Literaturüberblick. Universität Paderborn, 2021. mla: Speer, Laura. Digitale Diskriminierung – Ein systematischer Literaturüberblick. 2021. short: L. Speer, Digitale Diskriminierung – Ein systematischer Literaturüberblick, Universität Paderborn, 2021. date_created: 2021-09-17T07:06:39Z date_updated: 2022-07-14T13:05:51Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Digitale Diskriminierung – Ein systematischer Literaturüberblick type: bachelorsthesis user_id: '16205' year: '2021' ... --- _id: '21713' author: - first_name: Leonie full_name: Lender, Leonie last_name: Lender citation: ama: Lender L. Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit.; 2021. apa: Lender, L. (2021). Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit. bibtex: '@book{Lender_2021, place={Universität Paderborn}, title={Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit}, author={Lender, Leonie}, year={2021} }' chicago: Lender, Leonie. Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit. Universität Paderborn, 2021. ieee: L. Lender, Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit. Universität Paderborn, 2021. mla: Lender, Leonie. Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit. 2021. short: L. Lender, Personality Matters – Ein systematischer Literaturüberblick zur  Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit, Universität Paderborn, 2021. date_created: 2021-04-22T08:04:45Z date_updated: 2022-07-14T13:07:22Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Personality Matters – Ein systematischer Literaturüberblick zur Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit type: bachelorsthesis user_id: '16205' year: '2021' ... --- _id: '21434' author: - first_name: Gergely full_name: Steierlein, Gergely last_name: Steierlein citation: ama: Steierlein G. Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick.; 2021. apa: Steierlein, G. (2021). Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick. bibtex: '@book{Steierlein_2021, place={Universität Paderborn}, title={Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick}, author={Steierlein, Gergely}, year={2021} }' chicago: Steierlein, Gergely. Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick. Universität Paderborn, 2021. ieee: G. Steierlein, Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick. Universität Paderborn, 2021. mla: Steierlein, Gergely. Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick. 2021. short: G. Steierlein, Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick, Universität Paderborn, 2021. date_created: 2021-03-10T09:09:41Z date_updated: 2022-07-14T13:07:38Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick type: bachelorsthesis user_id: '16205' year: '2021' ... --- _id: '21365' author: - first_name: Thanh Quynh full_name: Mai, Thanh Quynh last_name: Mai citation: ama: Mai TQ. Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick.; 2021. apa: Mai, T. Q. (2021). Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick. bibtex: '@book{Mai_2021, place={Universität Paderborn}, title={Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick}, author={Mai, Thanh Quynh}, year={2021} }' chicago: Mai, Thanh Quynh. Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick. Universität Paderborn, 2021. ieee: T. Q. Mai, Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick. Universität Paderborn, 2021. mla: Mai, Thanh Quynh. Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick. 2021. short: T.Q. Mai, Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick, Universität Paderborn, 2021. date_created: 2021-03-03T13:45:01Z date_updated: 2022-07-14T13:07:51Z language: - iso: ger place: Universität Paderborn project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '8' name: SFB 901 - Subproject A4 status: public supervisor: - first_name: Dennis full_name: Kundisch, Dennis id: '21117' last_name: Kundisch title: Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick type: bachelorsthesis user_id: '16205' year: '2021' ...