Ashri, Nivedita. Virtual On-Demand Volunteer System Based on Delaunay Triangulation, 2023.

N., N. Improving the End-of-Line Test of Custom-Built Geared Motors Using Clustering Based on Neural Networks, 2023.

Deppe, Volker. Routing in Hypergraphs, 2023.

Decking, Leo. Zuweisung Verteilter Speicher Unter Maximierung Der Minimalen Gewichteten Bandbreite, 2023.

Nickel, Alexander. Entwicklung Und Analyse von Formeln Zur Abschätzung Der Renderingzeit Eines Frames, 2023.

Telaprolu, Vipasyan. Reconstruction of 3D Surfels from Neural Radiance Fields, 2023.

Friemel, Jonas. Shape Reconfiguration by Hybrid Programmable Matter, 2023.

Beckendorf, Björn. Self-Stabilizing Skip-Graph with Growth-Bounded Metric, 2023.

Roopa, Rajanna. Evaluation of Algorithms for the Node Capacitated Clique, 2022.

Korzeczek, Sebastian. Aufarbeitung Und Lmplementierung von DAG-Rider, 2022.

Nachtigall, Marcel. Hybrid Routing in Three Dimensions, 2022.

Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.”https://doi.org/10.1089/cmb.2021.0363__J. Comput. Biol. 29, no. 4 (2022): 317–343.https://doi.org/10.1089/cmb.2021.0363 .

Hillebrandt, Henning. Verteiltes Berechnen Kompakter Routingtabellen in Unit Disk Graphen, 2022.

Padalkin, Andreas, Christian Scheideler, and Daniel Warner. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.”https://doi.org/10.4230/LIPIcs.DNA.28.8__In 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:8:1–8:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.DNA.28.8 .

Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Fault-Tolerant Shape Formation in the Amoebot Model.”https://doi.org/10.4230/LIPIcs.DNA.28.9__In 28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, 238:9:1–9:22. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.DNA.28.9 .

Daymude, Joshua J., Andréa W. Richa, and Christian Scheideler. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.”https://doi.org/10.4230/LIPIcs.SAND.2022.12__In 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, 221:12:1–12:19. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.SAND.2022.12 .

Götte, Thorsten, and Christian Scheideler. “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.”https://doi.org/10.1145/3490148.3538556__In SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, edited by Kunal Agrawal and I-Ting Angelina Lee, 99–101. ACM, 2022.https://doi.org/10.1145/3490148.3538556 .

Kostitsyna, Irina, Christian Scheideler, and Daniel Warner. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.”https://doi.org/10.4230/LIPIcs.SAND.2022.23__In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, 221:23:1–23:3. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022.https://doi.org/10.4230/LIPIcs.SAND.2022.23 .

Aguiliera, Marcos, Andréa W. Richa, Alexander A. Schwarzmann, Alessandro Panconesi, Christian Scheideler, and Philipp Woelfel. “Edsger W. Dijkstra Prize in Distributed Computing.”https://doi.org/10.1145/3519270.3538411__In PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, 1. ACM, 2022.https://doi.org/10.1145/3519270.3538411 .

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

Kolb, Christina. Competitive Routing in Hybrid Communications Networks and Message Efficient SetCover in AdHoc Networks, 2022.https://doi.org/10.17619/UNIPB/1-1673  .

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”https://doi.org/10.1016/j.ic.2021.104697__Information and Computation, 2022.https://doi.org/10.1016/j.ic.2021.104697 .

Hinnenthal, Kristian. Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.https://doi.org/10.17619/UNIPB/1-1169  .

Liedtke, David Jan. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.

Feldmann, Michael, Andreas Padalkin, Christian Scheideler, and Shlomi Dolev. “Coordinating Amoebots via Reconfigurable Circuits.”https://doi.org/10.1007/978-3-030-91081-5‑34__In Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen, Elad Michael Schiller, and Stefan Schmid, 13046:484–88. Lecture Notes in Computer Science. Springer, 2021.https://doi.org/10.1007/978-3-030-91081-5‑34 .

Suermann, Dennis. Schutz Und Stabilisierung von Overlay-Netzwerken Mithilfe Des Relay-Layers, 2021.

Everling, Leon. Selbststabilisierender Bakery Algorithmus Für Verteilte Systeme, 2021.

Adsul, Vaibhav. Peer-to-Peer Matching for Distributed Systems, 2021.

Werthmann, Julian. Derandomization and Local Graph Problems in the Node-Capacitated Clique, 2021.

Mengshi, Ma. Self-Stabilizing Arrow Protocol on Spanning Trees with a Low Diameter, 2021.

Liedtke, David. Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model, 2021.

Feldmann, Michael. Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks, 2021.https://doi.org/10.17619/UNIPB/1-1113 .

Coy, Sam, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. “Near-Shortest Path Routing in Hybrid Communication Networks.”https://doi.org/10.4230/LIPIcs.OPODIS.2021.11__In 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas, Vincent Gramoli, and Alessia Milani, 217:11:1–11:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.https://doi.org/10.4230/LIPIcs.OPODIS.2021.11 .

Yeole, Paresh Kishor. Plurality Consensus in Hybrid Networks, 2020.

Werneck Richa, Andrea, and Christian Scheideler, eds. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156. Lecture Notes in Computer Science. Springer, 2020.https://doi.org/10.1007/978-3-030-54921-3 .

Scheideler, Christian, and Michael Spear, eds. SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM, 2020.https://doi.org/10.1145/3350755 .

Jochmaring, Moritz. A Self Stabilizing Protocol for Well-Formed Trees in Hybrid Networks, 2020.

Feldmann, Michael, Kristian Hinnenthal, and Christian Scheideler. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.”https://doi.org/10.4230/LIPIcs.OPODIS.2020.31__In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.https://doi.org/10.4230/LIPIcs.OPODIS.2020.31 .

Skowronek, Michael. Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn, 2020.

Setzer, Alexander. Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn, 2020.https://doi.org/10.17619/UNIPB/1-1026 .

Guggenmos, Andreas. Algorithmen Für Selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn, 2020.

Feldmann, Michael, Christian Scheideler, and Stefan Schmid. “Survey on Algorithms for Self-Stabilizing Overlay Networks.”https://doi.org/10.1145/3397190__ACM Computing Surveys, 2020.https://doi.org/10.1145/3397190 .

Feldmann, Michael, Ardalan Khazraei, and Christian Scheideler. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.”https://doi.org/10.1145/3350755.3400246__In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM, 2020.https://doi.org/10.1145/3350755.3400246 .

Warner, Daniel. On the Complexity of Local Transformations in SDN Overlays. Universität Paderborn, 2020.

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). ACM, n.d.

N., N. Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems, 2019.

Feldmann, Michael, and Christian Scheideler. “Skeap &; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.”https://doi.org/10.1145/3323165.3323193__In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 287--296. ACM, 2019.https://doi.org/10.1145/3323165.3323193 .

Augustine, John, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, and Christian Scheideler. “Distributed Computation in Node-Capacitated Networks.”https://doi.org/10.1145/3323165.3323195__In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 69--79. ACM, 2019.https://doi.org/10.1145/3323165.3323195 .

Götte, Thorsten, Vipin Ravindran Vijayalakshmi, and Christian Scheideler. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” In Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19). IEEE, n.d.

Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.”https://doi.org/10.4230/LIPICS.ICALP.2019.150__In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 132:150:1--150:14. LIPIcs. Dagstuhl Publishing, 2019.https://doi.org/10.4230/LIPICS.ICALP.2019.150 .

Scheideler, Christian, and Petra Berenbrink, eds. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019.https://doi.org/10.1145/3323165 .

Gmyr, Robert, Jonas Lefevre, and Christian Scheideler. “Self-Stabilizing Metric Graphs.”https://doi.org/10.1007/s00224-017-9823-4__Theory Comput. Syst. 63, no. 2 (2019): 177–99.https://doi.org/10.1007/s00224-017-9823-4 .

Castenow, Jannik, Christina Kolb, and Christian Scheideler. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1007/978-3-030-24922-9‑26__In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 345–48, 2019.https://doi.org/10.1007/978-3-030-24922-9‑26 .

Feldmann, Michael, Thorsten Götte, and Christian Scheideler. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”https://doi.org/10.1007/978-3-030-34992-9_13__In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 149–64. Lecture Notes in Computer Science. Springer, Cham, 2019.https://doi.org/10.1007/978-3-030-34992-9_13 .

