2095 search results - page 381 / 419 » Improved pebbling bounds |
PODC
2009
ACM
14 years 10 months ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
STOC
2006
ACM
14 years 10 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
MOBIHOC
2004
ACM
14 years 9 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
SOSP
2007
ACM
14 years 6 months ago
2007
ACM
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...