---
_id: '46221'
author:
- first_name: N.
  full_name: N., N.
  last_name: N.
citation:
  ama: N. N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using
    Clustering Based on Neural Networks</i>.; 2023.
  apa: N., N. (2023). <i>Improving the End-of-Line Test of Custom-Built Geared Motors
    using Clustering based on Neural Networks</i>.
  bibtex: '@book{N._2023, title={Improving the End-of-Line Test of Custom-Built Geared
    Motors using Clustering based on Neural Networks}, author={N., N.}, year={2023}
    }'
  chicago: N., N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors
    Using Clustering Based on Neural Networks</i>, 2023.
  ieee: N. N., <i>Improving the End-of-Line Test of Custom-Built Geared Motors using
    Clustering based on Neural Networks</i>. 2023.
  mla: N., N. <i>Improving the End-of-Line Test of Custom-Built Geared Motors Using
    Clustering Based on Neural Networks</i>. 2023.
  short: N. N., Improving the End-of-Line Test of Custom-Built Geared Motors Using
    Clustering Based on Neural Networks, 2023.
date_created: 2023-07-31T10:49:12Z
date_updated: 2023-07-31T10:49:30Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering
  based on Neural Networks
type: mastersthesis
user_id: '15504'
year: '2023'
...
---
_id: '48430'
abstract:
- lang: ger
  text: "Bei dem betrachteten Speicherproblem werden Daten mit verschiedenen\r\nZugriffswahrscheinlichkeiten
    auf Speicher mit verschiedenen Bandbreiten\r\nund Kapazitäten aufgeteilt, dabei
    sind Replikate erlaubt.\r\nEs wird die nach Zugriffswahrscheinlichkeit gewichtete
    kleinste Bandbreite der Daten maximiert.\r\nWir zeigen, dass sowohl das diskrete
    Speicherproblem, bei dem die Bandbreite der Speicher jeweils\r\ngleichmäßig auf
    die dort abgelegten Daten aufgeteilt wird, als auch das kontinuierliche\r\nSpeicherproblem,
    bei dem die Bandbreite der Speicher beliebig auf abgelegte Daten verteilt werden\r\ndarf,
    NP-schwer ist.\r\nEs können also, wenn P ̸ = NP, keine effizienten Algorithmen
    für eine optimale Lösung existieren.\r\nStattdessen zeigen wir jeweils einen 1/2-Approximationsalgorithmus."
author:
- first_name: Leo
  full_name: Decking, Leo
  last_name: Decking
citation:
  ama: Decking L. <i>Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
    Gewichteten Bandbreite</i>.; 2023.
  apa: Decking, L. (2023). <i>Zuweisung verteilter Speicher unter Maximierung der
    minimalen gewichteten Bandbreite</i>.
  bibtex: '@book{Decking_2023, title={Zuweisung verteilter Speicher unter Maximierung
    der minimalen gewichteten Bandbreite}, author={Decking, Leo}, year={2023} }'
  chicago: Decking, Leo. <i>Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
    Gewichteten Bandbreite</i>, 2023.
  ieee: L. Decking, <i>Zuweisung verteilter Speicher unter Maximierung der minimalen
    gewichteten Bandbreite</i>. 2023.
  mla: Decking, Leo. <i>Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
    Gewichteten Bandbreite</i>. 2023.
  short: L. Decking, Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen
    Gewichteten Bandbreite, 2023.
date_created: 2023-10-24T13:22:08Z
date_updated: 2024-10-22T13:46:33Z
ddc:
- '004'
department:
- _id: '79'
file:
- access_level: open_access
  content_type: application/pdf
  creator: scheidel
  date_created: 2024-10-22T12:34:47Z
  date_updated: 2024-10-22T13:46:33Z
  file_id: '56725'
  file_name: LeoDecking_Bachelorarbeit.pdf
  file_size: 5065530
  relation: main_file
