12 citations · 42 across the 18 of their papers we have counts for
7 papers · 1 filter
Move Complexity of a Self-Stabilizing Algorithm for Maximal Independent Sets
Volker Turau
is a self-stabilizing algorithm that computes a maximal independent set in a finite graph with approximation ratio . In this note we show that und…
Synchronous Concurrent Broadcasts for Intermittent Channels with Bounded Capacities
Volker Turau
In this work we extend the recently proposed synchronous broadcast algorithm amnesiac flooding to the case of intermittent communication channels. In amnesiac flooding a node forwa…
Analysis of Amnesiac Flooding
Volker Turau
The broadcast operation in distributed systems is used to spread information located at some nodes to all other nodes. This operation is often realized by flooding, where the sourc…
Concurrent Distributed Serving with Mobile Servers
Abdolhamid Ghodselahi, Fabian Kuhn, Volker Turau
This paper introduces a new resource allocation problem in distributed computing called distributed serving with mobile servers (DSMS). In DSMS, there are identical mobile serv…
A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time
Volker Turau
It is known for some time that a random graph contains w.h.p. a Hamiltonian cycle if is larger than the critical value . The…
Analyzing the Fault-Containment Time of Self-Stabilizing Algorithms - A Case Study for Graph Coloring
Volker Turau
The paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms in the message passing model. For a new Delta+…
Opacity of Memory Management in Software Transactional Memory
Holger Machens, Volker Turau
Opacity of Transactional Memory is proposed to be established by incremental validation. Quiescence in terms of epoch-based memory reclamation is applied to deal with doomed transa…