Dorociak, S. (2024). Implementierung eines Algorithmus zur motivbasierten Schnitt-Sparsifizierung.
LibreCat: /record/52318

De Groote, C. (2024). A Dispersion Algorithm for Robot Swarms Inside Polygonal Boundary Shapes.
LibreCat: /record/53374

Doddegowda, R. (2024). Optimal Drone Strategies For Packet Delivery.
LibreCat: /record/53373

Thakur, H. (2024). Evaluating the Implications.
LibreCat: /record/53372

Götte, T., Kolb, C., Scheideler, C., &; Werthmann, J. (2023). Beep-and-Sleep: Message and Energy Efficient Set Cover. Theor. Comput. Sci., 950, 113756.https://doi.org/10.1016/j.tcs.2023.113756 
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

Schweichhart, J. (2023). Minimum Edge Cuts in Overlay Networks.
LibreCat: /record/44735

Werthmann, J., Scheideler, C., Coy, S., Czumaj, A., &; Schneider, P. (2023). Routing Schemes for Hybrid Communication Networks.https://doi.org/10.48550/ARXIV.2210.05333 
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

Schneider, F. (2023). Utilizing Redundancy in Distributed Heterogeneous Storage.
LibreCat: /record/46053

Ranade, A. (2023). Graph Neural Network-based Anomaly Detection in  Smart Grid Energy Consumption.
LibreCat: /record/46087

Ali, O. (2023). Highly accurate deep compressed facial recognition.
LibreCat: /record/46086

Ashri, N. (2023). Virtual On-Demand Volunteer System Based on Delaunay Triangulation.
LibreCat: /record/46110

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

Deppe, V. (2023). Routing in Hypergraphs.
LibreCat: /record/47134

Decking, L. (2023). Zuweisung verteilter Speicher unter Maximierung der minimalen gewichteten Bandbreite.
LibreCat: /record/48430

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

Telaprolu, V. (2023). Reconstruction of 3D Surfels from Neural Radiance Fields.
LibreCat: /record/49493

Friemel, J. (2023). Shape Reconfiguration by Hybrid Programmable Matter.
LibreCat: /record/49492

Beckendorf, B. (2023). Self-Stabilizing Skip-Graph with Growth-bounded Metric.
LibreCat: /record/52317

Roopa, R. (2022). Evaluation of Algorithms for the Node Capacitated Clique.
LibreCat: /record/30152

Korzeczek, S. (2022). Aufarbeitung und lmplementierung von DAG-Rider.
LibreCat: /record/30198

Nachtigall, M. (2022). Hybrid Routing in Three Dimensions.
LibreCat: /record/30199

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 
LibreCat: /record/31060
DOI: 10.1089/cmb.2021.0363

Hillebrandt, H. (2022). Verteiltes Berechnen kompakter Routingtabellen in Unit Disk Graphen.
LibreCat: /record/31947

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 
LibreCat: /record/32602
DOI: 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 
LibreCat: /record/32603
DOI: 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 
LibreCat: /record/33230
DOI: 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 
LibreCat: /record/33240
DOI: 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 
LibreCat: /record/30987
DOI: 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 
LibreCat: /record/33967
DOI: 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.
LibreCat: /record/33968

Kolb, C. (2022). Competitive Routing in Hybrid Communications Networks and Message efficient SetCover in AdHoc Networks.https://doi.org/10.17619/UNIPB/1-1673  
LibreCat: /record/30239
DOI: 10.17619/UNIPB/1-1673 

Knollmann, T., &; Scheideler, C. (2022). A self-stabilizing Hashed Patricia Trie. Information and Computation, Article 104697.https://doi.org/10.1016/j.ic.2021.104697 
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Hinnenthal, K. (2021). Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter.https://doi.org/10.17619/UNIPB/1-1169  
LibreCat: /record/24887
DOI: 10.17619/UNIPB/1-1169 

Liedtke, D. J. (2021). Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.
LibreCat: /record/25126

Feldmann, M., Padalkin, A., Scheideler, C., &; Dolev, S. (2021). Coordinating Amoebots via Reconfigurable Circuits. In C. Johnen, E. Michael Schiller, &; S. Schmid (Eds.), Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings (Vol. 13046, pp. 484–488). Springer.https://doi.org/10.1007/978-3-030-91081-5‑34 
LibreCat: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

Suermann, D. (2021). Schutz und Stabilisierung von Overlay-Netzwerken mithilfe des Relay-Layers.
LibreCat: /record/28998