file_date_updated: 2024-10-22T13:46:33Z
has_accepted_license: '1'
language:
- iso: eng
oa: '1'
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite
type: bachelorsthesis
user_id: '20792'
year: '2023'
...
---
_id: '30152'
author:
- first_name: Rajanna
  full_name: Roopa, Rajanna
  last_name: Roopa
citation:
  ama: Roopa R. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.;
    2022.
  apa: Roopa, R. (2022). <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.
  bibtex: '@book{Roopa_2022, title={Evaluation of Algorithms for the Node Capacitated
    Clique}, author={Roopa, Rajanna}, year={2022} }'
  chicago: Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>,
    2022.
  ieee: R. Roopa, <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.
    2022.
  mla: Roopa, Rajanna. <i>Evaluation of Algorithms for the Node Capacitated Clique</i>.
    2022.
  short: R. Roopa, Evaluation of Algorithms for the Node Capacitated Clique, 2022.
date_created: 2022-02-28T07:46:23Z
date_updated: 2022-02-28T07:46:53Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Evaluation of Algorithms for the Node Capacitated Clique
type: mastersthesis
user_id: '15504'
year: '2022'
...
---
_id: '30198'
author:
- first_name: Sebastian
  full_name: Korzeczek, Sebastian
  last_name: Korzeczek
citation:
  ama: Korzeczek S. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>.; 2022.
  apa: Korzeczek, S. (2022). <i>Aufarbeitung und lmplementierung von DAG-Rider</i>.
  bibtex: '@book{Korzeczek_2022, title={Aufarbeitung und lmplementierung von DAG-Rider},
    author={Korzeczek, Sebastian}, year={2022} }'
  chicago: Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>,
    2022.
  ieee: S. Korzeczek, <i>Aufarbeitung und lmplementierung von DAG-Rider</i>. 2022.
  mla: Korzeczek, Sebastian. <i>Aufarbeitung Und Lmplementierung von DAG-Rider</i>.
    2022.
  short: S. Korzeczek, Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.
date_created: 2022-03-03T07:47:00Z
date_updated: 2022-03-03T07:51:02Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '4'
  name: 'SFB 901 - C: SFB 901 - Project Area C'
- _id: '13'
  name: 'SFB 901 - C1: SFB 901 - Subproject C1'
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Aufarbeitung und lmplementierung von DAG-Rider
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '30199'
author:
- first_name: Marcel
  full_name: Nachtigall, Marcel
  last_name: Nachtigall
citation:
  ama: Nachtigall M. <i>Hybrid Routing in Three Dimensions</i>.; 2022.
  apa: Nachtigall, M. (2022). <i>Hybrid Routing in Three Dimensions</i>.
  bibtex: '@book{Nachtigall_2022, title={Hybrid Routing in Three Dimensions}, author={Nachtigall,
    Marcel}, year={2022} }'
  chicago: Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>, 2022.
  ieee: M. Nachtigall, <i>Hybrid Routing in Three Dimensions</i>. 2022.
  mla: Nachtigall, Marcel. <i>Hybrid Routing in Three Dimensions</i>. 2022.
  short: M. Nachtigall, Hybrid Routing in Three Dimensions, 2022.
date_created: 2022-03-03T07:50:45Z
date_updated: 2022-03-03T07:50:59Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Hybrid Routing in Three Dimensions
type: mastersthesis
user_id: '15504'
year: '2022'
...
---
_id: '31947'
author:
- first_name: Henning
  full_name: Hillebrandt, Henning
  last_name: Hillebrandt
citation:
  ama: Hillebrandt H. <i>Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
    Graphen</i>.; 2022.
  apa: Hillebrandt, H. (2022). <i>Verteiltes Berechnen kompakter Routingtabellen in
    Unit Disk Graphen</i>.
  bibtex: '@book{Hillebrandt_2022, title={Verteiltes Berechnen kompakter Routingtabellen
    in Unit Disk Graphen}, author={Hillebrandt, Henning}, year={2022} }'
  chicago: Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen
    in Unit Disk Graphen</i>, 2022.
  ieee: H. Hillebrandt, <i>Verteiltes Berechnen kompakter Routingtabellen in Unit
    Disk Graphen</i>. 2022.
  mla: Hillebrandt, Henning. <i>Verteiltes Berechnen Kompakter Routingtabellen in
    Unit Disk Graphen</i>. 2022.
  short: H. Hillebrandt, Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk
    Graphen, 2022.
