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

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

Dou, J., Götte, T., Hillebrandt, H., Scheideler, C., &; Werthmann, J. (2023). Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs. Proc. of the 42nd ACM Symposium on Principles of Distributed Computing (PODC ’23). ACM Symposium on Principles of Distributed Computing (PODC), Orlando, USA.
LibreCat: /record/45193

Götte, T., Hinnenthal, K., Scheideler, C., &; Werthmann, J. (2023). Time-Optimal Construction of Overlays. Distributed Computing.https://doi.org/10.1007/s00446-023-00442-4 
LibreCat: /record/45192
DOI: https://doi.org/10.1007/s00446-023-00442-4

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

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

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

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

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

Dolev, S., Prasadh Narayanan, R., Scheideler, C., &; Schindelhauer, C. (2021). Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, &; B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 (p. 30:1-30:2). ACM.https://doi.org/10.1145/3477206.3477471 
LibreCat: /record/25105
DOI: 10.1145/3477206.3477471

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

Dolev, S., Prasadh Narayanan, R., Scheideler, C., &; Schindelhauer, C. (2021). Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization. In L. Galluccio, U. Mitra, M. Magarini, S. Abada, M. Taynnan Barros, &; B. Krishnaswamy (Eds.), NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021 (p. 30:1-30:2). ACM.https://doi.org/10.1145/3477206.3477471 
LibreCat: /record/27048
DOI: 10.1145/3477206.3477471

J. Daymude, J., W. Richa, A., &; Scheideler, C. (2021). The Canonical Amoebot Model: Algorithms and Concurrency Control. In S. Gilbert (Ed.), 35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference) (Vol. 209, p. 20:1-20:19). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.DISC.2021.20 
LibreCat: /record/27050
DOI: 10.4230/LIPIcs.DISC.2021.20

Götte, T., Hinnenthal, K., Scheideler, C., &; Werthmann, J. (n.d.). Time-Optimal Construction of Overlays. In K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21). New York: ACM.https://doi.org/10.1145/3465084.3467932 
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

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

Götte, T., Kolb, C., Scheideler, C., &; Werthmann, J. (2021). Beep-And-Sleep: Message and Energy Efficient Set Cover. In Algorithms for Sensor Systems (ALGOSENSORS ’21). ALGOSENSORS 2021, Lisbon, Portgual.https://doi.org/10.1007/978-3-030-89240-1_7 
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &; Schneider, P. (2020). Shortest Paths in a Hybrid Network Model. In S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020 (pp. 1280–1299). SIAM.https://doi.org/10.1137/1.9781611975994.78 
LibreCat: /record/27051
DOI: 10.1137/1.9781611975994.78

Gmyr, R., Hinnenthal, K., Kostitsyna, I., Kuhn, F., Rudolph, D., Scheideler, C., &; Strothmann, T. (2020). Forming tile shapes with simple robots. Nat. Comput., 19(2), 375–390.https://doi.org/10.1007/s11047-019-09774-2 
LibreCat: /record/17808
DOI: 10.1007/s11047-019-09774-2

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

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

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

Daymude, J. J., Gmyr, R., Hinnenthal, K., Kostitsyna, I., Scheideler, C., &; Richa, A. W. (2020). Convex Hull Formation for Programmable Matter. In Proceedings of the 21st International Conference on Distributed Computing and Networking.https://doi.org/10.1145/3369740.3372916 
LibreCat: /record/16346
DOI: 10.1145/3369740.3372916

Luo, L., Scheideler, C., &; Strothmann, T. F. (2019). MultiSkipGraph: A Self-stabilizing Overlay Network that Maintains Monotonic Searchability. In Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19). Rio de Janeiro, Brazil.
LibreCat: /record/7636

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

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

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

Götte, T., Hinnenthal, K., &; Scheideler, C. (2019). Faster Construction of Overlay Networks. In Structural Information and Communication Complexity. Cham.https://doi.org/10.1007/978-3-030-24922-9_18 
LibreCat: /record/12944
DOI: 10.1007/978-3-030-24922-9_18

Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., &; Schneider, P. (2019). Shortest Paths in a Hybrid Network Model. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1280–1299). Philadelphia, PA.https://doi.org/10.1137/1.9781611975994.78 
LibreCat: /record/15627
DOI: 10.1137/1.9781611975994.78

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

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

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

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

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

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

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

