1612 search results - page 216 / 323 » Analysing Randomized Distributed Algorithms |
118
click to vote
ICDCS
2010
IEEE
15 years 6 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
143
click to vote
COCO
2008
Springer
15 years 4 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
135
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
147
click to vote
MIDDLEWARE
2004
Springer
15 years 7 months ago
2004
Springer
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
115
Voted
DSN
2005
IEEE
15 years 8 months ago
2005
IEEE
This paper realizes techniques supporting the position that strategies for resource location and discovery in distributed systems should be both perturbation-resistant and overlay...