FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
This paper deals with balls and bins processes related to randomized load balancing, dynamic resource allocation, and hashing. Suppose
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that ...
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
FOCS
1999
IEEE
14 years 4 months ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...