M. Feldmann and C. Scheideler, “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), 2019, pp. 287--296.
LibreCat: /record/8534
DOI: 10.1145/3323165.3323193
arXiv: 1805.03472

J. Augustine et al., “Distributed Computation in Node-Capacitated Networks,” in Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures, 2019, pp. 69--79.
LibreCat: /record/8871
DOI: 10.1145/3323165.3323195

J. J. Daymude, K. Hinnenthal, A. W. Richa, and C. Scheideler, “Computing by Programmable Particles,” in Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–681.
LibreCat: /record/9599
DOI: https://doi.org/10.1007/978-3-030-11072-7_22

T. Götte, V. R. Vijayalakshmi, and C. 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), Rio de Janeiro, Brazil.
LibreCat: /record/6976

C. Scheideler and A. Setzer, “On the Complexity of Local Graph Transformations,” in Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132, pp. 150:1--150:14.
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

T. Götte, K. Hinnenthal, and C. Scheideler, “Faster Construction of Overlay Networks,” in Structural Information and Communication Complexity, 2019.
LibreCat: /record/12944
DOI: 10.1007/978-3-030-24922-9_18

J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,” in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–1299.
LibreCat: /record/15627
DOI: 10.1137/1.9781611975994.78

R. Gmyr, J. Lefevre, and C. Scheideler, “Self-Stabilizing Metric Graphs,” Theory Comput. Syst., vol. 63, no. 2, pp. 177–199, 2019.
LibreCat: /record/14830
DOI: 10.1007/s00224-017-9823-4

J. Castenow, C. Kolb, and C. Scheideler, “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), L’Aquila, Italy, 2019, pp. 345–348.
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

M. Feldmann, T. Götte, and C. Scheideler, “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), 2019, pp. 149–164.
LibreCat: /record/13182
DOI: https://doi.org/10.1007/978-3-030-34992-9_13
arXiv: 1909.04544

K. Hinnenthal, C. Scheideler, and M. Struijs, “Fast Distributed Algorithms for LP-Type Problems of Low Dimension,” in 33rd International Symposium on Distributed Computing (DISC 2019), 2019.
LibreCat: /record/13652
DOI: 10.4230/LIPICS.DISC.2019.23

J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, and P. Schneider, “Shortest Paths in a Hybrid Network Model,”10.1137/1.9781611975994.78__in Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, 2020, pp. 1280–1299, doi:10.1137/1.9781611975994.78 .
LibreCat: /record/27051
DOI: 10.1137/1.9781611975994.78

R. Gmyr et al., “Forming tile shapes with simple robots,” Nat. Comput., vol. 19, no. 2, pp. 375–390, 2020.
LibreCat: /record/17808
DOI: 10.1007/s11047-019-09774-2

M. Feldmann, K. Hinnenthal, and C. Scheideler, “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs,” in Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), 2020.
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

M. Feldmann, C. Scheideler, and S. Schmid, “Survey on Algorithms for Self-Stabilizing Overlay Networks,” ACM Computing Surveys, 2020.
LibreCat: /record/16902
DOI: 10.1145/3397190

M. Feldmann, A. Khazraei, and C. Scheideler, “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), 2020.
LibreCat: /record/16903
DOI: 10.1145/3350755.3400246
arXiv: 2005.07388

J. Castenow, C. Kolb, and C. 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), Kolkata, Indien.
LibreCat: /record/15169

J. J. Daymude, R. Gmyr, K. Hinnenthal, I. Kostitsyna, C. Scheideler, and A. W. Richa, “Convex Hull Formation for Programmable Matter,” in Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020.
LibreCat: /record/16346
DOI: 10.1145/3369740.3372916

S. Dolev, R. Prasadh Narayanan, C. Scheideler, and C. Schindelhauer, “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization,”10.1145/3477206.3477471__in NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471 .
LibreCat: /record/25105
DOI: 10.1145/3477206.3477471

M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,”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, 2021, vol. 13046, pp. 484–488, doi:10.1007/978-3-030-91081-5‑34 .
LibreCat: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

S. Dolev, R. Prasadh Narayanan, C. Scheideler, and C. Schindelhauer, “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization,”10.1145/3477206.3477471__in NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471 .
LibreCat: /record/27048
DOI: 10.1145/3477206.3477471

J. J. Daymude, A. W. Richa, and C. Scheideler, “The Canonical Amoebot Model: Algorithms and Concurrency Control,”10.4230/LIPIcs.DISC.2021.20__in 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), 2021, vol. 209, p. 20:1-20:19, doi:10.4230/LIPIcs.DISC.2021.20 .
LibreCat: /record/27050
DOI: 10.4230/LIPIcs.DISC.2021.20

