Götte, Thorsten, et al. “Beep-and-Sleep: Message and Energy Efficient Set Cover.”10.1016/j.tcs.2023.113756__Theor. Comput. Sci., vol. 950, 2023, p. 113756, doi:10.1016/j.tcs.2023.113756.
LibreCat: /record/43109
DOI: 10.1016/j.tcs.2023.113756

Werthmann, Julian, et al. Routing Schemes for Hybrid Communication Networks. 2023, doi:10.48550/ARXIV.2210.05333.
LibreCat: /record/45188
DOI: 10.48550/ARXIV.2210.05333

Dou, Jinfeng, et al. “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), 2023.
LibreCat: /record/45193

Götte, Thorsten, et al. “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

Götte, Thorsten, et al. “Capabilities and Limitations of Local Strategies in Dynamic Networks.”10.5281/zenodo.8060372__On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 1--20, doi:10.5281/zenodo.8060372.
LibreCat: /record/45875
DOI: 10.5281/zenodo.8060372

Blömer, Johannes, et al. “Robustness and Security.”10.5281/zenodo.8068629__On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 145–64, doi:10.5281/zenodo.8068629.
LibreCat: /record/45891
DOI: 10.5281/zenodo.8068629

Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”10.1089/cmb.2021.0363__J. Comput. Biol., vol. 29, no. 4, 2022, pp. 317–343, doi:10.1089/cmb.2021.0363.
LibreCat: /record/31060
DOI: 10.1089/cmb.2021.0363

Padalkin, Andreas, et al. “The Structural Power of Reconfigurable Circuits in the Amoebot Model.”10.4230/LIPIcs.DNA.28.8__28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 8:1–8:22, doi:10.4230/LIPIcs.DNA.28.8.
LibreCat: /record/32602
DOI: 10.4230/LIPIcs.DNA.28.8

Kostitsyna, Irina, et al. “Fault-Tolerant Shape Formation in the Amoebot Model.”10.4230/LIPIcs.DNA.28.9__28th International Conference on DNA Computing and Molecular Programming (DNA 28), edited by Thomas E. Ouldridge and Shelley F. J. Wickham, vol. 238, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 9:1–9:22, doi:10.4230/LIPIcs.DNA.28.9.
LibreCat: /record/32603
DOI: 10.4230/LIPIcs.DNA.28.9

Daymude, Joshua J., et al. “Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.”10.4230/LIPIcs.SAND.2022.12__1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28-30, 2022, Virtual Conference, edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 12:1–12:19, doi:10.4230/LIPIcs.SAND.2022.12.
LibreCat: /record/33230
DOI: 10.4230/LIPIcs.SAND.2022.12

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

Kostitsyna, Irina, et al. “Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.”10.4230/LIPIcs.SAND.2022.23__1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022), edited by James Aspnes and Othon Michail, vol. 221, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, p. 23:1–23:3, doi:10.4230/LIPIcs.SAND.2022.23.
LibreCat: /record/30987
DOI: 10.4230/LIPIcs.SAND.2022.23

Aguiliera, Marcos, et al. “Edsger W. Dijkstra Prize in Distributed Computing.”10.1145/3519270.3538411__PODC ’22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, edited by Alessia Milani and Philipp Woelfel, ACM, 2022, p. 1, doi:10.1145/3519270.3538411.
LibreCat: /record/33967
DOI: 10.1145/3519270.3538411

Scheideler, Christian, editor. 36th International Symposium on Distributed Computing, DISC 2022, October 25-27, 2022, Augusta, Georgia, USA. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
LibreCat: /record/33968

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”10.1016/j.ic.2021.104697__Information and Computation, 104697, 2022, doi:10.1016/j.ic.2021.104697.
LibreCat: /record/21096
DOI: 10.1016/j.ic.2021.104697

Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.”10.1145/3477206.3477471__NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.
LibreCat: /record/25105
DOI: 10.1145/3477206.3477471

Feldmann, Michael, et al. “Coordinating Amoebots via Reconfigurable Circuits.”10.1007/978-3-030-91081-5‑34__Stabilization, Safety, and Security of Distributed Systems - 23rd International Symposium, (SSS) 2021, Virtual Event, November 17-20, 2021, Proceedings, edited by Colette Johnen et al., vol. 13046, Springer, 2021, pp. 484–88, doi:10.1007/978-3-030-91081-5‑34.
LibreCat: /record/28917
DOI: 10.1007/978-3-030-91081-5‑34

