608 search results - page 4 / 122 » On Dependent Randomized Rounding Algorithms |
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
PDCAT
2005
Springer
14 years 1 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
CRYPTO
2003
Springer
14 years 22 days ago
2003
Springer
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic t...
STOC
1991
ACM
13 years 11 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...