112 search results - page 7 / 23 » Rounds in Communication Complexity Revisited |
STOC
2010
ACM
15 years 4 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
ICNS
2007
IEEE
15 years 6 months ago
2007
IEEE
Complexity of distributed real-time applications such as automotive electronics has increased dramatically over the last couple of years. As a result, developing communication pro...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
105
click to vote
OPODIS
2008
15 years 1 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
CLUSTER
2001
IEEE
15 years 3 months ago
2001
IEEE
In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a po...