date_created: 2022-06-20T06:16:32Z
date_updated: 2022-06-20T06:16:49Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2022-06-20T06:16:09Z
  date_updated: 2022-06-20T06:16:09Z
  file_id: '31950'
  file_name: BA_Hillebrandt.pdf
  file_size: 1585281
  relation: main_file
  success: 1
file_date_updated: 2022-06-20T06:16:09Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen
type: bachelorsthesis
user_id: '15504'
year: '2022'
...
---
_id: '30239'
author:
- first_name: Christina
  full_name: Kolb, Christina
  last_name: Kolb
citation:
  ama: Kolb C. <i>Competitive Routing in Hybrid Communications Networks and Message
    Efficient SetCover in AdHoc Networks</i>.; 2022. doi:<a href="https://doi.org/10.17619/UNIPB/1-1673
    ">10.17619/UNIPB/1-1673 </a>
  apa: Kolb, C. (2022). <i>Competitive Routing in Hybrid Communications Networks and
    Message efficient SetCover in AdHoc Networks</i>. <a href="https://doi.org/10.17619/UNIPB/1-1673
    ">https://doi.org/10.17619/UNIPB/1-1673 </a>
  bibtex: '@book{Kolb_2022, title={Competitive Routing in Hybrid Communications Networks
    and Message efficient SetCover in AdHoc Networks}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1673
    ">10.17619/UNIPB/1-1673 </a>}, author={Kolb, Christina}, year={2022} }'
  chicago: Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks
    and Message Efficient SetCover in AdHoc Networks</i>, 2022. <a href="https://doi.org/10.17619/UNIPB/1-1673
    ">https://doi.org/10.17619/UNIPB/1-1673 </a>.
  ieee: C. Kolb, <i>Competitive Routing in Hybrid Communications Networks and Message
    efficient SetCover in AdHoc Networks</i>. 2022.
  mla: Kolb, Christina. <i>Competitive Routing in Hybrid Communications Networks and
    Message Efficient SetCover in AdHoc Networks</i>. 2022, doi:<a href="https://doi.org/10.17619/UNIPB/1-1673
    ">10.17619/UNIPB/1-1673 </a>.
  short: C. Kolb, Competitive Routing in Hybrid Communications Networks and Message
    Efficient SetCover in AdHoc Networks, 2022.
date_created: 2022-03-11T06:05:54Z
date_updated: 2023-03-17T07:22:04Z
department:
- _id: '79'
doi: '10.17619/UNIPB/1-1673 '
language:
- iso: eng
project:
- _id: '1'
  name: 'SFB 901: SFB 901'
- _id: '2'
  name: 'SFB 901 - A: SFB 901 - Project Area A'
- _id: '5'
  name: 'SFB 901 - A1: SFB 901 - Subproject A1'
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Competitive Routing in Hybrid Communications Networks and Message efficient
  SetCover in AdHoc Networks
type: dissertation
user_id: '15504'
year: '2022'
...
---
_id: '24887'
author:
- first_name: Kristian
  full_name: Hinnenthal, Kristian
  id: '32229'
  last_name: Hinnenthal
