4 Result(s)
within
Chapter
Stefan Dobrev
Computer Science
Information Systems and Communication Service
-
Chapter and Conference Paper
Improved Lower Bounds for Shoreline Search
Shoreline search is a natural and well-studied generalisation of the classical cow-path problem: k initially co-located unit speed agents are searching for a line (called shoreline) in 2 dimensional Euclidean spa...
-
Chapter and Conference Paper
Exploration of Time-Varying Connected Graphs with Silent Agents
Exploration is a fundamental task in mobile computing. We study the version where a group of cooperating agents is situated in a graph, and the task is to make sure that every vertex of the graph is visited by...
-
Chapter and Conference Paper
Leader Election in Extremely Unreliable Rings and Complete Networks
In this paper we investigate deterministic leader election under the simple threshold model of omission dynamic faults: The computation is performed in synchronous steps; if the algorithm sends m messages in one ...
-
Chapter and Conference Paper
Yet Another Modular Technique for Efficient Leader Election
In this paper we present a general and still flexible modular technique for the design of efficient leader election algorithms in N-node networks. Our approach can be viewed as a generalization of the previous me...
