Sciweavers

STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 11 months ago
Recognizing string graphs in NP
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...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
STOC
2002
ACM
123views Algorithms» more  STOC 2002»
14 years 11 months ago
Optimal rate-based scheduling on multiprocessors
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...
Anand Srinivasan, James H. Anderson
STOC
2002
ACM
115views Algorithms» more  STOC 2002»
14 years 11 months ago
Reimer's inequality and tardos' conjecture
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...
Clifford D. Smyth
STOC
2002
ACM
111views Algorithms» more  STOC 2002»
14 years 11 months ago
The price of anarchy is independent of the network topology
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...
Tim Roughgarden
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
14 years 11 months ago
Resolution lower bounds for the weak pigeonhole principle
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).
Ran Raz
STOC
2002
ACM
117views Algorithms» more  STOC 2002»
14 years 11 months ago
Hardness amplification within NP
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...
Ryan O'Donnell
STOC
2002
ACM
91views Algorithms» more  STOC 2002»
14 years 11 months ago
Girth and euclidean distortion
Nathan Linial, Avner Magen, Assaf Naor
STOC
2002
ACM
159views Algorithms» more  STOC 2002»
14 years 11 months ago
On the composition of authenticated byzantine agreement
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...
Yehuda Lindell, Anna Lysyanskaya, Tal Rabin
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
14 years 11 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl