@inproceedings{25174, author = {{Müller, Michelle and Seutter, Janina and Müller, Stefanie Jutta Marianne and Kundisch, Dennis}}, booktitle = {{Proceedings of the 42nd International Conference on Information Systems (ICIS)}}, title = {{{Moment or Movement – An Empirical Analysis of the Heterogeneous Impact of Media Attention on Charitable Crowdfunding Campaigns}}}, year = {{2021}}, } @inproceedings{25178, author = {{Poniatowski, Martin and Seutter, Janina and Kundisch, Dennis}}, booktitle = {{Proceedings of the 42nd International Conference on Information Systems (ICIS)}}, title = {{{"Timing is Everything" — An Empirical Analysis of the Timing of Online Review Elicitation}}}, year = {{2021}}, } @misc{27053, author = {{Everling, Leon}}, title = {{{Selbststabilisierender Bakery Algorithmus für verteilte Systeme}}}, year = {{2021}}, } @misc{27072, author = {{Adsul, Vaibhav}}, title = {{{Peer-to-Peer Matching for Distributed Systems}}}, year = {{2021}}, } @misc{21084, author = {{Werthmann, Julian}}, title = {{{Derandomization and Local Graph Problems in the Node-Capacitated Clique}}}, year = {{2021}}, } @misc{21197, author = {{Mengshi, Ma}}, title = {{{Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter}}}, year = {{2021}}, } @inproceedings{21525, author = {{Gutt, Dominik and Neumann, Jürgen and Jabr, Wael and Kundisch, Dennis}}, location = {{Virtual Conference/Workshop}}, title = {{{The Fate of the App: Economic Implications of Updating under Reputation Resetting}}}, year = {{2021}}, } @phdthesis{21628, abstract = {{This thesis considers the realization of distributed data structures and the construction of distributed protocols for self-stabilizing overlay networks. In 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. Our 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. We furthermore provide a protocol that handles joining and leaving nodes. As 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. The 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. We present protocols for self-stabilizing generalized De Bruijn graphs, self-stabilizing quadtrees and self-stabilizing supervised skip rings. Each of those protocols comes with unique properties that makes it interesting for certain distributed applications. Generalized De Bruijn networks provide routing within a constant amount of hops, thus serving the interest in networks that require a low latency for requests. The 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. The supervised skip ring can be used to construct a self-stabilizing publish-subscribe system. }}, author = {{Feldmann, Michael}}, title = {{{Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks}}}, doi = {{10.17619/UNIPB/1-1113}}, year = {{2021}}, } @article{20683, author = {{Feldkord, Björn and Knollmann, Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}}, journal = {{Theory of Computing Systems}}, pages = {{943–984}}, title = {{{Managing Multiple Mobile Resources}}}, doi = {{10.1007/s00224-020-10023-8}}, volume = {{65}}, year = {{2021}}, } @inproceedings{20817, author = {{Bienkowski, Marcin and Feldkord, Björn and Schmidt, Pawel}}, booktitle = {{Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)}}, pages = {{14:1 -- 14:17}}, title = {{{A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location}}}, doi = {{10.4230/LIPIcs.STACS.2021.14}}, year = {{2021}}, } @inproceedings{22283, abstract = {{ 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. 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. 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]. 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. 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]. Additionally, we show how our algorithm can be used to efficiently solve graph problems in \emph{hybrid networks} [Augustine et al., SODA'20]. 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. 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. 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 = {{Götte, Thorsten and Hinnenthal, Kristian and Scheideler, Christian and Werthmann, Julian}}, booktitle = {{Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC '21)}}, editor = {{Censor-Hillel, Keren}}, location = {{Virtual}}, publisher = {{ACM}}, title = {{{Time-Optimal Construction of Overlays}}}, doi = {{10.1145/3465084.3467932}}, year = {{2021}}, } @inproceedings{21799, author = {{Kutzner, K. and Stadtländer, M. and Seutter, Janina and Kundisch, Dennis and Knackstedt, R.}}, booktitle = {{Proceedings of the 29th European Conference on Information Systems (ECIS)}}, location = {{Virtual Conference/Workshop}}, title = {{{”Sorry, Too Much Information” Designing Online Review Systems that Support Information Search and Processing}}}, year = {{2021}}, } @misc{24671, author = {{Ahmeckovic, Emina}}, title = {{{Die Sterne sind für alle da - Eine empirische Untersuchung zu Anforderungen der Gestaltung von barrierefreien Online-Bewertungssystemen}}}, year = {{2021}}, } @misc{24576, author = {{Funk, Daniel}}, title = {{{Wer schreibt der bleibt – Eine quantitative Untersuchung der Kundenbeziehung in Brand Communities und Smart Service Systems}}}, year = {{2021}}, } @misc{25181, author = {{Rümpker, Till}}, title = {{{Wechselwirkungen von Hemmnissen und Motivatoren mit Blick auf die Abgabe von Online-Bewertungen}}}, year = {{2021}}, } @misc{24685, author = {{Roslan, Jan-Philipp}}, title = {{{Mitten ins Herz – Eine semantische Analyse von Spendenkampagnen auf Crowdfunding Plattformen}}}, year = {{2021}}, } @misc{24577, author = {{Speer, Laura}}, title = {{{Digitale Diskriminierung – Ein systematischer Literaturüberblick}}}, year = {{2021}}, } @misc{21713, author = {{Lender, Leonie}}, title = {{{Personality Matters – Ein systematischer Literaturüberblick zur Anpassung von Anwendungssystemen an die Nutzerpersönlichkeit}}}, year = {{2021}}, } @misc{21434, author = {{Steierlein, Gergely}}, title = {{{Auswirkungen von Anreizsystemen zu nutzergenerierten Inhalten auf digitalen Märkten – Ein systematischer Literaturüberblick}}}, year = {{2021}}, } @misc{21365, author = {{Mai, Thanh Quynh}}, title = {{{Auswirkungen von Aggregationsmetriken von Bewertungen auf digitalen Märkten – Ein systematischer Literaturüberblick}}}, year = {{2021}}, }