112 search results - page 5 / 23 » Rounds in Communication Complexity Revisited |
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Measurement of the delay is an important and common problem in communication over packet networks. The endto-end and the round trip delay are among the factors directly impacting ...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
INFOCOM
2000
IEEE
14 years 1 days ago
2000
IEEE
Abstract—The innovative techniques of TCP Vegas have been the subject of much debate in recent years. Several studies have reported that TCP Vegas provides better performance tha...