Dolev, Shlomi, et al. “Logarithmic Time MIMO Based Self-Stabilizing Clock Synchronization.”10.1145/3477206.3477471__NANOCOM ’21: The Eighth Annual ACM International Conference on Nanoscale Computing and Communication, Virtual Event, Italy, September 7 - 9, 2021, edited by Laura Galluccio et al., ACM, 2021, p. 30:1-30:2, doi:10.1145/3477206.3477471.
LibreCat: /record/27048
DOI: 10.1145/3477206.3477471

J. Daymude, Joshua, et al. “The Canonical Amoebot Model: Algorithms and Concurrency Control.”10.4230/LIPIcs.DISC.2021.20__35th International Symposium on Distributed Computing, DISC 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference), edited by Seth Gilbert, vol. 209, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 20:1-20:19, doi:10.4230/LIPIcs.DISC.2021.20.
LibreCat: /record/27050
DOI: 10.4230/LIPIcs.DISC.2021.20

Götte, Thorsten, et al. “Time-Optimal Construction of Overlays.”10.1145/3465084.3467932__Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), edited by Keren Censor-Hillel, ACM, doi:10.1145/3465084.3467932.
LibreCat: /record/22283
DOI: 10.1145/3465084.3467932

Coy, Sam, et al. “Near-Shortest Path Routing in Hybrid Communication Networks.”10.4230/LIPIcs.OPODIS.2021.11__25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France, edited by Quentin Bramas et al., vol. 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 11:1–11:23, doi:10.4230/LIPIcs.OPODIS.2021.11.
LibreCat: /record/30217
DOI: 10.4230/LIPIcs.OPODIS.2021.11

Götte, Thorsten, et al. “Beep-And-Sleep: Message and Energy Efficient Set Cover.”10.1007/978-3-030-89240-1_7__Algorithms for Sensor Systems (ALGOSENSORS ’21), 2021, doi:10.1007/978-3-030-89240-1_7.
LibreCat: /record/26888
DOI: 10.1007/978-3-030-89240-1_7

Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.”10.1137/1.9781611975994.78__Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, edited by Shuchi Chawla, SIAM, 2020, pp. 1280–99, doi:10.1137/1.9781611975994.78.
LibreCat: /record/27051
DOI: 10.1137/1.9781611975994.78

Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.”10.1007/s11047-019-09774-2__Nat. Comput., vol. 19, no. 2, 2020, pp. 375–90, doi:10.1007/s11047-019-09774-2.
LibreCat: /record/17808
DOI: 10.1007/s11047-019-09774-2

Werneck Richa, Andrea, and Christian Scheideler, editors. Structural Information and Communication Complexity - 27th International Colloquium, SIROCCO 2020, Paderborn, Germany, June 29 - July 1, 2020, Proceedings. Vol. 12156, Springer, 2020, doi:10.1007/978-3-030-54921-3.
LibreCat: /record/17836
DOI: 10.1007/978-3-030-54921-3

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

Feldmann, Michael, et al. “Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.”10.4230/LIPIcs.OPODIS.2020.31__Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:10.4230/LIPIcs.OPODIS.2020.31.
LibreCat: /record/20755
DOI: 10.4230/LIPIcs.OPODIS.2020.31
arXiv: 2007.01191

Feldmann, Michael, et al. “Survey on Algorithms for Self-Stabilizing Overlay Networks.”10.1145/3397190__ACM Computing Surveys, ACM, 2020, doi:10.1145/3397190.
LibreCat: /record/16902
DOI: 10.1145/3397190

Feldmann, Michael, et al. “Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.”10.1145/3350755.3400246__Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2020, doi:10.1145/3350755.3400246.
LibreCat: /record/16903
DOI: 10.1145/3350755.3400246
arXiv: 2005.07388

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.” Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN), ACM.
LibreCat: /record/15169

Daymude, Joshua J., et al. “Convex Hull Formation for Programmable Matter.”10.1145/3369740.3372916__Proceedings of the 21st International Conference on Distributed Computing and Networking, 2020, doi:10.1145/3369740.3372916.
LibreCat: /record/16346
DOI: 10.1145/3369740.3372916

Luo, Linghui, et al. “MultiSkipGraph: A Self-Stabilizing Overlay Network That Maintains Monotonic Searchability.” Proceedings of the 2019 IEEE 33rd International Parallel and Distributed Processing Symposium (IPDPS ’19), 2019.
LibreCat: /record/7636

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

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

