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.

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.

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.

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.

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.

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

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.

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.

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.

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.

Blömer, Johannes, et al. Provably Anonymous Communication Based on Trusted Execution Environments.

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.

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.

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.

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.

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.

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.

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.

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.

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.