13306 search results - page 337 / 2662 » Theoretical Computer Science |
193
click to vote
SPIN
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. This paper describes three program transformations that extend the scope of model checkers for Java programs to include distributed programs, i.e., multi-process programs...
193
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice
155
Voted
FOCS
1999
IEEE
15 years 11 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...
169
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
166
click to vote
RANDOM
1999
Springer
15 years 11 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...