126 search results - page 1 / 26 » The cost of fault tolerance in multi-party communication com... |
PODC
2012
ACM
11 years 7 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
COCO
2003
Springer
13 years 9 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
ICDCS
2010
IEEE
13 years 8 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
SPAA
2003
ACM
13 years 10 months ago
2003
ACM
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
DATE
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper we present an approach to the design optimization of faulttolerant embedded systems for safety-critical applications. Processes are statically scheduled and communic...