Gmyr, R., Hinnenthal, K., Scheideler, C., &; Sohler, C. (2017). Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP) (pp. 137:1--137:15).https://doi.org/10.4230/LIPIcs.ICALP.2017.137 
LibreCat: /record/105
DOI: 10.4230/LIPIcs.ICALP.2017.137

Feldmann, M., &; Scheideler, C. (2017). A Self-Stabilizing General De Bruijn Graph. In Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (Vol. 10616, pp. 250–264). Springer, Cham.https://doi.org/10.1007/978-3-319-69084-1_17 
LibreCat: /record/125
DOI: 10.1007/978-3-319-69084-1_17
arXiv: 1708.06542

Drees, M., Gmyr, R., &; Scheideler, C. (2016). Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 417--427).https://doi.org/10.1145/2935764.2935783 
LibreCat: /record/215
DOI: 10.1145/2935764.2935783

Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., &; Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw., (3), 1421--1433.https://doi.org/10.1109/TNET.2015.2410313 
LibreCat: /record/1835
DOI: 10.1109/TNET.2015.2410313

Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp. 148--164).https://doi.org/10.1007/978-3-319-43994-5_10 
LibreCat: /record/1836
DOI: 10.1007/978-3-319-43994-5_10

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016 (pp. 289--299). ACM.https://doi.org/10.1145/2935764.2935784 
LibreCat: /record/1837
DOI: 10.1145/2935764.2935784

W. Richa, A., &; Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In Encyclopedia of Algorithms (pp. 999--1002).https://doi.org/10.1007/978-1-4939-2864-4_593 
LibreCat: /record/1845
DOI: 10.1007/978-1-4939-2864-4_593

Gmyr, R., Lefèvre, J., &; Scheideler, C. (2016). Self-stabilizing Metric Graphs. In Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 248--262).https://doi.org/10.1007/978-3-319-49259-9_20 
LibreCat: /record/155
DOI: 10.1007/978-3-319-49259-9_20

Scheideler, C., Setzer, A., &; Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In Proceedings of the 30th International Symposium on Distributed Computing (DISC) (pp. 71--84).https://doi.org/10.1007/978-3-662-53426-7_6 
LibreCat: /record/142
DOI: 10.1007/978-3-662-53426-7_6

Eikel, M., &; Scheideler, C. (2015). IRIS: A Robust Information System Against Insider DoS Attacks. Transactions on Parallel Computing, (3), 18:1--18:33.https://doi.org/10.1145/2809806 
LibreCat: /record/284
DOI: 10.1145/2809806

Scheideler, C., Setzer, A., &; Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS).https://doi.org/10.4230/LIPIcs.OPODIS.2015.24 
LibreCat: /record/241
DOI: 10.4230/LIPIcs.OPODIS.2015.24

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 201–216).https://doi.org/10.1007/978-3-319-21741-3_14 
LibreCat: /record/242
DOI: 10.1007/978-3-319-21741-3_14

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2015). A deterministic worst-case message complexity optimal solution for resource discovery. Theoretical Computer Science, 67–79.https://doi.org/10.1016/j.tcs.2014.11.027 
LibreCat: /record/327
DOI: 10.1016/j.tcs.2014.11.027

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. In DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings (Vol. 9211, pp. 117--132).https://doi.org/10.1007/978-3-319-21999-8_8 
LibreCat: /record/1850
DOI: 10.1007/978-3-319-21999-8_8

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015 (pp. 21:1--21:2). ACM.https://doi.org/10.1145/2800795.2800829 
LibreCat: /record/1851
DOI: 10.1145/2800795.2800829

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\rquote an, Spain, July 21 - 23, 2015 (pp. 67--69). ACM.https://doi.org/10.1145/2767386.2767451 
LibreCat: /record/1852
DOI: 10.1145/2767386.2767451

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 (pp. 77--79). ACM.https://doi.org/10.1145/2755573.2755614 
LibreCat: /record/1853
DOI: 10.1145/2755573.2755614