Everling, L. (2021). Selbststabilisierender Bakery Algorithmus für verteilte Systeme.
LibreCat: /record/27053

Adsul, V. (2021). Peer-to-Peer Matching for Distributed Systems.
LibreCat: /record/27072

Werthmann, J. (2021). Derandomization and Local Graph Problems in the Node-Capacitated Clique.
LibreCat: /record/21084

Mengshi, M. (2021). Self-stabilizing Arrow Protocol on Spanning Trees with a Low Diameter.
LibreCat: /record/21197

Liedtke, D. (2021). Exploration and Convex Hull Construction in the Three-Dimensional Hybrid Model.
LibreCat: /record/21627

Feldmann, M. (2021). Algorithms for Distributed Data Structures and Self-Stabilizing Overlay Networks.https://doi.org/10.17619/UNIPB/1-1113 
LibreCat: /record/21628
DOI: 10.17619/UNIPB/1-1113

Coy, S., Czumaj, A., Feldmann, M., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P., &; Struijs, M. (2021). Near-Shortest Path Routing in Hybrid Communication Networks. In Q. Bramas, V. Gramoli, &; A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France (Vol. 217, p. 11:1–11:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2021.11 
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

Yeole, P. K. (2020). Plurality Consensus in Hybrid Networks.
LibreCat: /record/20221

Werneck Richa, A., &; Scheideler, C. (Eds.). (2020). Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings (Vol. 12156). Springer.https://doi.org/10.1007/978-3-030-54921-3 
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

Scheideler, C., &; Spear, M. (Eds.). (2020). SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. ACM.https://doi.org/10.1145/3350755 
LibreCat: /record/17839
DOI: 10.1145/3350755

Jochmaring, M. (2020). A self stabilizing protocol for well-formed trees in hybrid networks.
LibreCat: /record/20495

Feldmann, M., Hinnenthal, K., &; Scheideler, C. (2020). Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2020.31 
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

Skowronek, M. (2020). Approaches for Competetive Routing through Intersections of Hole Abstractions in Hybrid Communication Networks. Universität Paderborn.
LibreCat: /record/18066

Setzer, A. (2020). Local Graph Transformation Primitives For Some Basic Problems In Overlay Networks. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-1026 
LibreCat: /record/18520
DOI: 10.17619/UNIPB/1-1026

Guggenmos, A. (2020). Algorithmen für selbststabilisierende Skip+-Delaunaygraphen. Universität Paderborn.
LibreCat: /record/18648

Feldmann, M., Scheideler, C., &; Schmid, S. (2020). Survey on Algorithms for Self-Stabilizing Overlay Networks. ACM Computing Surveys.https://doi.org/10.1145/3397190 
LibreCat: /record/16902
DOI: 10.1145/3397190

Feldmann, M., Khazraei, A., &; Scheideler, C. (2020). Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM.https://doi.org/10.1145/3350755.3400246 
LibreCat: /record/16903
DOI: 10.1145/3350755.3400246
arXiv: 2005.07388

Warner, D. (2020). On the complexity of local transformations in SDN overlays. Universität Paderborn.
LibreCat: /record/15770

Castenow, J., Kolb, C., &; Scheideler, C. (n.d.). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN). Kolkata, Indien: ACM.
LibreCat: /record/15169

N., N. (2019). Scalable Multi Objective Path Optimization for Multi-Laser Selective Laser Melting Scanning Systems.
LibreCat: /record/17809

Feldmann, M., &; Scheideler, C. (2019). Skeap &; Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 287--296). ACM.https://doi.org/10.1145/3323165.3323193 
LibreCat: /record/8534
DOI: 10.1145/3323165.3323193
arXiv: 1805.03472

Augustine, J., Ghaffari, M., Gmyr, R., Hinnenthal, K., Kuhn, F., Li, J., &; Scheideler, C. (2019). Distributed Computation in Node-Capacitated Networks. In Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures (pp. 69--79). ACM.https://doi.org/10.1145/3323165.3323195 
LibreCat: /record/8871
DOI: 10.1145/3323165.3323195

Götte, T., Vijayalakshmi, V. R., &; Scheideler, C. (n.d.). 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). Rio de Janeiro, Brazil: IEEE.
LibreCat: /record/6976

Scheideler, C., &; Setzer, A. (2019). On the Complexity of Local Graph Transformations. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (Vol. 132, pp. 150:1--150:14). Patras, Greece: Dagstuhl Publishing.https://doi.org/10.4230/LIPICS.ICALP.2019.150 
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

