425 search results - page 6 / 85 » On the additive constant of the k-server Work Function Algor... |
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
This paper investigates the discovery of conditional functional dependencies (CFDs). CFDs are a recent extension of functional dependencies (FDs) by supporting patterns of semantic...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
WINE
2007
Springer
14 years 1 months ago
2007
Springer
In addition to useful Economic interpretation, auction based algorithms are generally found to be efficient. In this note, we observe that the auction-based mechanism can also be u...
DISCO
1993
13 years 11 months ago
1993
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...