Scheideler, C., Setzer, A., &; Eikel, M. (2014). RoBuSt: A Crash-Failure-Resistant Distributed Storage System. In Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS) (pp. 107--122).https://doi.org/10.1007/978-3-319-14472-6_8 
LibreCat: /record/371
DOI: 10.1007/978-3-319-14472-6_8

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2014). Re-Chord: A Self-stabilizing Chord Overlay Network. Theory of Computing Systems, (3), 591–612.https://doi.org/10.1007/s00224-012-9431-2 
LibreCat: /record/378
DOI: 10.1007/s00224-012-9431-2

Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. Transactions on Algorithms, (4).https://doi.org/10.1145/2635818 
LibreCat: /record/387
DOI: 10.1145/2635818

Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2014). SKIP*: A Self-Stabilizing Skip Graph. J. ACM, (6), 36:1--36:26.https://doi.org/10.1145/2629695 
LibreCat: /record/1858
DOI: 10.1145/2629695

Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable matter. In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014 (pp. 220--222). ACM.https://doi.org/10.1145/2612669.2612712 
LibreCat: /record/1863
DOI: 10.1145/2612669.2612712

Ogierman, A., Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2014). Competitive MAC under adversarial SINR. In Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM) (pp. 2751--2759).https://doi.org/10.1109/INFOCOM.2014.6848224 
LibreCat: /record/446
DOI: 10.1109/INFOCOM.2014.6848224

Kniesburges, S., Markarian, C., Meyer auf der Heide, F., &; Scheideler, C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO) (pp. 1–13).https://doi.org/10.1007/978-3-319-09620-9_1 
LibreCat: /record/459
DOI: 10.1007/978-3-319-09620-9_1

Gall, D., Jacob, R., Richa, A. W., Scheideler, C., Schmid, S., &; Täubig, H. (2014). A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory of Computing Systems, (1), 110–135.https://doi.org/10.1007/s00224-013-9504-x 
LibreCat: /record/464
DOI: 10.1007/s00224-013-9504-x

Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &; Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (pp. 48--62).https://doi.org/10.1007/978-3-319-11764-5_4 
LibreCat: /record/393
DOI: 10.1007/978-3-319-11764-5_4

Scheideler, C., Eikel, M., &; Setzer, A. (2014). Minimum Linear Arrangement of Series-Parallel Graphs. In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA) (pp. 168--180).
LibreCat: /record/397

Feldotto, M., Scheideler, C., &; Graffi, K. (2014). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. In Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P) (pp. 1–10).https://doi.org/10.1109/P2P.2014.6934300 
LibreCat: /record/412
DOI: 10.1109/P2P.2014.6934300
arXiv: 1408.0395

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2013). Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Computing, (3), 159--171.https://doi.org/10.1007/s00446-012-0180-x 
LibreCat: /record/1868
DOI: 10.1007/s00446-012-0180-x

Mohd Nor, R., Nesterenko, M., &; Scheideler, C. (2013). Corona:  A stabilizing deterministic message-passing skip list. Theor. Comput. Sci., 119--129.https://doi.org/10.1016/j.tcs.2012.08.029 
LibreCat: /record/1870
DOI: 10.1016/j.tcs.2012.08.029

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2013). An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Trans. Netw., (3), 760--771.https://doi.org/10.1109/TNET.2012.2210241 
LibreCat: /record/1871
DOI: 10.1109/TNET.2012.2210241

Kolman, P., &; Scheideler, C. (2013). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. Theory of Computing Systems, (2), 341–363.https://doi.org/10.1007/s00224-013-9454-3 
LibreCat: /record/476
DOI: 10.1007/s00224-013-9454-3

Avin, C., Häupler, B., Lotker, Z., Scheideler, C., &; Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406).https://doi.org/10.1109/IPDPS.2013.40 
LibreCat: /record/513
DOI: 10.1109/IPDPS.2013.40