citation:
  ama: Hinnenthal K. <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable
    Matter</i>.; 2021. doi:<a href="https://doi.org/10.17619/UNIPB/1-1169 ">10.17619/UNIPB/1-1169
    </a>
  apa: Hinnenthal, K. (2021). <i>Models and Algorithms for Hybrid Networks and Hybrid
    Programmable Matter</i>. <a href="https://doi.org/10.17619/UNIPB/1-1169 ">https://doi.org/10.17619/UNIPB/1-1169
    </a>
  bibtex: '@book{Hinnenthal_2021, title={Models and Algorithms for Hybrid Networks
    and Hybrid Programmable Matter}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1169
    ">10.17619/UNIPB/1-1169 </a>}, author={Hinnenthal, Kristian}, year={2021} }'
  chicago: Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and
    Hybrid Programmable Matter</i>, 2021. <a href="https://doi.org/10.17619/UNIPB/1-1169
    ">https://doi.org/10.17619/UNIPB/1-1169 </a>.
  ieee: K. Hinnenthal, <i>Models and Algorithms for Hybrid Networks and Hybrid Programmable
    Matter</i>. 2021.
  mla: Hinnenthal, Kristian. <i>Models and Algorithms for Hybrid Networks and Hybrid
    Programmable Matter</i>. 2021, doi:<a href="https://doi.org/10.17619/UNIPB/1-1169
    ">10.17619/UNIPB/1-1169 </a>.
  short: K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable
    Matter, 2021.
date_created: 2021-09-22T12:33:44Z
date_updated: 2022-01-06T06:56:40Z
department:
- _id: '79'
doi: '10.17619/UNIPB/1-1169 '
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: Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter
type: dissertation
user_id: '15504'
year: '2021'
...
---
_id: '25126'
abstract:
- lang: eng
  text: Motivated by the prospect of computing agents that explore unknown environments
    and construct convex hulls on the nanoscale, we investigate the capabilities and
    limitations of a single deterministic finite automaton robot in the three-dimensional
    hybrid model for programmable matter. In this model, active robots move on a set
    of passive tiles, called configuration, with the geometric shape of rhombic dodecahedra
    on the adjacency graph of the face-centered cubic sphere-packing. We show that
    the exploration problem is equally hard in the hybrid model and in three-dimensional
    mazes, in which tiles have the shape of cubes and are positioned at the vertices
    of $\mathbb{Z}^3$. Thereby, a single robot with a constant number of pebbles cannot
    solve this problem in the hybrid model on arbitrary configurations. We provide
    algorithms for a robot with two pebbles that solve the exploration problem in
    the subclass of compact configurations of size $n$ in $\O(n^3)$ rounds. Further,
    we investigate the robot's capabilities of detection and hull construction in
    terms of restricted orientation convexity. We show that a robot without any pebble
    can detect strong $\O$-convexity in $\O(n)$ rounds, but cannot detect weak $\O$-convexity,
    not even if provided with a single pebble. Assuming that a robot can construct
    tiles from scratch and deconstruct previously constructed tiles, we show that
    the strong $\O$-hull of any given configuration of size $n$ can be constructed
    in $\O(n^4)$ rounds, even if the robot cannot distinguish constructed from native
    tiles.
author:
- first_name: David Jan
  full_name: Liedtke, David Jan
  id: '55557'
  last_name: Liedtke
citation:
  ama: Liedtke DJ. <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>.; 2021.
  apa: Liedtke, D. J. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>.
  bibtex: '@book{Liedtke_2021, title={Exploration and Convex Hull Construction in
    the Three-Dimensional Hybrid Model}, author={Liedtke, David Jan}, year={2021}
    }'
  chicago: Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the
    Three-Dimensional Hybrid Model</i>, 2021.
  ieee: D. J. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>. 2021.
  mla: Liedtke, David Jan. <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>. 2021.
  short: D.J. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model, 2021.
date_created: 2021-09-29T12:37:39Z
date_updated: 2022-01-06T06:56:53Z
ddc:
- '000'
department:
- _id: '79'
file:
- access_level: local
  content_type: application/pdf
  creator: liedtke
  date_created: 2021-09-29T12:34:47Z
  date_updated: 2021-09-29T12:34:47Z
  file_id: '25128'
  file_name: Master - Thesis.pdf
  file_size: 10114825
  relation: main_file
file_date_updated: 2021-09-29T12:34:47Z
has_accepted_license: '1'
keyword:
- Robot Exploration
- Finite Automaton
- Hybrid Model for Programmable Matter
- Convex Hull
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
type: mastersthesis
user_id: '55557'
year: '2021'
...
---
_id: '28998'
author:
- first_name: Dennis
  full_name: Suermann, Dennis
  last_name: Suermann
