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

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

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

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, 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