Eikel, M., &; Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 119–129).https://doi.org/10.1145/2486159.2486186 
LibreCat: /record/519
DOI: 10.1145/2486159.2486186

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In Proceedings of the 27th International Symposium on Distributed Computing (DISC) (pp. 537–549).https://doi.org/10.1007/978-3-642-41527-2_37 
LibreCat: /record/542
DOI: 10.1007/978-3-642-41527-2_37

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2013). A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) (pp. 165–176).https://doi.org/10.1007/978-3-319-03578-9_14 
LibreCat: /record/564
DOI: 10.1007/978-3-319-03578-9_14

Dolev, S., &; Scheideler, C. (2012). Editorial for Algorithmic Aspects of Wireless Sensor Networks. Theor. Comput. Sci., 1.https://doi.org/10.1016/j.tcs.2012.07.012 
LibreCat: /record/1882
DOI: 10.1016/j.tcs.2012.07.012

Monien, B., &; Scheideler, C. (2012). Selfish Distributed Optimization. In Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings (Vol. 7484, pp. 1--2). Springer.https://doi.org/10.1007/978-3-642-32820-6_1 
LibreCat: /record/1884
DOI: 10.1007/978-3-642-32820-6_1

Jacob, R., Ritscher, S., Scheideler, C., &; Schmid, S. (2012). Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs. Theoretical Computer Science, 137–148.https://doi.org/10.1016/j.tcs.2012.07.029 
LibreCat: /record/570
DOI: 10.1016/j.tcs.2012.07.029

Clouser, T., Nesterenko, M., &; Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. Theoretical Computer Science, 18–35.https://doi.org/10.1016/j.tcs.2011.12.079 
LibreCat: /record/574
DOI: 10.1016/j.tcs.2011.12.079

Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., &; Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. Transactions on Algorithms, (3), 30.https://doi.org/10.1145/2229163.2229174 
LibreCat: /record/579
DOI: 10.1145/2229163.2229174

Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &; Scheideler, C. (2012). Self-Organizing Particle Systems. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1272–1283).https://doi.org/10.1109/IPDPS.2012.116 
LibreCat: /record/581
DOI: 10.1109/IPDPS.2012.116

Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300).https://doi.org/10.1145/2332432.2332488 
LibreCat: /record/623
DOI: 10.1145/2332432.2332488

Schmid, S., Avin, C., Scheideler, C., Häupler, B., &; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440).https://doi.org/10.1007/978-3-642-33651-5_47 
LibreCat: /record/625
DOI: 10.1007/978-3-642-33651-5_47

Kniesburges, S., &; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 435–436).https://doi.org/10.1007/978-3-642-33651-5_45 
LibreCat: /record/626
DOI: 10.1007/978-3-642-33651-5_45

Kolman, P., &; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA) (pp. 800–810).https://doi.org/10.1137/1.9781611973099.64 
LibreCat: /record/632
DOI: 10.1137/1.9781611973099.64

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 1261--1271).https://doi.org/10.1109/IPDPS.2012.115 
LibreCat: /record/640
DOI: 10.1109/IPDPS.2012.115

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 (pp. 507--516). IEEE Computer Society.https://doi.org/10.1109/ICDCS.2011.8 
LibreCat: /record/1891
DOI: 10.1109/ICDCS.2011.8

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, @MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM.https://doi.org/10.1145/2030686.2030697 
LibreCat: /record/1892
DOI: 10.1145/2030686.2030697

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM.https://doi.org/10.1145/2107502.2107522 
LibreCat: /record/1893
DOI: 10.1145/2107502.2107522

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244).https://doi.org/10.1145/1989493.1989527 
LibreCat: /record/1895
DOI: 10.1145/1989493.1989527

Kniesburges, S., &; Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer.https://doi.org/10.1007/978-3-642-19094-0_18 
LibreCat: /record/1899
DOI: 10.1007/978-3-642-19094-0_18

Scheideler, C., &; Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In Computer Science, The Hardware, Software and Heart of It (pp. 155--168). Springer.https://doi.org/10.1007/978-1-4614-1168-0_9 
LibreCat: /record/1900
DOI: 10.1007/978-1-4614-1168-0_9

Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In Algorithms Unplugged (pp. 223--229). Springer.https://doi.org/10.1007/978-3-642-15328-0_22 
LibreCat: /record/1901
DOI: 10.1007/978-3-642-15328-0_22

