1688 search results - page 302 / 338 » The Complexity of Rationalizing Matchings |
103
click to vote
CRYPTO
2001
Springer
15 years 3 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...
105
click to vote
IPPS
1998
IEEE
15 years 3 months ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
115
click to vote
STACS
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
FOCS
2004
IEEE
15 years 2 months ago
2004
IEEE
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
ESAW
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...