Scheideler, C., &; Berenbrink, P. (Eds.). (2019). The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM.https://doi.org/10.1145/3323165 
LibreCat: /record/14829
DOI: 10.1145/3323165

Gmyr, R., Lefevre, J., &; Scheideler, C. (2019). Self-Stabilizing Metric Graphs. Theory Comput. Syst., 63(2), 177–199.https://doi.org/10.1007/s00224-017-9823-4 
LibreCat: /record/14830
DOI: 10.1007/s00224-017-9823-4

Castenow, J., Kolb, C., &; Scheideler, C. (2019). A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 345–348). L’Aquila, Italy.https://doi.org/10.1007/978-3-030-24922-9‑26 
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Feldmann, M., Götte, T., &; Scheideler, C. (2019). A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory. In Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 149–164). Springer, Cham.https://doi.org/10.1007/978-3-030-34992-9_13 
LibreCat: /record/13182
DOI: https://doi.org/10.1007/978-3-030-34992-9_13
arXiv: 1909.04544

N., N. (2019). Implementation and Evaluation of Authenticated Data Structures Using Intel SGX Enclaves. Universität Paderborn.
LibreCat: /record/10271

Hinnenthal, K., Scheideler, C., &; Struijs, M. (2019). Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium on Distributed Computing (DISC 2019).https://doi.org/10.4230/LIPICS.DISC.2019.23 
LibreCat: /record/13652
DOI: 10.4230/LIPICS.DISC.2019.23

Robinson, P., Scheideler, C., &; Setzer, A. (n.d.). Breaking the $\'4fmega(\'73qrtn)$ Barrier: Fast Consensus under a Late Adversary. In Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien.https://doi.org/10.1145/3210377.3210399 
LibreCat: /record/3422
DOI: 10.1145/3210377.3210399

Scheideler, C., &; Fineman, J. T. (Eds.). (2018). Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. Vienna, Austria: ACM.
LibreCat: /record/3874

Gmyr, R. (2018). Distributed Algorithms for Overlay Networks and Programmable Matter. Universität Paderborn.https://doi.org/10.17619/UNIPB/1-265 
LibreCat: /record/1138
DOI: 10.17619/UNIPB/1-265

Feldmann, M., Kolb, C., Scheideler, C., &; Strothmann, T. F. (2018). Self-Stabilizing Supervised Publish-Subscribe Systems. In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). Vancouver: IEEE.https://doi.org/10.1109/IPDPS.2018.00114 
LibreCat: /record/1163
DOI: 10.1109/IPDPS.2018.00114
arXiv: 1710.08128

Feldmann, M., Scheideler, C., &; Setzer, A. (2018). Skueue: A Scalable and Sequentially Consistent Distributed Queue. In Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS). Vancouver: IEEE.https://doi.org/10.1109/IPDPS.2018.00113 
LibreCat: /record/1164
DOI: 10.1109/IPDPS.2018.00113
arXiv: 1802.07504

J. Daymude, J., Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2018). On the runtime of universal coating for programmable matter. Natural Computing, (1), 81--96.https://doi.org/10.1007/s11047-017-9658-6 
LibreCat: /record/1796
DOI: 10.1007/s11047-017-9658-6

N., N. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.
LibreCat: /record/18030

N., N. (2018). Gathering Strategien für mobile Roboterschwärme im Gitternetz.
LibreCat: /record/18031

N., N. (2018). Decontaminating Planar Regions with Finite Automaton Robots and Tiles.
LibreCat: /record/18032

Wulfes, R. (2018). Load-Balanced Routing in Hybriden Kommunikationsnetzwerken. Universität Paderborn.
LibreCat: /record/18033

Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., &; Strothmann, T. F. (2018). Forming Tile Shapes with Simple Robots. In Proceedings of the 24th International Conference on DNA Computing and Molecular Programming (pp. 122–138). Springer International Publishing.https://doi.org/10.1007/978-3-030-00030-1_8 
LibreCat: /record/5764
DOI: 10.1007/978-3-030-00030-1_8

Blömer, J., Bobolz, J., Scheideler, C., &; Setzer, A. (n.d.). Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat: /record/5820

Scheideler, C. (2018). Preface. Theor. Comput. Sci., 751, 1.https://doi.org/10.1016/j.tcs.2018.11.004 
LibreCat: /record/5984
DOI: 10.1016/j.tcs.2018.11.004