Kolman, P., &; Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany (pp. 129--140).https://doi.org/10.4230/LIPIcs.STACS.2011.129 
LibreCat: /record/1924
DOI: 10.4230/LIPIcs.STACS.2011.129

Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., &; Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 149–158).https://doi.org/10.1145/1989493.1989516 
LibreCat: /record/645
DOI: 10.1145/1989493.1989516

Richa, A. W., &; Scheideler, C. (2011). Self-Stabilizing DeBruijn Networks. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 416–430).https://doi.org/10.1007/978-3-642-24550-3_31 
LibreCat: /record/646
DOI: 10.1007/978-3-642-24550-3_31

Nesterenko, M., Mohd, R., &; Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 356--370).https://doi.org/10.1007/978-3-642-24550-3_27 
LibreCat: /record/662
DOI: 10.1007/978-3-642-24550-3_27

Meyer auf der Heide, F., &; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474.https://doi.org/10.1007/s00287-010-0470-2 
LibreCat: /record/1903
DOI: 10.1007/s00287-010-0470-2

Gavoille, C., Patt-Shamir, B., &; Scheideler, C. (2010). Foreword. Theory of Computing Systems, (4), 809--810.https://doi.org/10.1007/s00224-010-9284-5 
LibreCat: /record/1904
DOI: 10.1007/s00224-010-9284-5

Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034, pp. 294--305). Springer.https://doi.org/10.1007/978-3-642-12200-2_27 
LibreCat: /record/1905
DOI: 10.1007/978-3-642-12200-2_27

Richa, A. W., Zhang, J., Scheideler, C., &; Schmid, S. (2010). Brief announcement: towards robust medium access in multi-hop networks. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010 (pp. 114--115). ACM.https://doi.org/10.1145/1835698.1835726 
LibreCat: /record/1906
DOI: 10.1145/1835698.1835726

Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 179--193). Springer.https://doi.org/10.1007/978-3-642-15763-9_17 
LibreCat: /record/1907
DOI: 10.1007/978-3-642-15763-9_17

Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &; Scheideler, C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer.https://doi.org/10.1007/978-3-642-15763-9_50 
LibreCat: /record/1908
DOI: 10.1007/978-3-642-15763-9_50

D. Kleinberg, R., &; Scheideler, C. (2009). Foreword. Theory Comput. Syst., (2), 187.https://doi.org/10.1007/s00224-009-9202-x 
LibreCat: /record/1925
DOI: 10.1007/s00224-009-9202-x

Awerbuch, B., &; Scheideler, C. (2009). Towards a Scalable and Robust DHT. Theory Comput. Syst., (2), 234--260.https://doi.org/10.1007/s00224-008-9099-9 
LibreCat: /record/1927
DOI: 10.1007/s00224-008-9099-9

Awerbuch, B., &; Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466.https://doi.org/10.1016/j.tcs.2008.10.003 
LibreCat: /record/1928
DOI: 10.1016/j.tcs.2008.10.003

Scheideler, C., &; Schmid, S. (2009). A Distributed and Oblivious Heap. In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp. 571--582). Springer.https://doi.org/10.1007/978-3-642-02930-1_47 
LibreCat: /record/1929
DOI: 10.1007/978-3-642-02930-1_47

Jacob, R., Ritscher, S., Scheideler, C., &; Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (Vol. 5878, pp. 771--780). Springer.https://doi.org/10.1007/978-3-642-10631-6_78 
LibreCat: /record/1930
DOI: 10.1007/978-3-642-10631-6_78

Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140).https://doi.org/10.1145/1582716.1582741 
LibreCat: /record/1932
DOI: 10.1145/1582716.1582741

Baumgart, M., Scheideler, C., &; Schmid, S. (2009). A DoS-resilient information system for dynamic data management. In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009 (pp. 300--309).https://doi.org/10.1145/1583991.1584064 
LibreCat: /record/1933
DOI: 10.1145/1583991.1584064

Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2009). Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization. In Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings (Vol. 5873, pp. 781--782). Springer.https://doi.org/10.1007/978-3-642-05118-0_58 
LibreCat: /record/1934
DOI: 10.1007/978-3-642-05118-0_58

Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &; Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany.https://doi.org/10.1145/1989493.1989516 
LibreCat: /record/1935
DOI: 10.1145/1989493.1989516

Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the EATCS, 130--152.
LibreCat: /record/1937

