Sciweavers

42 search results - page 9 / 9
» Component Evolution in General Random Intersection Graphs
Sort
View
PODC
2005
ACM
13 years 11 months ago
Routing complexity of faulty networks
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...
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
14 years 5 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami