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

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

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