Daymude, Joshua J., et al. “Computing by Programmable Particles.”https://doi.org/10.1007/978-3-030-11072-7_22__Distributed Computing by Mobile Entities, Current Research in Moving and Computing., Springer, Cham, 2019, pp. 615–81, doi: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, Thorsten, et al. “Always Be Two Steps Ahead of Your Enemy - Maintaining a Routable Overlay under Massive Churn with an Almost Up-to-Date Adversary.” Proceedings of the 2019 IEEE 33rd International Parallel  and Distributed Processing Symposium (IPDPS ’19), IEEE.
LibreCat: /record/6976

Scheideler, Christian, and Alexander Setzer. “On the Complexity of Local Graph Transformations.”10.4230/LIPICS.ICALP.2019.150__Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, vol. 132, Dagstuhl Publishing, 2019, pp. 150:1--150:14, doi:10.4230/LIPICS.ICALP.2019.150.
LibreCat: /record/10586
DOI: 10.4230/LIPICS.ICALP.2019.150

Götte, Thorsten, et al. “Faster Construction of Overlay Networks.”10.1007/978-3-030-24922-9_18__Structural Information and Communication Complexity, 2019, doi:10.1007/978-3-030-24922-9_18.
LibreCat: /record/12944
DOI: 10.1007/978-3-030-24922-9_18

Augustine, John, et al. “Shortest Paths in a Hybrid Network Model.”10.1137/1.9781611975994.78__Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, pp. 1280–99, doi:10.1137/1.9781611975994.78.
LibreCat: /record/15627
DOI: 10.1137/1.9781611975994.78

Scheideler, Christian, and Petra Berenbrink, editors. The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019. ACM, 2019, doi:10.1145/3323165.
LibreCat: /record/14829
DOI: 10.1145/3323165

Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.”10.1007/s00224-017-9823-4__Theory Comput. Syst., vol. 63, no. 2, 2019, pp. 177–99, doi:10.1007/s00224-017-9823-4.
LibreCat: /record/14830
DOI: 10.1007/s00224-017-9823-4

Castenow, Jannik, et al. “A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.”10.1007/978-3-030-24922-9‑26__Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2019, pp. 345–48, doi:10.1007/978-3-030-24922-9‑26.
LibreCat: /record/14539
DOI: 10.1007/978-3-030-24922-9‑26

Feldmann, Michael, et al. “A Loosely Self-Stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.”https://doi.org/10.1007/978-3-030-34992-9_13__Proceedings of the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), Springer, Cham, 2019, pp. 149–64, doi: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, Kristian, et al. “Fast Distributed Algorithms for LP-Type Problems of Low Dimension.”10.4230/LIPICS.DISC.2019.23__33rd International Symposium on Distributed Computing (DISC 2019), 2019, doi:10.4230/LIPICS.DISC.2019.23.
LibreCat: /record/13652
DOI: 10.4230/LIPICS.DISC.2019.23

Robinson, Peter, et al. “Breaking the $\'4fmega(\'73qrtn)$ Barrier: Fast Consensus under a Late Adversary.”10.1145/3210377.3210399__Proceedings of the 30th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), doi:10.1145/3210377.3210399.
LibreCat: /record/3422
DOI: 10.1145/3210377.3210399

Scheideler, Christian, and Jeremy T. Fineman, editors. Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. ACM, 2018.
LibreCat: /record/3874

Feldmann, Michael, et al. “Self-Stabilizing Supervised Publish-Subscribe Systems.”10.1109/IPDPS.2018.00114__Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00114.
LibreCat: /record/1163
DOI: 10.1109/IPDPS.2018.00114
arXiv: 1710.08128

Feldmann, Michael, et al. “Skueue: A Scalable and Sequentially Consistent Distributed Queue.”10.1109/IPDPS.2018.00113__Proceedings of the 32nd IEEE International Parallel &; Distributed Processing Symposium (IPDPS), IEEE, 2018, doi:10.1109/IPDPS.2018.00113.
LibreCat: /record/1164
DOI: 10.1109/IPDPS.2018.00113
arXiv: 1802.07504

J. Daymude, Joshua, et al. “On the Runtime of Universal Coating for Programmable Matter.”10.1007/s11047-017-9658-6__Natural Computing, no. 1, 2018, pp. 81--96, doi:10.1007/s11047-017-9658-6.
LibreCat: /record/1796
DOI: 10.1007/s11047-017-9658-6

Gmyr, Robert, et al. “Forming Tile Shapes with Simple Robots.”10.1007/978-3-030-00030-1_8__Proceedings of the 24th International Conference on DNA Computing and Molecular Programming, Springer International Publishing, 2018, pp. 122–38, doi:10.1007/978-3-030-00030-1_8.
LibreCat: /record/5764
DOI: 10.1007/978-3-030-00030-1_8

Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.
LibreCat: /record/5820