Awerbuch, B., W. Richa, A., &; Scheideler, C. (2008). A jamming-resistant MAC protocol for single-hop wireless networks. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008 (pp. 45--54). ACM.https://doi.org/10.1145/1400751.1400759 
LibreCat: /record/1938
DOI: 10.1145/1400751.1400759

Mense, M., &; Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008 (pp. 1135--1144). SIAM.
LibreCat: /record/1940

Clouser, T., Nesterenko, M., &; Scheideler, C. (2008). Tiara: A Self-stabilizing Deterministic Skip List. In Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings (Vol. 5340, pp. 124--140). Springer.https://doi.org/10.1007/978-3-540-89335-6_12 
LibreCat: /record/1941
DOI: 10.1007/978-3-540-89335-6_12

Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen? In Taschenbuch der Algorithmen (pp. 229--236). Springer.https://doi.org/10.1007/978-3-540-76394-9_22 
LibreCat: /record/1942
DOI: 10.1007/978-3-540-76394-9_22

Bagchi, A., Chaudhary, A., Scheideler, C., &; Kolman, P. (2007). Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math., (1), 141--157.https://doi.org/10.1137/S0895480102419743 
LibreCat: /record/2017
DOI: 10.1137/S0895480102419743

Onus, M., W. Richa, A., &; Scheideler, C. (2007). Linearization: Locally Self-Stabilizing Sorting in Graphs. In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007.https://doi.org/10.1137/1.9781611972870.10 
LibreCat: /record/2020
DOI: 10.1137/1.9781611972870.10

Awerbuch, B., &; Scheideler, C. (2007). Towards Scalable and Robust Overlay Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007.
LibreCat: /record/2022

Awerbuch, B., &; Scheideler, C. (2007). A denial-of-service resistant DHT. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007 (pp. 370--371). ACM.https://doi.org/10.1145/1281100.1281178 
LibreCat: /record/2023
DOI: 10.1145/1281100.1281178

Awerbuch, B., &; Scheideler, C. (2007). A Denial-of-Service Resistant DHT. In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer.https://doi.org/10.1007/978-3-540-75142-7_6 
LibreCat: /record/2024
DOI: 10.1007/978-3-540-75142-7_6

W. Richa, A., &; Scheideler, C. (2007). Overlay Networks for Peer-to-Peer Networks. In Handbook of Approximation Algorithms and Metaheuristics.https://doi.org/10.1201/9781420010749.ch72 
LibreCat: /record/2028
DOI: 10.1201/9781420010749.ch72

Brinkmann, A., Effert, S., Meyer auf der Heide, F., &; Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS).
LibreCat: /record/2214

Aggarwal, V., Feldmann, A., &; Scheideler, C. (2007). Can ISPs and P users cooperate for improved performance? ACM Computer Commucation Review.https://doi.org/10.1145/1273445.1273449 
LibreCat: /record/2209
DOI: 10.1145/1273445.1273449

Kolman, P., &; Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. J. Algorithms, 61(1), 20--44.https://doi.org/10.1016/j.jalgor.2004.07.006 
LibreCat: /record/2029
DOI: 10.1016/j.jalgor.2004.07.006

Ateniese, G., Riley, C., &; Scheideler, C. (2006). Survivable Monitoring in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254.https://doi.org/10.1109/TMC.2006.138 
LibreCat: /record/2110
DOI: 10.1109/TMC.2006.138

Kothapalli, K., Scheideler, C., Onus, M., &; Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.
LibreCat: /record/2111

Awerbuch, B., &; Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In OPODIS (pp. 275--289).
LibreCat: /record/2112

Awerbuch, B., &; Scheideler, C. (2006). Towards a scalable and robust DHT. In SPAA (pp. 318--327).
LibreCat: /record/2113

Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &; Scheideler, C. (2006). The Effect of Faults on Network Expansion. Theory Comput. Syst., (6), 903--928.https://doi.org/10.1007/s00224-006-1349-0 
LibreCat: /record/2043
DOI: 10.1007/s00224-006-1349-0

Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms and data structures. In 6th International HNI Symposium on New Trends in Parallel and Distributed Computing.
LibreCat: /record/2213

Korzeniowski, M., &; Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In ISPAN (pp. 182--187).
LibreCat: /record/2114

Kothapalli, K., &; Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In ISPAN (pp. 188--193).
LibreCat: /record/2115

Onus, M., W. Richa, A., Kothapalli, K., &; Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).
LibreCat: /record/2116

Kothapalli, K., Scheideler, C., Onus, M., &; W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).
LibreCat: /record/2117

Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC (pp. 704--713).
LibreCat: /record/2118

Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications.
LibreCat: /record/2212

Kolman, P., &; Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233.https://doi.org/10.1007/s00453-004-1086-1 
LibreCat: /record/2119
DOI: 10.1007/s00453-004-1086-1

Awerbuch, B., &; Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).
LibreCat: /record/2120

Riley, C., &; Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS.
LibreCat: /record/2121

Awerbuch, B., &; Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249).
LibreCat: /record/2122

Ateniese, G., Riley, C., &; Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In IWIA (pp. 33--47).
LibreCat: /record/2123

Awerbuch, B., &; Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).
LibreCat: /record/2124

Awerbuch, B., &; Scheideler, C. (2004). Consistent and compact data management in distributed storage systems. In SPAA (pp. 44--53).
LibreCat: /record/2125

Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., &; Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).
LibreCat: /record/2126

Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &; Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM.
LibreCat: /record/2127

Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., &; Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.
LibreCat: /record/19790

Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &; Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer.https://doi.org/10.1007/978-3-540-39658-1_17 
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Awerbuch, B., Brinkmann, A., &; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.
LibreCat: /record/2129

Awerbuch, B., &; Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.
LibreCat: /record/2130

Czumaj, A., Riley, C., &; Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.
LibreCat: /record/2131

Jia, L., Rajaraman, R., &; Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.
LibreCat: /record/2132

Kothapalli, K., &; Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.
LibreCat: /record/2133

Feige, U., &; Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399.https://doi.org/10.1007/s004930200018 
LibreCat: /record/2134
DOI: 10.1007/s004930200018

Kolman, P., &; Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.
LibreCat: /record/2135

Brinkmann, A., Salzwedel, K., &; Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).
LibreCat: /record/2136

Bagchi, A., Chaudhary, A., Scheideler, C., &; Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).
LibreCat: /record/2137

Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.
LibreCat: /record/2138

Meyer auf der Heide, F., &; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138.https://doi.org/10.1007/s004930170007 
LibreCat: /record/2139
DOI: 10.1007/s004930170007

Awerbuch, B., Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.
LibreCat: /record/2140

Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.
LibreCat: /record/2141

Kolman, P., &; Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).
LibreCat: /record/2142

Adler, M., &; Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391.https://doi.org/10.1007/s002240010006 
LibreCat: /record/2143
DOI: 10.1007/s002240010006

Scheideler, C., &; Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155.https://doi.org/10.1137/S0097539799353431 
LibreCat: /record/2145
DOI: 10.1137/S0097539799353431

Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.
LibreCat: /record/2146

Czumaj, A., &; Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).
LibreCat: /record/2147

Czumaj, A., &; Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.
LibreCat: /record/2148

Brinkmann, A., Salzwedel, K., &; Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).
LibreCat: /record/2149

Czumaj, A., &; Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.
LibreCat: /record/2150

Czumaj, A., &; Scheideler, C. (2000). A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems . In 32nd ACM Symposium on Theory of Computing (pp. 38–47).
LibreCat: /record/2211

Flammini, M., &; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.https://doi.org/10.1007/s002240000123 
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Berenbrink, P., &; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).
LibreCat: /record/2164

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).
LibreCat: /record/2165

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).
LibreCat: /record/2210

Scheideler, C., &; Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).
LibreCat: /record/2166

Scheideler, C., &; Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449.https://doi.org/10.1007/s002240000096 
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Adler, M., &; Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).
LibreCat: /record/2169

Feige, U., &; Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).
LibreCat: /record/2170