Algorithms | Sciweavers

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

claim paper

Read More »

11

click to vote

STOC
2007
ACM

104views Algorithms» more STOC 2007»

Optimal suffix selection

14 years 5 months ago

Download www.cs.rutgers.edu

Gianni Franceschini, S. Muthukrishnan

claim paper

Read More »

18

click to vote

STOC
2007
ACM

100views Algorithms» more STOC 2007»

Reordering buffers for general metric spaces

14 years 5 months ago

Download www.dcs.warwick.ac.uk

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...

claim paper

Read More »

10

click to vote

STOC
2007
ACM

101views Algorithms» more STOC 2007»

The price of privacy and the limits of LP decoding

14 years 5 months ago

Download delivery.acm.org

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

claim paper

Read More »

17

click to vote

STOC
2007
ACM

128views Algorithms» more STOC 2007»

Iteratively constructing preconditioners via the conjugate gradient method

14 years 5 months ago

Download research.microsoft.com

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

claim paper

Read More »

10

click to vote

STOC
2007
ACM

109views Algorithms» more STOC 2007»

Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads

14 years 5 months ago

Download ect.bell-labs.com

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...

Matthew Andrews, Kyomin Jung, Alexander L. Stolyar

claim paper

Read More »

12

click to vote

STOC
2007
ACM

91views Algorithms» more STOC 2007»

Polynomial flow-cut gaps and hardness of directed cut problems

14 years 5 months ago