Scheideler, Christian. “Preface.”10.1016/j.tcs.2018.11.004__Theor. Comput. Sci., vol. 751, 2018, p. 1, doi:10.1016/j.tcs.2018.11.004.
LibreCat: /record/5984
DOI: 10.1016/j.tcs.2018.11.004

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

Gmyr, Robert, et al. “Shape Recognition by a Finite Automaton Robot.”10.4230/LIPIcs.MFCS.2018.52__43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, 2018, pp. 52:1-52:15, doi:10.4230/LIPIcs.MFCS.2018.52.
LibreCat: /record/5986
DOI: 10.4230/LIPIcs.MFCS.2018.52

Knollmann, Till, and Christian Scheideler. “A Self-Stabilizing Hashed Patricia Trie.”10.1007/978-3-030-03232-6_1__Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), edited by Taisuke Izumi and Petr Kuznetsov, vol. 11201, Springer, Cham, 2018, doi:10.1007/978-3-030-03232-6_1.
LibreCat: /record/4411
DOI: 10.1007/978-3-030-03232-6_1
arXiv: 1809.04923

Jung, Daniel, et al. “Competitive Routing in Hybrid Communication Networks.” Proceedings of the 14th International Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) , Springer, 2018.
LibreCat: /record/4563

Jung, Daniel, et al. “Brief Announcement: Competitive Routing in Hybrid Communication Networks.”10.1145/3210377.3210663__Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM Press, 2018, doi:10.1145/3210377.3210663.
LibreCat: /record/4565
DOI: 10.1145/3210377.3210663

Feldmann, Michael, et al. “Self-Stabilizing Overlays for High-Dimensional Monotonic Searchability.”10.1007/978-3-030-03232-6_2__Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 11201, Springer, Cham, 2018, pp. 16–31, doi:10.1007/978-3-030-03232-6_2.
LibreCat: /record/4351
DOI: 10.1007/978-3-030-03232-6_2
arXiv: 1808.10300

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

Götte, Thorsten, et al. “On Underlay-Aware Self-Stabilizing Overlay Networks.” Proceedings of the 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), vol. 11201, Springer, 2018, pp. 50–64.
LibreCat: /record/5222

Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.”10.1007/s00446-017-0307-1__Distributed Computing, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:10.1007/s00446-017-0307-1.
LibreCat: /record/3872
DOI: 10.1007/s00446-017-0307-1

Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”10.1016/j.ic.2016.12.006__Inf. Comput., 2017, pp. 408--424, doi:10.1016/j.ic.2016.12.006.
LibreCat: /record/1812
DOI: 10.1016/j.ic.2016.12.006

P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.”10.1145/3106700.3106713__SIGACT News, no. 2, 2017, pp. 87--94, doi:10.1145/3106700.3106713.
LibreCat: /record/1813
DOI: 10.1145/3106700.3106713

Derakhshandeh, Zahra, et al. “Universal Coating for Programmable Matter.”10.1016/j.tcs.2016.02.039__Theor. Comput. Sci., 2017, pp. 56--68, doi:10.1016/j.tcs.2016.02.039.
LibreCat: /record/1814
DOI: 10.1016/j.tcs.2016.02.039

J. Daymude, Joshua, et al. “Improved Leader Election for Self-Organizing Programmable Matter.”10.1007/978-3-319-72751-6_10__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, 2017, pp. 127--140, doi:10.1007/978-3-319-72751-6_10.
LibreCat: /record/1815
DOI: 10.1007/978-3-319-72751-6_10

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

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

Gmyr, Robert, et al. “Distributed Monitoring of Network Properties: The Power of Hybrid Networks.”10.4230/LIPIcs.ICALP.2017.137__Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15, doi:10.4230/LIPIcs.ICALP.2017.137.
LibreCat: /record/105
DOI: 10.4230/LIPIcs.ICALP.2017.137

Feldmann, Michael, and Christian Scheideler. “A Self-Stabilizing General De Bruijn Graph.”10.1007/978-3-319-69084-1_17__Proceedings of the 19th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), vol. 10616, Springer, Cham, 2017, pp. 250–64, doi:10.1007/978-3-319-69084-1_17.
LibreCat: /record/125
DOI: 10.1007/978-3-319-69084-1_17
arXiv: 1708.06542

