2924 search results - page 69 / 585 » Lower Bounds in Distributed Computing |
IAJIT
2011
13 years 11 days ago
2011
: Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compa...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
CRYPTO
2001
Springer
14 years 1 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
EUROPAR
2010
Springer
13 years 10 months ago
2010
Springer