STOC
2003
ACM
14 years 11 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
STOC
2003
ACM
14 years 11 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
STOC
2003
ACM
14 years 11 months ago
2003
ACM
STOC
2003
ACM
14 years 11 months ago
2003
ACM
STOC
2003
ACM
14 years 11 months ago
2003
ACM