50 search results - page 8 / 10 » On the bit communication complexity of randomized rumor spre... |
70
Voted
PICS
2001
15 years 1 months ago
2001
A first television system based on the Autosophy information theory is now being tested. The new television marks a major theoretical break from conventional television based on t...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
115
Voted
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...