@misc{223,
  abstract     = {{We consider the problem of aggregation in overlay networks. We use a synchronous time model in which each node has polylogarithmic memory and can send at most a polylogarithmic number of messages per round. We investigate how to quickly compute the result of an aggregate functionf over elements that are distributed among the nodes of the network such that the result is eventually known by a selected root node. We show how to compute distributive aggregate functions such as SUM, MAX, and OR in time $O(\log n / \log\log n)$ using a tree that is created in a pre-processing phase. If only a polylogarithmic number of data items need to be aggregated, we show how to compute the result in time $O(\sqrt{\log n / \log\log n})$. Furthermore, we show how to compute holistic aggregate functions such as DISTINCT, SMALLEST(k) and MODE(k) in time $O(\log n / \log\log n)$. Finally, we show a lower bound of $\Omega(\sqrt{\log n / \log\log n})$ for deterministic algorithms that compute any of the aggregate functions in the scope of the thesis.}},
  author       = {{Hinnenthal, Kristian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Aggregation in Overlay Networks}}},
  year         = {{2016}},
}

@phdthesis{10136,
  author       = {{Eikel, Martina}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Insider-resistent Distributed Storage Systems}}},
  year         = {{2016}},
}

@phdthesis{304,
  author       = {{Koutsopoulos, Andreas}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Dynamics and Efficiency in Topological Self-Stabilization}}},
  year         = {{2015}},
}

@phdthesis{305,
  author       = {{Kniesburges, Sebastian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Distributed Data Structures and the Power of topological Self-Stabilization}}},
  year         = {{2015}},
}

@misc{278,
  author       = {{Feldmann, Michael}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Monotonic Searchability for distributed sorted Lists and De Bruijn Graphs}}},
  year         = {{2015}},
}

@misc{18003,
  author       = {{Götte, Thorsten}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Covering and Bridging im selbstorganisierenden Partikelsystem Amoebabot}}},
  year         = {{2015}},
}

@misc{18004,
  author       = {{Isenberg, Daniel}},
  title        = {{{3D-Nesting in der SLM-Technologie}}},
  year         = {{2015}},
}

@misc{18005,
  author       = {{Korfmacher, Christian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Implementierung und Analyse von Cone-DHT}}},
  year         = {{2015}},
}

@misc{18006,
  author       = {{Sundermeier, Jannik}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Implementierung eines selbststabilisierenden verteilten Stacks}}},
  year         = {{2015}},
}

@misc{18024,
  author       = {{Knollmann, Till}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Implementierung einer selbststabilisierenden Datenstruktur für das längste gemeinsame Präfix}}},
  year         = {{2015}},
}

@misc{18001,
  author       = {{Luo, Linghui}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Ein selbst-stabilisierender Algorithmus für das Finite Sleep Problem in Skip+ Graphen}}},
  year         = {{2014}},
}

@misc{18002,
  author       = {{Hinnenthal, Kristian}},
  title        = {{{Formbildung selbstorganisierender Partikelsysteme}}},
  year         = {{2014}},
}

@misc{18000,
  author       = {{Blumentritt, Fritz}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Cliquenbildung in verteilten Systemen}}},
  year         = {{2013}},
}

@misc{522,
  author       = {{Feldotto, Matthias}},
  publisher    = {{Universität Paderborn}},
  title        = {{{HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}}},
  year         = {{2013}},
}

@misc{17999,
  author       = {{Meith, Frank Ingo}},
  title        = {{{Jamming-resistente MAC-Protokolle}}},
  year         = {{2012}},
}

@misc{17997,
  author       = {{Setzer, Alexander}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk}}},
  year         = {{2011}},
}

@misc{17998,
  author       = {{Sascha, Brauer}},
  title        = {{{Implementierung eines Verfahrens zur Lösung des 3-Mincut-Problems}}},
  year         = {{2011}},
}

@misc{648,
  author       = {{Brandes, Philipp}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Robust Distributed Computation in Dynamic Networks}}},
  year         = {{2011}},
}

@misc{665,
  author       = {{Wette, Philip}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord}}},
  year         = {{2011}},
}