STOC
2001
ACM
14 years 12 months ago
2001
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is als...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2n ), (for some global constant > 0).
STOC
2002
ACM
14 years 12 months ago
2002
ACM
We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant ? > 0 such that if there is some l...
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
STOC
2002
ACM
14 years 12 months ago
2002
ACM
A fundamental problem of distributed computing is that of simulating a secure broadcast channel, within the setting of a point-to-point network. This problem is known as Byzantine...