TSP
2008
14 years 5 days ago
2008
Modern digital subscriber line (DSL) networks suffer from crosstalk among different lines in the same cable bundle. This crosstalk can lead to a major performance degradation. By b...
CORR
2007
Springer
14 years 8 days ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
SODA
2003
ACM
14 years 1 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
OPODIS
2004
14 years 1 months ago
2004
This paper introduces SERH
FORTE
2010
14 years 1 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
ALENEX
2007
14 years 1 months ago
2007
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
CIAC
2006
Springer
14 years 4 months ago
2006
Springer
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
ITICSE
1999
ACM
14 years 4 months ago
1999
ACM
We present our work on building interactive continuous visualisations of distributed algorithms for educational purposes. The animations are comprised by a set of visualisation wi...
ICNP
2002
IEEE
14 years 5 months ago
2002
IEEE
We consider several distributed collaborative key agreement protocols for dynamic peer groups. This problem has several important characteristics which make it different from trad...
ICALP
2003
Springer
14 years 5 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...