90
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
92
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
121
Voted
STOC
2007
ACM
16 years 3 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...
75
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
122
Voted
STOC
2007
ACM
16 years 3 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...
117
Voted
STOC
2007
ACM
16 years 3 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...
118
Voted
STOC
2007
ACM
16 years 3 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...
STOC
2007
ACM
16 years 3 months ago
2007
ACM
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
107
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
101
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM