11345 search results - page 2193 / 2269 » Foundations of Computer Science |
138
Voted
STOC
2004
ACM
16 years 2 months 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...
129
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
In this paper we extend the study of flow-energy scheduling to a model that allows both sleep management and speed scaling. Our main result is a sleep management algorithm called I...
152
click to vote
ICALP
2009
Springer
16 years 2 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...
119
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
123
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...