Drees, Maximilian, et al. “Churn- and DoS-Resistant Overlay Networks Based on Network Reconfiguration.”10.1145/2935764.2935783__Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427, doi:10.1145/2935764.2935783.
LibreCat: /record/215
DOI: 10.1145/2935764.2935783

Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.”10.1109/TNET.2015.2410313__IEEE/ACM Trans. Netw., no. 3, 2016, pp. 1421--1433, doi:10.1109/TNET.2015.2410313.
LibreCat: /record/1835
DOI: 10.1109/TNET.2015.2410313

Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable Matter.”10.1007/978-3-319-43994-5_10__DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, vol. 9818, 2016, pp. 148--164, doi:10.1007/978-3-319-43994-5_10.
LibreCat: /record/1836
DOI: 10.1007/978-3-319-43994-5_10

Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.”10.1145/2935764.2935784__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, ACM, 2016, pp. 289--299, doi:10.1145/2935764.2935784.
LibreCat: /record/1837
DOI: 10.1145/2935764.2935784

Scheideler, Christian, and Seth Gilbert, editors. 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. 2016, doi:10.1145/2935764.
LibreCat: /record/1844
DOI: 10.1145/2935764

W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.”10.1007/978-1-4939-2864-4_593__Encyclopedia of Algorithms, 2016, pp. 999--1002, doi:10.1007/978-1-4939-2864-4_593.
LibreCat: /record/1845
DOI: 10.1007/978-1-4939-2864-4_593

Gmyr, Robert, et al. “Self-Stabilizing Metric Graphs.”10.1007/978-3-319-49259-9_20__Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016, pp. 248--262, doi:10.1007/978-3-319-49259-9_20.
LibreCat: /record/155
DOI: 10.1007/978-3-319-49259-9_20

Scheideler, Christian, et al. “Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks.”10.1007/978-3-662-53426-7_6__Proceedings of the 30th International Symposium on Distributed Computing (DISC), 2016, pp. 71--84, doi:10.1007/978-3-662-53426-7_6.
LibreCat: /record/142
DOI: 10.1007/978-3-662-53426-7_6

Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.”10.1145/2809806__Transactions on Parallel Computing, no. 3, ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.
LibreCat: /record/284
DOI: 10.1145/2809806

Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”10.4230/LIPIcs.OPODIS.2015.24__Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.
LibreCat: /record/241
DOI: 10.4230/LIPIcs.OPODIS.2015.24

Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”10.1007/978-3-319-21741-3_14__Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.
LibreCat: /record/242
DOI: 10.1007/978-3-319-21741-3_14

Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”10.1016/j.tcs.2014.11.027__Theoretical Computer Science, Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027.
LibreCat: /record/327
DOI: 10.1016/j.tcs.2014.11.027

Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.”10.1007/978-3-319-21999-8_8__DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, vol. 9211, 2015, pp. 117--132, doi:10.1007/978-3-319-21999-8_8.
LibreCat: /record/1850
DOI: 10.1007/978-3-319-21999-8_8

Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.”10.1145/2800795.2800829__Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2, doi:10.1145/2800795.2800829.
LibreCat: /record/1851
DOI: 10.1145/2800795.2800829

Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.”10.1145/2767386.2767451__Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\rquote an, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69, doi:10.1145/2767386.2767451.
LibreCat: /record/1852
DOI: 10.1145/2767386.2767451

Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”10.1145/2755573.2755614__Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79, doi:10.1145/2755573.2755614.
LibreCat: /record/1853
DOI: 10.1145/2755573.2755614

Scheideler, Christian, editor. Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings. 2015, doi:10.1007/978-3-319-25258-2.
LibreCat: /record/1854
DOI: 10.1007/978-3-319-25258-2

Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.”10.1007/978-3-319-14472-6_8__Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122, doi:10.1007/978-3-319-14472-6_8.
LibreCat: /record/371
DOI: 10.1007/978-3-319-14472-6_8

Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.”10.1007/s00224-012-9431-2__Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612, doi:10.1007/s00224-012-9431-2.
LibreCat: /record/378
DOI: 10.1007/s00224-012-9431-2

Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.”10.1145/2635818__Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818.
LibreCat: /record/387
DOI: 10.1145/2635818

