Thim Strothmann

Orcid: 0000-0002-5562-4027

Affiliations:
  • adesso mobile solutions GmbH, Paderborn, Germany


According to our database1, Thim Strothmann authored at least 25 papers between 2013 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Forming tile shapes with simple robots.
Nat. Comput., 2020

2019
MULTISKIPGRAPH: A Self-Stabilizing Overlay Network that Maintains Monotonic Searchability.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018
On the runtime of universal coating for programmable matter.
Nat. Comput., 2018

Self-Stabilizing Supervised Publish-Subscribe Systems.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Adapt Cases 4 BPM - A Modeling Framework for Process Flexibility in IIoT.
Proceedings of the 22nd IEEE International Enterprise Distributed Object Computing Workshop, 2018

2017
Self-* Algorithms for distributed systems: programmable matter & overlay networks
PhD thesis, 2017

Universal coating for programmable matter.
Theor. Comput. Sci., 2017

Towards a universal approach for the finite departure problem in overlay networks.
Inf. Comput., 2017

Leader Election with High Probability for Self-Organizing Programmable Matter.
CoRR, 2017

Improved Leader Election for Self-organizing Programmable Matter.
Proceedings of the Algorithms for Sensor Systems, 2017

2016
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree.
J. Graph Algorithms Appl., 2016

Towards a Universal Approach for Monotonic Searchability in Self-stabilizing Overlay Networks.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Universal Shape Formation for Programmable Matter.
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

On the Runtime of Universal Coating for Programmable Matter.
Proceedings of the DNA Computing and Molecular Programming - 22nd International Conference, 2016

2015
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures (full version).
CoRR, 2015

The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Trees.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.
Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, 2015

Leader Election and Shape Formation with Self-organizing Programmable Matter.
Proceedings of the DNA Computing and Molecular Programming - 21st International Conference, 2015

2014
Infinite Object Coating in the Amoebot Model.
CoRR, 2014

On Stabilizing Departures in Overlay Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Brief announcement: amoebot - a new model for programmable matter.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013
Self-Optimizing Binary Search Trees - A Game Theoretic Approach.
Proceedings of the Informatiktage 2013, 2013


  Loading...