@misc{46053,
  author       = {{Schneider, Fabian}},
  title        = {{{Utilizing Redundancy in Distributed Heterogeneous Storage}}},
  year         = {{2023}},
}

@misc{46087,
  author       = {{Ranade, Amruta}},
  title        = {{{Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption}}},
  year         = {{2023}},
}

@misc{46086,
  author       = {{Ali, Osama}},
  title        = {{{Highly accurate deep compressed facial recognition}}},
  year         = {{2023}},
}

@misc{46110,
  author       = {{Ashri, Nivedita}},
  title        = {{{Virtual On-Demand Volunteer System Based on Delaunay Triangulation}}},
  year         = {{2023}},
}

@misc{46221,
  author       = {{N., N.}},
  title        = {{{Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks}}},
  year         = {{2023}},
}

@misc{47134,
  author       = {{Deppe, Volker}},
  title        = {{{Routing in Hypergraphs}}},
  year         = {{2023}},
}

@misc{48430,
  abstract     = {{Bei dem betrachteten Speicherproblem werden Daten mit verschiedenen
Zugriffswahrscheinlichkeiten auf Speicher mit verschiedenen Bandbreiten
und Kapazitäten aufgeteilt, dabei sind Replikate erlaubt.
Es wird die nach Zugriffswahrscheinlichkeit gewichtete kleinste Bandbreite der Daten maximiert.
Wir zeigen, dass sowohl das diskrete Speicherproblem, bei dem die Bandbreite der Speicher jeweils
gleichmäßig auf die dort abgelegten Daten aufgeteilt wird, als auch das kontinuierliche
Speicherproblem, bei dem die Bandbreite der Speicher beliebig auf abgelegte Daten verteilt werden
darf, NP-schwer ist.
Es können also, wenn P ̸ = NP, keine effizienten Algorithmen für eine optimale Lösung existieren.
Stattdessen zeigen wir jeweils einen 1/2-Approximationsalgorithmus.}},
  author       = {{Decking, Leo}},
  title        = {{{Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite}}},
  year         = {{2023}},
}

@misc{30152,
  author       = {{Roopa, Rajanna}},
  title        = {{{Evaluation of Algorithms for the Node Capacitated Clique}}},
  year         = {{2022}},
}

@misc{30198,
  author       = {{Korzeczek, Sebastian}},
  title        = {{{Aufarbeitung und lmplementierung von DAG-Rider}}},
  year         = {{2022}},
}

@misc{30199,
  author       = {{Nachtigall, Marcel}},
  title        = {{{Hybrid Routing in Three Dimensions}}},
  year         = {{2022}},
}

@article{31060,
  author       = {{Feldmann, Michael and Padalkin, Andreas and Scheideler, Christian and Dolev, Shlomi}},
  journal      = {{J. Comput. Biol.}},
  number       = {{4}},
  pages        = {{317–343}},
  title        = {{{Coordinating Amoebots via Reconfigurable Circuits}}},
  doi          = {{10.1089/cmb.2021.0363}},
  volume       = {{29}},
  year         = {{2022}},
}

@misc{31947,
  author       = {{Hillebrandt, Henning}},
  title        = {{{Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen}}},
  year         = {{2022}},
}

@inproceedings{32602,
  author       = {{Padalkin, Andreas and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}},
  editor       = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}},
  isbn         = {{978-3-95977-253-2}},
  issn         = {{1868-8969}},
  pages        = {{8:1–8:22}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{The Structural Power of Reconfigurable Circuits in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.DNA.28.8}},
  volume       = {{238}},
  year         = {{2022}},
}

@inproceedings{32603,
  author       = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{28th International Conference on DNA Computing and Molecular Programming (DNA 28)}},
  editor       = {{Ouldridge, Thomas E. and Wickham, Shelley F. J.}},
  isbn         = {{978-3-95977-253-2}},
  issn         = {{1868-8969}},
  pages        = {{9:1–9:22}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Fault-Tolerant Shape Formation in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.DNA.28.9}},
  volume       = {{238}},
  year         = {{2022}},
}

@inproceedings{33230,
  author       = {{Daymude, Joshua J. and Richa, Andréa W. and Scheideler, Christian}},
  booktitle    = {{1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference}},
  editor       = {{Aspnes, James and Michail, Othon}},
  pages        = {{12:1–12:19}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems}}},
  doi          = {{10.4230/LIPIcs.SAND.2022.12}},
  volume       = {{221}},
  year         = {{2022}},
}

@inproceedings{33240,
  author       = {{Götte, Thorsten and Scheideler, Christian}},
  booktitle    = {{SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022}},
  editor       = {{Agrawal, Kunal and Lee, I-Ting Angelina}},
  pages        = {{99–101}},
  publisher    = {{ACM}},
  title        = {{{Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion}}},
  doi          = {{10.1145/3490148.3538556}},
  year         = {{2022}},
}

@inproceedings{30987,
  author       = {{Kostitsyna, Irina and Scheideler, Christian and Warner, Daniel}},
  booktitle    = {{1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}},
  editor       = {{Aspnes, James and Michail, Othon}},
  isbn         = {{978-3-95977-224-2}},
  issn         = {{1868-8969}},
  pages        = {{23:1–23:3}},
  publisher    = {{Schloss Dagstuhl – Leibniz-Zentrum für Informatik}},
  title        = {{{Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model}}},
  doi          = {{10.4230/LIPIcs.SAND.2022.23}},
  volume       = {{221}},
  year         = {{2022}},
}

@inproceedings{33967,
  author       = {{Aguiliera, Marcos and Richa, Andréa W. and Schwarzmann, Alexander A. and Panconesi, Alessandro and Scheideler, Christian and Woelfel, Philipp}},
  booktitle    = {{PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}},
  editor       = {{Milani, Alessia and Woelfel, Philipp}},
  pages        = {{1}},
  publisher    = {{ACM}},
  title        = {{{2022 Edsger W. Dijkstra Prize in Distributed Computing}}},
  doi          = {{10.1145/3519270.3538411}},
  year         = {{2022}},
}

@proceedings{33968,
  editor       = {{Scheideler, Christian}},
  isbn         = {{978-3-95977-255-6}},
  publisher    = {{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}},
  title        = {{{36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA}}},
  volume       = {{246}},
  year         = {{2022}},
}

@phdthesis{30239,
  author       = {{Kolb, Christina}},
  title        = {{{Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks}}},
  doi          = {{10.17619/UNIPB/1-1673 }},
  year         = {{2022}},
}