citation:
  ama: Suermann D. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des
    Relay-Layers</i>.; 2021.
  apa: Suermann, D. (2021). <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe
    des Relay-Layers</i>.
  bibtex: '@book{Suermann_2021, title={Schutz und Stabilisierung von Overlay-Netzwerken
    mithilfe des Relay-Layers}, author={Suermann, Dennis}, year={2021} }'
  chicago: Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe
    Des Relay-Layers</i>, 2021.
  ieee: D. Suermann, <i>Schutz und Stabilisierung von Overlay-Netzwerken mithilfe
    des Relay-Layers</i>. 2021.
  mla: Suermann, Dennis. <i>Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe
    Des Relay-Layers</i>. 2021.
  short: D. Suermann, Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des
    Relay-Layers, 2021.
date_created: 2021-12-16T06:41:25Z
date_updated: 2022-01-06T06:58:43Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers
type: bachelorsthesis
user_id: '15504'
year: '2021'
...
---
_id: '27053'
author:
- first_name: Leon
  full_name: Everling, Leon
  last_name: Everling
citation:
  ama: Everling L. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme</i>.;
    2021.
  apa: Everling, L. (2021). <i>Selbststabilisierender Bakery Algorithmus für verteilte
    Systeme</i>.
  bibtex: '@book{Everling_2021, title={Selbststabilisierender Bakery Algorithmus für
    verteilte Systeme}, author={Everling, Leon}, year={2021} }'
  chicago: Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte
    Systeme</i>, 2021.
  ieee: L. Everling, <i>Selbststabilisierender Bakery Algorithmus für verteilte Systeme</i>.
    2021.
  mla: Everling, Leon. <i>Selbststabilisierender Bakery Algorithmus Für Verteilte
    Systeme</i>. 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. <i>Peer-to-Peer Matching for Distributed Systems</i>.; 2021.
  apa: Adsul, V. (2021). <i>Peer-to-Peer Matching for Distributed Systems</i>.
  bibtex: '@book{Adsul_2021, title={Peer-to-Peer Matching for Distributed Systems},
    author={Adsul, Vaibhav}, year={2021} }'
  chicago: Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>, 2021.
  ieee: V. Adsul, <i>Peer-to-Peer Matching for Distributed Systems</i>. 2021.
  mla: Adsul, Vaibhav. <i>Peer-to-Peer Matching for Distributed Systems</i>. 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. <i>Derandomization and Local Graph Problems in the Node-Capacitated
    Clique</i>.; 2021.
  apa: Werthmann, J. (2021). <i>Derandomization and Local Graph Problems in the Node-Capacitated
    Clique</i>.
  bibtex: '@book{Werthmann_2021, title={Derandomization and Local Graph Problems in
    the Node-Capacitated Clique}, author={Werthmann, Julian}, year={2021} }'
  chicago: Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated
    Clique</i>, 2021.
  ieee: J. Werthmann, <i>Derandomization and Local Graph Problems in the Node-Capacitated
    Clique</i>. 2021.
  mla: Werthmann, Julian. <i>Derandomization and Local Graph Problems in the Node-Capacitated
    Clique</i>. 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. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
    Diameter</i>.; 2021.
  apa: Mengshi, M. (2021). <i>Self-stabilizing Arrow Protocol on Spanning Trees with
    a Low Diameter</i>.
  bibtex: '@book{Mengshi_2021, title={Self-stabilizing Arrow Protocol on Spanning
    Trees with a Low Diameter}, author={Mengshi, Ma}, year={2021} }'
  chicago: Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with
    a Low Diameter</i>, 2021.
  ieee: M. Mengshi, <i>Self-stabilizing Arrow Protocol on Spanning Trees with a Low
    Diameter</i>. 2021.
  mla: Mengshi, Ma. <i>Self-Stabilizing Arrow Protocol on Spanning Trees with a Low
    Diameter</i>. 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: '21627'
author:
- first_name: David
  full_name: Liedtke, David
  last_name: Liedtke
