Publications

5 results at FOCS 2007

The computational hardness of estimating edit distance
- - Alexandr Andoni
  - Robert Krauthgamer
- 2007
- FOCS 2007
Non-preemptive min-sum scheduling with resource augmentation
- - Nikhil Bansal
  - Ho-Leung Chan
  - et al.
- 2007
- FOCS 2007
A primal-dual randomized algorithm for weighted paging
- - Nikhil Bansal
  - Niv Buchbinder
  - et al.
- 2007
- FOCS 2007
Local global tradeoffs in metric embeddings
- - Moses Charikar
  - Konstantin Makarychev
  - et al.
- 2007
- FOCS 2007
On the advantage over random for maximum acyclic subgraph
- - Moses Charikar
  - Konstantin Makarychev
  - et al.
- 2007
- FOCS 2007

The computational hardness of estimating edit distance