Jacob, Riko, et al. “SKIP*: A Self-Stabilizing Skip Graph.”10.1145/2629695__J. ACM, no. 6, 2014, pp. 36:1--36:26, doi:10.1145/2629695.
LibreCat: /record/1858
DOI: 10.1145/2629695

Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for Programmable Matter.”10.1145/2612669.2612712__26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222, doi:10.1145/2612669.2612712.
LibreCat: /record/1863
DOI: 10.1145/2612669.2612712

Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.”10.1109/INFOCOM.2014.6848224__Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
LibreCat: /record/446
DOI: 10.1109/INFOCOM.2014.6848224

Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.”10.1007/978-3-319-09620-9_1__Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
LibreCat: /record/459
DOI: 10.1007/978-3-319-09620-9_1

Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.”10.1007/s00224-013-9504-x__Theory of Computing Systems, no. 1, Springer, 2014, pp. 110–35, doi:10.1007/s00224-013-9504-x.
LibreCat: /record/464
DOI: 10.1007/s00224-013-9504-x

Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.”10.1007/978-3-319-11764-5_4__Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.
LibreCat: /record/393
DOI: 10.1007/978-3-319-11764-5_4

Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.
LibreCat: /record/397

Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.”10.1109/P2P.2014.6934300__Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.
LibreCat: /record/412
DOI: 10.1109/P2P.2014.6934300
arXiv: 1408.0395

W. Richa, Andr\rquote ea, et al. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.”10.1007/s00446-012-0180-x__Distributed Computing, no. 3, 2013, pp. 159--171, doi:10.1007/s00446-012-0180-x.
LibreCat: /record/1868
DOI: 10.1007/s00446-012-0180-x

Mohd Nor, Rizal, et al. “Corona:  A Stabilizing Deterministic Message-Passing Skip List.”10.1016/j.tcs.2012.08.029__Theor. Comput. Sci., 2013, pp. 119--129, doi:10.1016/j.tcs.2012.08.029.
LibreCat: /record/1870
DOI: 10.1016/j.tcs.2012.08.029

W. Richa, Andrea, et al. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.”10.1109/TNET.2012.2210241__IEEE/ACM Trans. Netw., no. 3, 2013, pp. 760--771, doi:10.1109/TNET.2012.2210241.
LibreCat: /record/1871
DOI: 10.1109/TNET.2012.2210241

Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.”10.1007/s00224-013-9454-3__Theory of Computing Systems, no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.
LibreCat: /record/476
DOI: 10.1007/s00224-013-9454-3

Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.”10.1109/IPDPS.2013.40__Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.
LibreCat: /record/513
DOI: 10.1109/IPDPS.2013.40

Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.”10.1145/2486159.2486186__Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.
LibreCat: /record/519
DOI: 10.1145/2486159.2486186

Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.”10.1007/978-3-642-41527-2_37__Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.
LibreCat: /record/542
DOI: 10.1007/978-3-642-41527-2_37

Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”10.1007/978-3-319-03578-9_14__Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.
LibreCat: /record/564
DOI: 10.1007/978-3-319-03578-9_14

Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.”10.1016/j.tcs.2012.07.012__Theor. Comput. Sci., 2012, p. 1, doi:10.1016/j.tcs.2012.07.012.
LibreCat: /record/1882
DOI: 10.1016/j.tcs.2012.07.012

Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.”10.1007/978-3-642-32820-6_1__Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, vol. 7484, Springer, 2012, pp. 1--2, doi:10.1007/978-3-642-32820-6_1.
LibreCat: /record/1884
DOI: 10.1007/978-3-642-32820-6_1

Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.”10.1016/j.tcs.2012.07.029__Theoretical Computer Science, Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.
LibreCat: /record/570
DOI: 10.1016/j.tcs.2012.07.029

Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.”10.1016/j.tcs.2011.12.079__Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079.
LibreCat: /record/574
DOI: 10.1016/j.tcs.2011.12.079

Richa, Andrea W., and Christian Scheideler, editors. Stabilization, Safety, and Security of Distributed Systems. 2012, doi:10.1007/978-3-642-33536-5.
LibreCat: /record/577
DOI: 10.1007/978-3-642-33536-5

Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.”10.1145/2229163.2229174__Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
LibreCat: /record/579
DOI: 10.1145/2229163.2229174

Drees, Maximilian, et al. “Self-Organizing Particle Systems.”10.1109/IPDPS.2012.116__Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.
LibreCat: /record/581
DOI: 10.1109/IPDPS.2012.116

Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”10.1145/2332432.2332488__Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488.
LibreCat: /record/623
DOI: 10.1145/2332432.2332488

Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.”10.1007/978-3-642-33651-5_47__Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.
LibreCat: /record/625
DOI: 10.1007/978-3-642-33651-5_47

Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.”10.1007/978-3-642-33651-5_45__Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.
LibreCat: /record/626
DOI: 10.1007/978-3-642-33651-5_45

Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.”10.1137/1.9781611973099.64__Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.
LibreCat: /record/632
DOI: 10.1137/1.9781611973099.64

Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.”10.1109/IPDPS.2012.115__Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.
LibreCat: /record/640
DOI: 10.1109/IPDPS.2012.115

