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