N., N. Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn, 2019.

Hinnenthal, Kristian, Christian Scheideler, and Martijn Struijs. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.”https://doi.org/10.4230/LIPICS.DISC.2019.23__In 33rd International Symposium on Distributed Computing (DISC 2019), 2019.https://doi.org/10.4230/LIPICS.DISC.2019.23 .

Robinson, Peter, Christian Scheideler, and Alexander Setzer. “Breaking the $\'4fmega(\'73qrtn)$ Barrier: Fast Consensus under a Late Adversary.”https://doi.org/10.1145/3210377.3210399__In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), n.d.https://doi.org/10.1145/3210377.3210399 .

Scheideler, Christian, and Jeremy T. Fineman, eds. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.

Gmyr, Robert. Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn, 2018.https://doi.org/10.17619/UNIPB/1-265 .

Feldmann, Michael, Christina Kolb, Christian Scheideler, and Thim Frederik Strothmann. “Self-Stabilizing Supervised Publish-Subscribe Systems.”https://doi.org/10.1109/IPDPS.2018.00114__In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). IEEE, 2018.https://doi.org/10.1109/IPDPS.2018.00114 .

Feldmann, Michael, Christian Scheideler, and Alexander Setzer. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.”https://doi.org/10.1109/IPDPS.2018.00113__In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). IEEE, 2018.https://doi.org/10.1109/IPDPS.2018.00113 .

J. Daymude, Joshua, Zahra Derakhshandeh, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.”https://doi.org/10.1007/s11047-017-9658-6__Natural Computing, no. 1 (2018): 81--96.https://doi.org/10.1007/s11047-017-9658-6 .

N., N. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.

N., N. Gathering Strategien Für Mobile Roboterschwärme Im Gitternetz, 2018.

N., N. Decontaminating Planar Regions with Finite Automaton Robots and Tiles, 2018.

Wulfes, Robin. Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn, 2018.

Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, Christian Scheideler, and Thim Frederik Strothmann. “Forming Tile Shapes with Simple Robots.”https://doi.org/10.1007/978-3-030-00030-1_8__In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, 122–38. Springer International Publishing, 2018.https://doi.org/10.1007/978-3-030-00030-1_8 .

Blömer, Johannes, Jan Bobolz, Christian Scheideler, and Alexander Setzer. Provably Anonymous Communication Based on Trusted Execution Environments, n.d.

Scheideler, Christian. “Preface.”https://doi.org/10.1016/j.tcs.2018.11.004__Theor. Comput. Sci. 751 (2018): 1.https://doi.org/10.1016/j.tcs.2018.11.004 .

Scheideler, Christian. “Relays: Towards a Link Layer for Robust and Secure Fog Computing.”https://doi.org/10.1145/3229774.3229781__In Proceedings of the 2018 Workshop on Theory and Practice for Integrated Cloud, Fog and Edge Computing Paradigms, TOPIC@PODC 2018, Egham, United Kingdom, July 27, 2018, 1–2, 2018.https://doi.org/10.1145/3229774.3229781 .

Gmyr, Robert, Kristian Hinnenthal, Irina Kostitsyna, Fabian Kuhn, Dorian Rudolph, and Christian Scheideler. “Shape Recognition by a Finite Automaton Robot.”https://doi.org/10.4230/LIPIcs.MFCS.2018.52__In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 52:1-52:15, 2018.https://doi.org/10.4230/LIPIcs.MFCS.2018.52 .

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”https://doi.org/10.1007/978-3-030-03232-6_1__In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, Vol. 11201. Lecture Notes of Computer Science. Springer, Cham, 2018.https://doi.org/10.1007/978-3-030-03232-6_1 .

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Competitive Routing in Hybrid Communication Networks.” In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Springer, 2018.

Jung, Daniel, Christina Kolb, Christian Scheideler, and Jannik Sundermeier. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”https://doi.org/10.1145/3210377.3210663__In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM Press, 2018.https://doi.org/10.1145/3210377.3210663 .

Feldmann, Michael, Christina Kolb, and Christian Scheideler. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.”https://doi.org/10.1007/978-3-030-03232-6_2__In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 11201:16–31. Lecture Notes in Computer Science. Springer, Cham, 2018.https://doi.org/10.1007/978-3-030-03232-6_2 .

