59 search results - page 12 / 12 » stoc 2002 |
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
TOC
2008
13 years 5 months ago
2008
: Ahlswede and Winter [IEEE Trans. Inf. Th. 2002] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound ...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...