citation:
  ama: Liedtke D. <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>.; 2021.
  apa: Liedtke, D. (2021). <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>.
  bibtex: '@book{Liedtke_2021, title={Exploration and Convex Hull Construction in
    the Three-Dimensional Hybrid Model}, author={Liedtke, David}, year={2021} }'
  chicago: Liedtke, David. <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>, 2021.
  ieee: D. Liedtke, <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>. 2021.
  mla: Liedtke, David. <i>Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model</i>. 2021.
  short: D. Liedtke, Exploration and Convex Hull Construction in the Three-Dimensional
    Hybrid Model, 2021.
date_created: 2021-04-15T05:51:43Z
date_updated: 2022-01-06T06:55:08Z
department:
- _id: '79'
language:
- iso: eng
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model
type: mastersthesis
user_id: '15504'
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. <i>Algorithms for Distributed Data Structures and Self-Stabilizing
    Overlay Networks</i>.; 2021. doi:<a href="https://doi.org/10.17619/UNIPB/1-1113">10.17619/UNIPB/1-1113</a>
  apa: Feldmann, M. (2021). <i>Algorithms for Distributed Data Structures and Self-Stabilizing
    Overlay Networks</i>. <a href="https://doi.org/10.17619/UNIPB/1-1113">https://doi.org/10.17619/UNIPB/1-1113</a>
  bibtex: '@book{Feldmann_2021, title={Algorithms for Distributed Data Structures
    and Self-Stabilizing Overlay Networks}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1113">10.17619/UNIPB/1-1113</a>},
    author={Feldmann, Michael}, year={2021} }'
  chicago: Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing
    Overlay Networks</i>, 2021. <a href="https://doi.org/10.17619/UNIPB/1-1113">https://doi.org/10.17619/UNIPB/1-1113</a>.
  ieee: M. Feldmann, <i>Algorithms for Distributed Data Structures and Self-Stabilizing
    Overlay Networks</i>. 2021.
  mla: Feldmann, Michael. <i>Algorithms for Distributed Data Structures and Self-Stabilizing
    Overlay Networks</i>. 2021, doi:<a href="https://doi.org/10.17619/UNIPB/1-1113">10.17619/UNIPB/1-1113</a>.
  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: '20221'
author:
- first_name: Paresh Kishor
  full_name: Yeole, Paresh Kishor
  last_name: Yeole
citation:
  ama: Yeole PK. <i>Plurality Consensus in Hybrid Networks</i>.; 2020.
  apa: Yeole, P. K. (2020). <i>Plurality Consensus in Hybrid Networks</i>.
  bibtex: '@book{Yeole_2020, title={Plurality Consensus in Hybrid Networks}, author={Yeole,
    Paresh Kishor}, year={2020} }'
  chicago: Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>, 2020.
  ieee: P. K. Yeole, <i>Plurality Consensus in Hybrid Networks</i>. 2020.
  mla: Yeole, Paresh Kishor. <i>Plurality Consensus in Hybrid Networks</i>. 2020.
  short: P.K. Yeole, Plurality Consensus in Hybrid Networks, 2020.
date_created: 2020-10-29T07:45:57Z
date_updated: 2022-01-06T06:54:23Z
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: Plurality Consensus in Hybrid Networks
type: mastersthesis
user_id: '15504'
year: '2020'
...
---
_id: '20495'
author:
- first_name: Moritz
  full_name: Jochmaring, Moritz
  last_name: Jochmaring
citation:
  ama: Jochmaring M. <i>A Self Stabilizing Protocol for Well-Formed Trees in Hybrid
    Networks</i>.; 2020.
  apa: Jochmaring, M. (2020). <i>A self stabilizing protocol for well-formed trees
    in hybrid networks</i>.
  bibtex: '@book{Jochmaring_2020, title={A self stabilizing protocol for well-formed
    trees in hybrid networks}, author={Jochmaring, Moritz}, year={2020} }'
  chicago: Jochmaring, Moritz. <i>A Self Stabilizing Protocol for Well-Formed Trees
    in Hybrid Networks</i>, 2020.
  ieee: M. Jochmaring, <i>A self stabilizing protocol for well-formed trees in hybrid
    networks</i>. 2020.
  mla: Jochmaring, Moritz. <i>A Self Stabilizing Protocol for Well-Formed Trees in
    Hybrid Networks</i>. 2020.
  short: M. Jochmaring, A Self Stabilizing Protocol for Well-Formed Trees in Hybrid
    Networks, 2020.
