Publications

9 results at FOCS 2011

The Grothendieck constant is strictly smaller than Krivine's bound
- - Mark Braverman
  - Konstantin Makarychev
  - et al.
- 2011
- FOCS 2011
A polylogarithmic-competitive algorithm for the k-server problem
- - Nikhil Bansal
  - Niv Buchbinder
  - et al.
- 2011
- FOCS 2011
(1 + ε)-approximate sparse recovery
- - Eric Price
  - David P. Woodruff
- 2011
- FOCS 2011
On the power of adaptivity in sparse recovery
- - Piotr Indyk
  - Eric Price
  - et al.
- 2011
- FOCS 2011
Min-max graph partitioning and small set expansion
- - Nikhil Bansal
  - Uriel Feige
  - et al.
- 2011
- FOCS 2011
Near optimal column-based matrix reconstruction
- - Christos Boutsidis
  - Petros Drineas
  - et al.
- 2011
- FOCS 2011
How to play unique games against a semi-random adversary: Study of semi-random models of unique games
- - Alexandra Kolla
  - Konstantin Makarychev
  - et al.
- 2011
- FOCS 2011
Limitations of randomized mechanisms for combinatorial auctions
- - Shaddin Dughmi
  - Jan Vondrák
- 2011
- FOCS 2011
Fully homomorphic encryption without squashing using depth-3 arithmetic circuits
- - Craig Gentry
  - Shai Halevi
- 2011
- FOCS 2011