67 search results - page 2 / 14 » Solving MAX-r-SAT Above a Tight Lower Bound |
FOCS
1993
IEEE
13 years 9 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
CRYPTO
2006
Springer
13 years 8 months ago
2006
Springer
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...