W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive Jamming.”10.1109/ICDCS.2011.8__2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516, doi:10.1109/ICDCS.2011.8.
LibreCat: /record/1891
DOI: 10.1109/ICDCS.2011.8

W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.”10.1145/2030686.2030697__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, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.
LibreCat: /record/1892
DOI: 10.1145/2030686.2030697

W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.”10.1145/2107502.2107522__Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.
LibreCat: /record/1893
DOI: 10.1145/2107502.2107522

Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.”10.1145/1989493.1989527__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), 2011, pp. 235--244, doi:10.1145/1989493.1989527.
LibreCat: /record/1895
DOI: 10.1145/1989493.1989527

Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.”10.1007/978-3-642-19094-0_18__WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.
LibreCat: /record/1899
DOI: 10.1007/978-3-642-19094-0_18

Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.”10.1007/978-1-4614-1168-0_9__Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.
LibreCat: /record/1900
DOI: 10.1007/978-1-4614-1168-0_9

Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”10.1007/978-3-642-15328-0_22__Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.
LibreCat: /record/1901
DOI: 10.1007/978-3-642-15328-0_22

Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.”10.4230/LIPIcs.STACS.2011.129__28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140, doi:10.4230/LIPIcs.STACS.2011.129.
LibreCat: /record/1924
DOI: 10.4230/LIPIcs.STACS.2011.129

Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”10.1145/1989493.1989516__Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.
LibreCat: /record/645
DOI: 10.1145/1989493.1989516

Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.”10.1007/978-3-642-24550-3_31__Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.
LibreCat: /record/646
DOI: 10.1007/978-3-642-24550-3_31

Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.”10.1007/978-3-642-24550-3_27__Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.
LibreCat: /record/662
DOI: 10.1007/978-3-642-24550-3_27

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.”10.1007/s00287-010-0470-2__Informatik Spektrum, no. 5, 2010, pp. 468--474, doi:10.1007/s00287-010-0470-2.
LibreCat: /record/1903
DOI: 10.1007/s00287-010-0470-2

Gavoille, Cyril, et al. “Foreword.”10.1007/s00224-010-9284-5__Theory of Computing Systems, no. 4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.
LibreCat: /record/1904
DOI: 10.1007/s00224-010-9284-5

Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.”10.1007/978-3-642-12200-2_27__LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, vol. 6034, Springer, 2010, pp. 294--305, doi:10.1007/978-3-642-12200-2_27.
LibreCat: /record/1905
DOI: 10.1007/978-3-642-12200-2_27

Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.”10.1145/1835698.1835726__Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.
LibreCat: /record/1906
DOI: 10.1145/1835698.1835726

Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.”10.1007/978-3-642-15763-9_17__Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer, 2010, pp. 179--193, doi:10.1007/978-3-642-15763-9_17.
LibreCat: /record/1907
DOI: 10.1007/978-3-642-15763-9_17

Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.”10.1007/978-3-642-15763-9_50__Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer, 2010, pp. 528--530, doi:10.1007/978-3-642-15763-9_50.
LibreCat: /record/1908
DOI: 10.1007/978-3-642-15763-9_50

Scheideler, Christian, editor. Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers. 2010, doi:10.1007/978-3-642-16988-5.
LibreCat: /record/1909
DOI: 10.1007/978-3-642-16988-5

D. Kleinberg, Robert, and Christian Scheideler. “Foreword.”10.1007/s00224-009-9202-x__Theory Comput. Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.
LibreCat: /record/1925
DOI: 10.1007/s00224-009-9202-x

Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.”10.1007/s00224-008-9099-9__Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.
LibreCat: /record/1927
DOI: 10.1007/s00224-008-9099-9

Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.”10.1016/j.tcs.2008.10.003__Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466, doi:10.1016/j.tcs.2008.10.003.
LibreCat: /record/1928
DOI: 10.1016/j.tcs.2008.10.003

Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.”10.1007/978-3-642-02930-1_47__Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer, 2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.
LibreCat: /record/1929
DOI: 10.1007/978-3-642-02930-1_47

Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.”10.1007/978-3-642-10631-6_78__Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009, pp. 771--780, doi:10.1007/978-3-642-10631-6_78.
LibreCat: /record/1930
DOI: 10.1007/978-3-642-10631-6_78

Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.”10.1145/1582716.1582741__Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140, doi:10.1145/1582716.1582741.
LibreCat: /record/1932
DOI: 10.1145/1582716.1582741

Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.”10.1145/1583991.1584064__SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.
LibreCat: /record/1933
DOI: 10.1145/1583991.1584064

Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.”10.1007/978-3-642-05118-0_58__Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58.
LibreCat: /record/1934
DOI: 10.1007/978-3-642-05118-0_58

Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”10.1145/1989493.1989516__Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009, doi:10.1145/1989493.1989516.
LibreCat: /record/1935
DOI: 10.1145/1989493.1989516

Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, pp. 130--152.
LibreCat: /record/1937

Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.”10.1145/1400751.1400759__Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54, doi:10.1145/1400751.1400759.
LibreCat: /record/1938
DOI: 10.1145/1400751.1400759

Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.
LibreCat: /record/1940

Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.”10.1007/978-3-540-89335-6_12__Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.
LibreCat: /record/1941
DOI: 10.1007/978-3-540-89335-6_12

Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”10.1007/978-3-540-76394-9_22__Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.
LibreCat: /record/1942
DOI: 10.1007/978-3-540-76394-9_22