Scheideler, C. (2018). Relays: Towards a Link Layer for Robust and Secure Fog Computing. 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 (pp. 1–2).https://doi.org/10.1145/3229774.3229781 
LibreCat: /record/5985
DOI: 10.1145/3229774.3229781

Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., &; Scheideler, C. (2018). Shape Recognition by a Finite Automaton Robot. In 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK (pp. 52:1-52:15).https://doi.org/10.4230/LIPIcs.MFCS.2018.52 
LibreCat: /record/5986
DOI: 10.4230/LIPIcs.MFCS.2018.52

Knollmann, T., &; Scheideler, C. (2018). A Self-Stabilizing Hashed Patricia Trie. In T. Izumi &; P. Kuznetsov (Eds.), Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201). Tokyo: Springer, Cham.https://doi.org/10.1007/978-3-030-03232-6_1 
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

Jung, D., Kolb, C., Scheideler, C., &; Sundermeier, J. (2018). Competitive Routing in Hybrid Communication Networks. In Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) . Helsinki: Springer.
LibreCat: /record/4563

Jung, D., Kolb, C., Scheideler, C., &; Sundermeier, J. (2018). Brief Announcement: Competitive Routing in Hybrid Communication Networks. In Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA). Wien: ACM Press.https://doi.org/10.1145/3210377.3210663 
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Feldmann, M., Kolb, C., &; Scheideler, C. (2018). Self-stabilizing Overlays for high-dimensional Monotonic Searchability. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 11201, pp. 16–31). Springer, Cham.https://doi.org/10.1007/978-3-030-03232-6_2 
LibreCat: /record/4351
DOI: 10.1007/978-3-030-03232-6_2
arXiv: 1808.10300

Benter, M., Knollmann, T., Meyer auf der Heide, F., Setzer, A., &; Sundermeier, J. (2018). A Peer-to-Peer based Cloud Storage supporting orthogonal Range Queries of arbitrary Dimension. In Proceedings of the 4th International Symposium on Algorithmic Aspects of Cloud Computing (ALGOCLOUD). Helsinki.https://doi.org/10.1007/978-3-030-19759-9_4 
LibreCat: /record/4375
DOI: 10.1007/978-3-030-19759-9_4

Scheideler, C., &; Setzer, A. (2018). Relays: A New Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018). Tokyo, Japan.https://doi.org/10.1007/978-3-030-03232-6_16 
LibreCat: /record/5216
DOI: 10.1007/978-3-030-03232-6_16

Götte, T., Scheideler, C., &; Setzer, A. (2018). On Underlay-Aware Self-Stabilizing Overlay Networks. In Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018) (Vol. 11201, pp. 50–64). Tokyo, Japan: Springer.
LibreCat: /record/5222

Jochmaring, M. (2018). Monotone Suchbarkeit bei den selbststabilisierenden Protokollen Build-List und Build-Multilist mit systemverlassenden Knoten. Universität Paderborn.
LibreCat: /record/5368

Ogierman, A., Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3), 241–254.https://doi.org/10.1007/s00446-017-0307-1 
LibreCat: /record/3872
DOI: 10.1007/s00446-017-0307-1

Burkhardt, M. (2017). Untersuchungen zum Cone-Hashing. Universität Paderborn.
LibreCat: /record/18026

Banh, N. C. (2017). An Asynchronous Adaption of a Churn-resistant Overlay Network. Universität Paderborn.
LibreCat: /record/18027

Schenk, A. (2017). Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn.
LibreCat: /record/18028

Beckendorf, B. (2017). Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn.
LibreCat: /record/18029

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. Inf. Comput., 408--424.https://doi.org/10.1016/j.ic.2016.12.006 
LibreCat: /record/1812
DOI: 10.1016/j.ic.2016.12.006

P. Fekete, S., W. Richa, A., Römer, K., &; Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News, (2), 87--94.https://doi.org/10.1145/3106700.3106713 
LibreCat: /record/1813
DOI: 10.1145/3106700.3106713

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2017). Universal coating for programmable matter. Theor. Comput. Sci., 56--68.https://doi.org/10.1016/j.tcs.2016.02.039 
LibreCat: /record/1814
DOI: 10.1016/j.tcs.2016.02.039

J. Daymude, J., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2017). Improved Leader Election for Self-organizing Programmable Matter. 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 (pp. 127--140).https://doi.org/10.1007/978-3-319-72751-6_10 
LibreCat: /record/1815
DOI: 10.1007/978-3-319-72751-6_10

Scheideler, C., &; Taghi Hajiaghayi, M. (Eds.). (2017). Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017.https://doi.org/10.1145/3087556 
LibreCat: /record/1820
DOI: 10.1145/3087556

Luo, L. (2017). MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn.
LibreCat: /record/81