M. Burkhardt, Untersuchungen zum Cone-Hashing. Universität Paderborn, 2017.
LibreCat: /record/18026

N. C. Banh, An Asynchronous Adaption of a Churn-resistant Overlay Network. Universität Paderborn, 2017.
LibreCat: /record/18027

A. Schenk, Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen. Universität Paderborn, 2017.
LibreCat: /record/18028

B. Beckendorf, Visualisierung zu Algorithmen verteilter Netzwerksysteme. Universität Paderborn, 2017.
LibreCat: /record/18029

A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal approach for the finite departure problem in overlay networks,” Inf. Comput., pp. 408--424, 2017.
LibreCat: /record/1812
DOI: 10.1016/j.ic.2016.12.006

S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271,” SIGACT News, no. 2, pp. 87--94, 2017.
LibreCat: /record/1813
DOI: 10.1145/3106700.3106713

Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal coating for programmable matter,” Theor. Comput. Sci., pp. 56--68, 2017.
LibreCat: /record/1814
DOI: 10.1016/j.tcs.2016.02.039

J. J. Daymude, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Improved Leader Election for Self-organizing Programmable Matter,” in 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.
LibreCat: /record/1815
DOI: 10.1007/978-3-319-72751-6_10

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

L. Luo, MultiSkipList: A Self-stabilizing Overlay Network with Monotonic Searchability maintained. Universität Paderborn, 2017.
LibreCat: /record/81

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

T. F. Strothmann, Self-* Algorithms for Distributed Systems. Universität Paderborn, 2017.
LibreCat: /record/61
DOI: 10.17619/UNIPB/1-150

J. Sundermeier, Routing in Hybrid Communication Networks with Holes - Considering Bounding Boxes as Hole Abstractions. Universität Paderborn, 2017.
LibreCat: /record/699

T. Knollmann, A Self-Stabilizing Protocol for Graphs of Diameter Two. Universität Paderborn, 2017.
LibreCat: /record/700

T. Götte, Self-Stabilizing Spanners for Tree Metrics. Universität Paderborn, 2017.
LibreCat: /record/701

R. Gmyr, K. Hinnenthal, C. Scheideler, and C. Sohler, “Distributed Monitoring of Network Properties: The Power of Hybrid Networks,” in Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), 2017, pp. 137:1--137:15.
LibreCat: /record/105
DOI: 10.4230/LIPIcs.ICALP.2017.137

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

M. Drees, R. Gmyr, and C. Scheideler, “Churn- and DoS-resistant Overlay Networks Based on Network Reconfiguration,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 417--427.
LibreCat: /record/215
DOI: 10.1145/2935764.2935783

S. Heuchler, Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem. 2016.
LibreCat: /record/18025

S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, “SplayNet: Towards Locally Self-Adjusting Networks,” IEEE/ACM Trans. Netw., no. 3, pp. 1421--1433, 2016.
LibreCat: /record/1835
DOI: 10.1109/TNET.2015.2410313