date_created: 2020-11-25T07:03:16Z
date_updated: 2022-01-06T06:54:27Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: A self stabilizing protocol for well-formed trees in hybrid networks
type: mastersthesis
user_id: '15504'
year: '2020'
...
---
_id: '18066'
author:
- first_name: Michael
  full_name: Skowronek, Michael
  last_name: Skowronek
citation:
  ama: Skowronek M. <i>Approaches for Competetive Routing through Intersections of
    Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn;
    2020.
  apa: Skowronek, M. (2020). <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn.
  bibtex: '@book{Skowronek_2020, title={Approaches for Competetive Routing through
    Intersections of Hole Abstractions in Hybrid Communication Networks}, publisher={Universität
    Paderborn}, author={Skowronek, Michael}, year={2020} }'
  chicago: Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn,
    2020.
  ieee: M. Skowronek, <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn,
    2020.
  mla: Skowronek, Michael. <i>Approaches for Competetive Routing through Intersections
    of Hole Abstractions in Hybrid Communication Networks</i>. Universität Paderborn,
    2020.
  short: M. Skowronek, Approaches for Competetive Routing through Intersections of
    Hole Abstractions in Hybrid Communication Networks, Universität Paderborn, 2020.
date_created: 2020-08-20T07:40:58Z
date_updated: 2022-01-06T06:53:25Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subproject A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Approaches for Competetive Routing through Intersections of Hole Abstractions
  in Hybrid Communication Networks
type: bachelorsthesis
user_id: '477'
year: '2020'
...
---
_id: '18520'
author:
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
citation:
  ama: Setzer A. <i>Local Graph Transformation Primitives For Some Basic Problems
    In Overlay Networks</i>. Universität Paderborn; 2020. doi:<a href="https://doi.org/10.17619/UNIPB/1-1026">10.17619/UNIPB/1-1026</a>
  apa: Setzer, A. (2020). <i>Local Graph Transformation Primitives For Some Basic
    Problems In Overlay Networks</i>. Universität Paderborn. <a href="https://doi.org/10.17619/UNIPB/1-1026">https://doi.org/10.17619/UNIPB/1-1026</a>
  bibtex: '@book{Setzer_2020, title={Local Graph Transformation Primitives For Some
    Basic Problems In Overlay Networks}, DOI={<a href="https://doi.org/10.17619/UNIPB/1-1026">10.17619/UNIPB/1-1026</a>},
    publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2020} }'
  chicago: Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic
    Problems In Overlay Networks</i>. Universität Paderborn, 2020. <a href="https://doi.org/10.17619/UNIPB/1-1026">https://doi.org/10.17619/UNIPB/1-1026</a>.
  ieee: A. Setzer, <i>Local Graph Transformation Primitives For Some Basic Problems
    In Overlay Networks</i>. Universität Paderborn, 2020.
  mla: Setzer, Alexander. <i>Local Graph Transformation Primitives For Some Basic
    Problems In Overlay Networks</i>. Universität Paderborn, 2020, doi:<a href="https://doi.org/10.17619/UNIPB/1-1026">10.17619/UNIPB/1-1026</a>.
  short: A. Setzer, Local Graph Transformation Primitives For Some Basic Problems
    In Overlay Networks, Universität Paderborn, 2020.
date_created: 2020-08-28T06:50:29Z
date_updated: 2022-01-06T06:53:36Z
department:
- _id: '79'
doi: 10.17619/UNIPB/1-1026
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '4'
  name: SFB 901 - Project Area C
- _id: '13'
  name: SFB 901 - Subproject C1
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
title: Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks
type: dissertation
user_id: '477'
year: '2020'
...