1383 search results - page 259 / 277 » On the Complexity of the Interlace Polynomial |
STOC
2006
ACM
16 years 10 hour ago
2006
ACM
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
106
click to vote
STOC
2004
ACM
16 years 10 min ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
105
click to vote
STOC
2004
ACM
16 years 8 min ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
STOC
2003
ACM
16 years 6 min ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
120
click to vote
PODS
2008
ACM
15 years 11 months ago
2008
ACM
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...