Thim Strothmann
YOU?
Author Swipe
View article: Fault-Tolerant Shape Formation in the Amoebot Model
Fault-Tolerant Shape Formation in the Amoebot Model Open
The amoebot model is a distributed computing model of programmable matter. It envisions programmable matter as a collection of computational units called amoebots or particles that utilize local interactions to achieve tasks of coordinatio…
View article: Self-Stabilizing Supervised Publish-Subscribe Systems
Self-Stabilizing Supervised Publish-Subscribe Systems Open
In this paper we present two major results: First, we introduce the first self-stabilizing version of a supervised overlay network by presenting a self-stabilizing supervised skip ring. Secondly, we show how to use the self-stabilizing sup…
View article: Improved Leader Election for Self-Organizing Programmable Matter
Improved Leader Election for Self-Organizing Programmable Matter Open
We consider programmable matter that consists of computationally limited devices (called particles) that are able to self-organize in order to achieve some collective goal without the need for central control or external intervention. We u…
View article: Self-* Algorithms for distributed systems
Self-* Algorithms for distributed systems Open
In dieser Doktorarbeit werden zwei Szenarien für Self-* Algorithmen in verteilten Systemen betrachtet: selbst-organisierende programmierbare Materie und monotone Suchbarkeit für selbst-stabilisierende Overlaytopologien. Das erste Thema bet…
View article: Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks
Towards a Universal Approach for Monotonic Searchability in Self-Stabilizing Overlay Networks Open
For overlay networks, the ability to recover from a variety of problems like membership changes or faults is a key element to preserve their functionality. In recent years, various self-stabilizing overlay networks have been proposed that …
View article: Universal Shape Formation for Programmable Matter
Universal Shape Formation for Programmable Matter Open
We envision programmable matter consisting of systems of computationally limited devices (which we call particles) that are able to self-organize in order to achieve a desired collective goal without the need for central control or externa…
View article: The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree
The Impact of Communication Patterns on Distributed Self-Adjusting Binary Search Tree Open
This paper introduces the problem of communication pattern adaption for a distributed self-adjusting binary search tree. We propose a simple local algorithm that is closely related to the over thirty-year-old idea of splay trees and evalua…
View article: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures Open
Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various prob…
View article: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures Open
Distributed applications are commonly based on overlay networks interconnecting their sites so that they can exchange information. For these overlay networks to preserve their functionality, they should be able to recover from various prob…