Ashri, N. (2023). Virtual On-Demand Volunteer System Based on Delaunay Triangulation.

N., N. (2023). Improving the End-of-Line Test of Custom-Built Geared Motors using Clustering based on Neural Networks.

Deppe, V. (2023). Routing in Hypergraphs.

Decking, L. (2023). Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite.

Nickel, A. (2023). Entwicklung und Analyse von Formeln zur Abschätzung der Renderingzeit eines Frames.

Telaprolu, V. (2023). Reconstruction of 3D Surfels from Neural Radiance Fields.

Friemel, J. (2023). Shape Reconfiguration by Hybrid Programmable Matter.

Beckendorf, B. (2023). Self-Stabilizing Skip-Graph with Growth-bounded Metric.

Roopa, R. (2022). Evaluation of Algorithms for the Node Capacitated Clique.

Korzeczek, S. (2022). Aufarbeitung und lmplementierung von DAG-Rider.

Nachtigall, M. (2022). Hybrid Routing in Three Dimensions.

Feldmann, M., Padalkin, A., Scheideler, C., &; Dolev, S. (2022). Coordinating Amoebots via Reconfigurable Circuits. J. Comput. Biol., 29(4), 317–343.https://doi.org/10.1089/cmb.2021.0363 

Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen.

Padalkin, A., Scheideler, C., &; Warner, D. (2022). The Structural Power of Reconfigurable Circuits in the Amoebot Model. In T. E. Ouldridge &; S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 8:1–8:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DNA.28.8 

Kostitsyna, I., Scheideler, C., &; Warner, D. (2022). Fault-Tolerant Shape Formation in the Amoebot Model. In T. E. Ouldridge &; S. F. J. Wickham (Eds.), 28th International Conference on DNA Computing and Molecular Programming (DNA 28) (Vol. 238, p. 9:1–9:22). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DNA.28.9 

Daymude, J. J., Richa, A. W., &; Scheideler, C. (2022). Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems. In J. Aspnes &; O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference (Vol. 221, p. 12:1–12:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SAND.2022.12 

Götte, T., &; Scheideler, C. (2022). Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion. In K. Agrawal &; I.-T. A. Lee (Eds.), SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022 (pp. 99–101). ACM.https://doi.org/10.1145/3490148.3538556 

Kostitsyna, I., Scheideler, C., &; Warner, D. (2022). Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model. In J. Aspnes &; O. Michail (Eds.), 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022) (Vol. 221, p. 23:1–23:3). Schloss Dagstuhl – Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SAND.2022.23 

Aguiliera, M., Richa, A. W., Schwarzmann, A. A., Panconesi, A., Scheideler, C., &; Woelfel, P. (2022). 2022 Edsger W. Dijkstra Prize in Distributed Computing. In A. Milani &; P. Woelfel (Eds.), PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022 (p. 1). ACM.https://doi.org/10.1145/3519270.3538411 

Scheideler, C. (Ed.). (2022). 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA (Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.