358 search results - page 42 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
117
click to vote
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
115
Voted
PODC
2004
ACM
15 years 7 months ago
2004
ACM
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
121
click to vote
DAC
2006
ACM
15 years 8 months ago
2006
ACM
duce system weight and volume, increase operating lifetime, The recent explosion in capability of embedded and portable decrease maintenance costs, and open new frontiers for inele...
112
click to vote
IPPS
2008
IEEE
15 years 8 months ago
2008
IEEE
An architectural framework is studied that can perform dynamic reconfiguration. A basic objective is to dynamically reconfigure the architecture so that its configuration is well ...
127
click to vote
PVM
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. The MPI standard provides a way to send and receive complex combinations of datatypes (e.g., integers and doubles) with a single communication operation. The MPI standard...