Sciweavers

148 search results - page 1 / 30
» A lower bound for distributed averaging algorithms on the li...
Sort
View
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
12 years 11 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis
CCCG
2010
13 years 6 months ago
A new algorithm and improved lower bound for point placement on a line in two rounds
In this paper we show how to construct in 2 rounds a line-rigid point placement graph of size 4n/3+O(1) from small graphs called 6:6 jewels, an extension of the 4:4 jewel of [3]. ...
Md. Shafiul Alam, Asish Mukhopadhyay
SODA
1992
ACM
96views Algorithms» more  SODA 1992»
13 years 5 months ago
Lower Bounds for On-Line Graph Coloring
Magnús M. Halldórsson, Mario Szegedy
SPAA
2005
ACM
13 years 10 months ago
Randomization does not reduce the average delay in parallel packet switches
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...
Hagit Attiya, David Hay