research
∙
05/10/2023
Shape Formation and Locomotion with Joint Movements in the Amoebot Model
We are considering the geometric amoebot model where a set of n amoebots...
share
research
∙
05/04/2023
Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs
We consider the problem of computing compact routing tables for a (weigh...
research
∙
03/28/2023
Universal Coating in the 3D Hybrid Model
Motivated by the prospect of nano-robots that assist human physiological...
research
∙
10/11/2022
Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs
Hybrid communication networks provide multiple modes of communication wi...
research
∙
05/05/2022
The Structural Power of Reconfigurable Circuits in the Amoebot Model
The amoebot model [Derakhshandeh et al., 2014] has been proposed as a mo...
research
∙
02/16/2022
Near-Shortest Path Routing in Hybrid Communication Networks
Hybrid networks, i.e., networks that leverage different means of communi...
research
∙
11/17/2021
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
Mutual exclusion is a classical problem in distributed computing that pr...
research
∙
07/30/2021
Beep-And-Sleep: Message and Energy Efficient Set Cover
We observe message-efficient distributed algorithms for the Set Cover pr...
research
∙
05/11/2021
Accelerating Amoebots via Reconfigurable Circuits
We consider an extension to the geometric amoebot model that allows amoe...
research
∙
05/06/2021
The Canonical Amoebot Model: Algorithms and Concurrency Control
The amoebot model abstracts active programmable matter as a collection o...
research
∙
09/08/2020
Time-Optimal Construction of Overlay Networks
We show how to construct an overlay network of constant degree and diame...
research
∙
07/02/2020
Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
We consider the problem of computing shortest paths in hybrid networks, ...
research
∙
05/15/2020
Time- and Space-Optimal Clock Synchronization in the Beeping Model
We consider the clock synchronization problem in the (discrete) beeping ...
research
∙
09/10/2019
A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory
We consider congestion control in peer-to-peer distributed systems. The ...
research
∙
09/04/2019
Shortest Paths in a Hybrid Network Model
We introduce a communication model for hybrid networks, where nodes have...
research
∙
04/25/2019
On the Complexity of Local Graph Transformations
We consider the problem of transforming a given graph G_s into a desired...
research
∙
04/24/2019
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
In this paper we present various distributed algorithms for LP-type prob...
research
∙
10/16/2018
Always be Two Steps Ahead of Your Enemy
We investigate the maintenance of overlay networks under massive churn, ...
research
∙
10/12/2018
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
In this work, we present a new approach for competitive routing in wirel...
research
∙
09/13/2018
Relays: A New Approach for the Finite Departure Problem in Overlay Networks
A fundamental problem for overlay networks is to safely exclude leaving ...
research
∙
09/13/2018
A Self-Stabilizing Hashed Patricia Trie
While a lot of research in distributed computing has covered solutions f...
research
∙
09/07/2018
On Underlay-Aware Self-Stabilizing Overlay Networks
We present a self-stabilizing protocol for an overlay network that const...
research
∙
08/30/2018
Self-stabilizing Overlays for high-dimensional Monotonic Searchability
We extend the concept of monotonic searchability for self-stabilizing sy...
research
∙
05/18/2018
Distributed Computation in the Node-Congested Clique
The Congested Clique model of distributed computing, which was introduce...
research
∙
05/16/2018
Convex Hull Formation for Programmable Matter
We envision programmable matter as a system of nano-scale agents (called...
research
∙
05/09/2018
Skeap & Leap: Scalable Distributed Priority Queues for constant and arbitrary Priorities
We propose two protocols for distributed priority queues (denoted by 'he...
research
∙
05/02/2018
Breaking the (√(n)) Barrier: Fast Consensus under a Late Adversary
We study the consensus problem in a synchronous distributed system of n ...
research
∙
02/21/2018
Skueue: A Scalable and Sequentially Consistent Distributed Queue
We propose a distributed protocol for a queue, called Skueue, which spre...
research
∙
10/25/2017
Competitive Routing in Hybrid Communication Networks
Routing is a challenging problem for wireless ad hoc networks, especiall...
research
∙
10/23/2017