Benter, Markus, Till Knollmann, Friedhelm Meyer auf der Heide, Alexander Setzer, and Jannik Sundermeier. “A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.”https://doi.org/10.1007/978-3-030-19759-9_4__In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD), 2018.https://doi.org/10.1007/978-3-030-19759-9_4 .

Scheideler, Christian, and Alexander Setzer. “Relays: A New Approach for the Finite Departure Problem in Overlay Networks.”https://doi.org/10.1007/978-3-030-03232-6_16__In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 2018.https://doi.org/10.1007/978-3-030-03232-6_16 .

Götte, Thorsten, Christian Scheideler, and Alexander Setzer. “On Underlay-Aware Self-Stabilizing Overlay Networks.” In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), 11201:50–64. Lecture Notes in Computer Science. Springer, 2018.

Jochmaring, Moritz. Monotone Suchbarkeit Bei Den Selbststabilisierenden Protokollen Build-List Und Build-Multilist Mit Systemverlassenden Knoten. Universität Paderborn, 2018.

Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.”https://doi.org/10.1007/s00446-017-0307-1__Distributed Computing 31, no. 3 (2017): 241–54.https://doi.org/10.1007/s00446-017-0307-1 .

Burkhardt, Michél . Untersuchungen Zum Cone-Hashing. Universität Paderborn, 2017.

Banh, Ngoc Chi. An Asynchronous Adaption of a Churn-Resistant Overlay Network. Universität Paderborn, 2017.

Schenk, Andreas. Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen. Universität Paderborn, 2017.

Beckendorf, Björn. Visualisierung Zu Algorithmen Verteilter Netzwerksysteme. Universität Paderborn, 2017.

Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”https://doi.org/10.1016/j.ic.2016.12.006__Inf. Comput., 2017, 408--424.https://doi.org/10.1016/j.ic.2016.12.006 .

P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.”https://doi.org/10.1145/3106700.3106713__SIGACT News, no. 2 (2017): 87--94.https://doi.org/10.1145/3106700.3106713 .

Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Coating for Programmable Matter.”https://doi.org/10.1016/j.tcs.2016.02.039__Theor. Comput. Sci., 2017, 56--68.https://doi.org/10.1016/j.tcs.2016.02.039 .

J. Daymude, Joshua, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Improved Leader Election for Self-Organizing Programmable Matter.”https://doi.org/10.1007/978-3-319-72751-6_10__In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017, Vienna, Austria, September 7-8, 2017, Revised Selected Papers, 127--140, 2017.https://doi.org/10.1007/978-3-319-72751-6_10 .

Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, 2017.https://doi.org/10.1145/3087556 .

Luo, Linghui. MultiSkipList: A Self-Stabilizing Overlay Network with Monotonic Searchability Maintained. Universität Paderborn, 2017.

Scheideler, Christian, and Mohammad Taghi Hajiaghayi, eds. Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017. ACM, 2017.https://doi.org/10.1145/3087556 .

Strothmann, Thim Frederik. Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017.https://doi.org/10.17619/UNIPB/1-150 .

Sundermeier, Jannik. Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.

Knollmann, Till. A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017.

Götte, Thorsten. Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017.

Gmyr, Robert, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”https://doi.org/10.4230/LIPIcs.ICALP.2017.137__In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 137:1--137:15. Leibniz International Proceedings in Informatics (LIPIcs), 2017.https://doi.org/10.4230/LIPIcs.ICALP.2017.137 .

Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.”https://doi.org/10.1007/978-3-319-69084-1_17__In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 10616:250–64. Lecture Notes in Computer Science. Springer, Cham, 2017.https://doi.org/10.1007/978-3-319-69084-1_17 .

Drees, Maximilian, Robert Gmyr, and Christian Scheideler. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.”https://doi.org/10.1145/2935764.2935783__In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 417--427, 2016.https://doi.org/10.1145/2935764.2935783 .

Heuchler, Sebastian. Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.

Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.”https://doi.org/10.1109/TNET.2015.2410313__IEEE/ACM Trans. Netw., no. 3 (2016): 1421--1433.https://doi.org/10.1109/TNET.2015.2410313 .