STOC
2007
ACM
14 years 12 months ago
2007
ACM
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...
STOC
2007
ACM
14 years 12 months ago
2007
ACM
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...
STOC
2007
ACM
14 years 12 months ago
2007
ACM
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...
STOC
2007
ACM
14 years 12 months ago
2007
ACM
STOC
2007
ACM
14 years 12 months ago
2007
ACM
STOC
2007
ACM
14 years 12 months ago
2007
ACM
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...
STOC
2007
ACM
14 years 12 months ago
2007
ACM
STOC
2007
ACM
14 years 12 months ago
2007
ACM
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...
STOC
2007
ACM
14 years 12 months ago
2007
ACM
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...
STOC
2007
ACM
14 years 12 months ago
2007
ACM
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...