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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.