Hegering, Heinz-Gerd, et al., editors. INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland. Vol. 133, 2008.
LibreCat: /record/1943

Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.”10.1137/S0895480102419743__SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.
LibreCat: /record/2017
DOI: 10.1137/S0895480102419743

Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.”10.1137/1.9781611972870.10__Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.
LibreCat: /record/2020
DOI: 10.1137/1.9781611972870.10

Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
LibreCat: /record/2022

Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.”10.1145/1281100.1281178__Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.
LibreCat: /record/2023
DOI: 10.1145/1281100.1281178

Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.”10.1007/978-3-540-75142-7_6__Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp. 33--47, doi:10.1007/978-3-540-75142-7_6.
LibreCat: /record/2024
DOI: 10.1007/978-3-540-75142-7_6

Aspnes, James, et al., editors. Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings. Vol. 4549, 2007, doi:10.1007/978-3-540-73090-3.
LibreCat: /record/2025
DOI: 10.1007/978-3-540-73090-3

B. Gibbons, Phillip, and Christian Scheideler, editors. SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007. ACM, 2007.
LibreCat: /record/2027

W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.”10.1201/9781420010749.ch72__Handbook of Approximation Algorithms and Metaheuristics., 2007, doi:10.1201/9781420010749.ch72.
LibreCat: /record/2028
DOI: 10.1201/9781420010749.ch72

Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
LibreCat: /record/2214

Aggarwal, Vinay, et al. “Can ISPs and P Users Cooperate for Improved Performance?”10.1145/1273445.1273449__ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.
LibreCat: /record/2209
DOI: 10.1145/1273445.1273449

Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.”10.1016/j.jalgor.2004.07.006__J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.
LibreCat: /record/2029
DOI: 10.1016/j.jalgor.2004.07.006

Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.”10.1109/TMC.2006.138__IEEE Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.
LibreCat: /record/2110
DOI: 10.1109/TMC.2006.138

Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” IPDPS, 2006.
LibreCat: /record/2111

Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.
LibreCat: /record/2112

Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” SPAA, 2006, pp. 318--327.
LibreCat: /record/2113

Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.”10.1007/s00224-006-1349-0__Theory Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.
LibreCat: /record/2043
DOI: 10.1007/s00224-006-1349-0

Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.
LibreCat: /record/2213

Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN, 2005, pp. 182--187.
LibreCat: /record/2114

Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193.
LibreCat: /record/2115

Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.
LibreCat: /record/2116

Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125.
LibreCat: /record/2117

Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC, 2005, pp. 704--713.
LibreCat: /record/2118

Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA Workshop on Wireless Communications, 2005.
LibreCat: /record/2212

Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.”10.1007/s00453-004-1086-1__Algorithmica, no. 3, 2004, pp. 209--233, doi:10.1007/s00453-004-1086-1.
LibreCat: /record/2119
DOI: 10.1007/s00453-004-1086-1

Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195.
LibreCat: /record/2120

Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.
LibreCat: /record/2121

Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249.
LibreCat: /record/2122

Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.
LibreCat: /record/2123

Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.
LibreCat: /record/2124

Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.
LibreCat: /record/2125

Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.
LibreCat: /record/2126

Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293.
LibreCat: /record/2127

Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.
LibreCat: /record/19790

Damerow, Valentina, et al. “Smoothed Motion Complexity.”10.1007/978-3-540-39658-1_17__ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.
LibreCat: /record/2129

Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.
LibreCat: /record/2130

Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.
LibreCat: /record/2131

Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.
LibreCat: /record/2132

Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.
LibreCat: /record/2133

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.”10.1007/s004930200018__Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.
LibreCat: /record/2134
DOI: 10.1007/s004930200018

Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.
LibreCat: /record/2135

Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.
LibreCat: /record/2136

Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274.
LibreCat: /record/2137

Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.
LibreCat: /record/2138