
Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems
Mutual exclusion is a classical problem in distributed computing that pr...
read it

BeepAndSleep: Message and Energy Efficient Set Cover
We observe messageefficient distributed algorithms for the Set Cover pr...
read it

Accelerating Amoebots via Reconfigurable Circuits
We consider an extension to the geometric amoebot model that allows amoe...
read it

The Canonical Amoebot Model: Algorithms and Concurrency Control
The amoebot model abstracts active programmable matter as a collection o...
read it

TimeOptimal Construction of Overlay Networks
We show how to construct an overlay network of constant degree and diame...
read it

Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs
We consider the problem of computing shortest paths in hybrid networks, ...
read it

Time and SpaceOptimal Clock Synchronization in the Beeping Model
We consider the clock synchronization problem in the (discrete) beeping ...
read it

A Loosely Selfstabilizing Protocol for Randomized Congestion Control with Logarithmic Memory
We consider congestion control in peertopeer distributed systems. The ...
read it

Shortest Paths in a Hybrid Network Model
We introduce a communication model for hybrid networks, where nodes have...
read it

On the Complexity of Local Graph Transformations
We consider the problem of transforming a given graph G_s into a desired...
read it

Fast Distributed Algorithms for LPType Problems of Bounded Dimension
In this paper we present various distributed algorithms for LPtype prob...
read it

Always be Two Steps Ahead of Your Enemy
We investigate the maintenance of overlay networks under massive churn, ...
read it

A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
In this work, we present a new approach for competitive routing in wirel...
read it

Relays: A New Approach for the Finite Departure Problem in Overlay Networks
A fundamental problem for overlay networks is to safely exclude leaving ...
read it

A SelfStabilizing Hashed Patricia Trie
While a lot of research in distributed computing has covered solutions f...
read it

On UnderlayAware SelfStabilizing Overlay Networks
We present a selfstabilizing protocol for an overlay network that const...
read it

Selfstabilizing Overlays for highdimensional Monotonic Searchability
We extend the concept of monotonic searchability for selfstabilizing sy...
read it

Distributed Computation in the NodeCongested Clique
The Congested Clique model of distributed computing, which was introduce...
read it

Convex Hull Formation for Programmable Matter
We envision programmable matter as a system of nanoscale agents (called...
read it

Skeap & Leap: Scalable Distributed Priority Queues for constant and arbitrary Priorities
We propose two protocols for distributed priority queues (denoted by 'he...
read it

Breaking the (√(n)) Barrier: Fast Consensus under a Late Adversary
We study the consensus problem in a synchronous distributed system of n ...
read it

Skueue: A Scalable and Sequentially Consistent Distributed Queue
We propose a distributed protocol for a queue, called Skueue, which spre...
read it

Competitive Routing in Hybrid Communication Networks
Routing is a challenging problem for wireless ad hoc networks, especiall...
read it

SelfStabilizing Supervised PublishSubscribe Systems
In this paper we present two major results: First, we introduce the firs...
read it
Christian Scheideler
is this you? claim profile