614 search results - page 36 / 123 » Local Computation: Lower and Upper Bounds |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
111
Voted
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
CCCG
2009
14 years 11 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
PODC
2005
ACM
15 years 3 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
DCC
2010
IEEE
14 years 10 months ago
2010
IEEE
We derive lower and upper bounds for the size of a hyperoval of a finite polar space of rank r {2, 3}. We give a computer-free proof for the uniqueness, up to isomorphism, of the...