Sciweavers

STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 4 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 4 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 4 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 4 months ago
Verifying and decoding in constant depth
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...
STOC
2007
ACM
85views Algorithms» more  STOC 2007»
14 years 4 months ago
Faster integer multiplication
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
Martin Fürer
STOC
2007
ACM
104views Algorithms» more  STOC 2007»
14 years 4 months ago
Optimal suffix selection
Gianni Franceschini, S. Muthukrishnan
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 4 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 4 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
STOC
2007
ACM
128views Algorithms» more  STOC 2007»
14 years 4 months ago
Iteratively constructing preconditioners via the conjugate gradient method
We consider the problem of solving a symmetric, positive definite system of linear equations. The most well-known and widely-used method for solving such systems is the preconditi...
John Dunagan, Nicholas J. A. Harvey