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

Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings (Vol. 9818, pp. 148--164).https://doi.org/10.1007/978-3-319-43994-5_10 
LibreCat: /record/1836
DOI: 10.1007/978-3-319-43994-5_10

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In 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 (pp. 289--299). ACM.https://doi.org/10.1145/2935764.2935784 
LibreCat: /record/1837
DOI: 10.1145/2935764.2935784

Strothmann, T. F. (2016). The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree. Journal of Graph Algorithms and Applications, 20(1), 79–100.https://doi.org/10.7155/jgaa.00385 
LibreCat: /record/5762
DOI: 10.7155/jgaa.00385

Scheideler, C., Setzer, A., &; Strothmann, T. F. (2016). Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks. In Proceedings of the 30th International Symposium on Distributed Computing (DISC) (pp. 71--84).https://doi.org/10.1007/978-3-662-53426-7_6 
LibreCat: /record/142
DOI: 10.1007/978-3-662-53426-7_6

Scheideler, C., Setzer, A., &; Strothmann, T. F. (2015). Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures. In Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS).https://doi.org/10.4230/LIPIcs.OPODIS.2015.24 
LibreCat: /record/241
DOI: 10.4230/LIPIcs.OPODIS.2015.24

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (pp. 201–216).https://doi.org/10.1007/978-3-319-21741-3_14 
LibreCat: /record/242
DOI: 10.1007/978-3-319-21741-3_14

Strothmann, T. F. (2015). The impact of communication patterns on distributed locally self-adjusting binary search trees. In Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM) (pp. 175--186).https://doi.org/10.1007/978-3-319-15612-5_16 
LibreCat: /record/243
DOI: 10.1007/978-3-319-15612-5_16

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Leader Election and Shape Formation with Self-organizing Programmable Matter. In DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings (Vol. 9211, pp. 117--132).https://doi.org/10.1007/978-3-319-21999-8_8 
LibreCat: /record/1850
DOI: 10.1007/978-3-319-21999-8_8

Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2015). An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems. In Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015 (pp. 21:1--21:2). ACM.https://doi.org/10.1145/2800795.2800829 
LibreCat: /record/1851
DOI: 10.1145/2800795.2800829

Derakhshandeh, Z., Gmyr, R., Strothmann, T. F., A. Bazzi, R., W. Richa, A., &; Scheideler, C. (2015). Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\rquote an, Spain, July 21 - 23, 2015 (pp. 67--69). ACM.https://doi.org/10.1145/2767386.2767451 
LibreCat: /record/1852
DOI: 10.1145/2767386.2767451

Koutsopoulos, A., Scheideler, C., &; Strothmann, T. F. (2015). Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015 (pp. 77--79). ACM.https://doi.org/10.1145/2755573.2755614 
LibreCat: /record/1853
DOI: 10.1145/2755573.2755614

Derakhshandeh, Z., Dolev, S., Gmyr, R., W. Richa, A., Scheideler, C., &; Strothmann, T. F. (2014). Brief announcement: amoebot - a new model for programmable matter. In 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014 (pp. 220--222). ACM.https://doi.org/10.1145/2612669.2612712 
LibreCat: /record/1863
DOI: 10.1145/2612669.2612712

Foreback, D., Koutsopoulos, A., Nesterenko, M., Scheideler, C., &; Strothmann, T. F. (2014). On Stabilizing Departures in Overlay Networks. In Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (pp. 48--62).https://doi.org/10.1007/978-3-319-11764-5_4 
LibreCat: /record/393
DOI: 10.1007/978-3-319-11764-5_4

Strothmann, T. F. (2012). Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn.
LibreCat: /record/582