T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,” in Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), Virtual.
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

S. Coy et al., “Near-Shortest Path Routing in Hybrid Communication Networks,”10.4230/LIPIcs.OPODIS.2021.11__in 25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, 2021, vol. 217, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11 .
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-And-Sleep: Message and Energy Efficient Set Cover,” in Algorithms for Sensor Systems (ALGOSENSORS ’21), Cham, 2021.
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

M. Feldmann, A. Padalkin, C. Scheideler, and S. Dolev, “Coordinating Amoebots via Reconfigurable Circuits,”10.1089/cmb.2021.0363__J. Comput. Biol., vol. 29, no. 4, pp. 317–343, 2022, doi:10.1089/cmb.2021.0363 .
LibreCat: /record/31060
DOI: 10.1089/cmb.2021.0363

A. Padalkin, C. Scheideler, and D. Warner, “The Structural Power of Reconfigurable Circuits in the Amoebot Model,”10.4230/LIPIcs.DNA.28.8__in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8 .
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

I. Kostitsyna, C. Scheideler, and D. Warner, “Fault-Tolerant Shape Formation in the Amoebot Model,”10.4230/LIPIcs.DNA.28.9__in 28th International Conference on DNA Computing and Molecular Programming (DNA 28), 2022, vol. 238, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9 .
LibreCat: /record/32603
DOI: 10.4230/LIPIcs.DNA.28.9

J. J. Daymude, A. W. Richa, and C. Scheideler, “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems,”10.4230/LIPIcs.SAND.2022.12__in 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, 2022, vol. 221, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12 .
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

T. Götte and C. Scheideler, “Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion,”10.1145/3490148.3538556__in SPAA ’22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, 2022, pp. 99–101, doi:10.1145/3490148.3538556 .
LibreCat: /record/33240
DOI: 10.1145/3490148.3538556

I. Kostitsyna, C. Scheideler, and D. Warner, “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model,”10.4230/LIPIcs.SAND.2022.23__in 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), 2022, vol. 221, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23 .
LibreCat: /record/30987
DOI: 10.4230/LIPIcs.SAND.2022.23

M. Aguiliera, A. W. Richa, A. A. Schwarzmann, A. Panconesi, C. Scheideler, and P. Woelfel, “Edsger W. Dijkstra Prize in Distributed Computing,”10.1145/3519270.3538411__in PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, 2022, p. 1, doi:10.1145/3519270.3538411 .
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

T. Knollmann and C. Scheideler, “A self-stabilizing Hashed Patricia Trie,”10.1016/j.ic.2021.104697__Information and Computation, Art. no. 104697, 2022, doi:10.1016/j.ic.2021.104697 .
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

T. Götte, C. Kolb, C. Scheideler, and J. Werthmann, “Beep-and-Sleep: Message and Energy Efficient Set Cover,”10.1016/j.tcs.2023.113756__Theor. Comput. Sci., vol. 950, p. 113756, 2023, doi:10.1016/j.tcs.2023.113756 .
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

J. Werthmann, C. Scheideler, S. Coy, A. Czumaj, and P. Schneider, “Routing Schemes for Hybrid Communication Networks,”10.48550/ARXIV.2210.05333__2023, doi:10.48550/ARXIV.2210.05333 .
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

J. Dou, T. Götte, H. Hillebrandt, C. Scheideler, and J. Werthmann, “Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs,” presented at the ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA, 2023.
LibreCat: /record/45193

T. Götte, K. Hinnenthal, C. Scheideler, and J. Werthmann, “Time-Optimal Construction of Overlays,”https://doi.org/10.1007/s00446-023-00442-4__Distributed Computing, 2023, doi:https://doi.org/10.1007/s00446-023-00442-4 .
LibreCat: /record/45192
DOI: https://doi.org/10.1007/s00446-023-00442-4

T. Götte, T. Knollmann, F. Meyer auf der Heide, C. Scheideler, and J. Werthmann, “Capabilities and Limitations of Local Strategies in Dynamic Networks,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20.
LibreCat: /record/45875
DOI: 10.5281/zenodo.8060372

J. Blömer, F. Eidens, T. Jager, D. Niehues, and C. Scheideler, “Robustness and Security,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–164.
LibreCat: /record/45891
DOI: 10.5281/zenodo.8068629