Publications

5 results at ACM-SIAM 2011

Hardness results for agnostically learning low-degree polynomial threshold functions
- - Ilias Diakonikolas
  - Ryan O'Donnell
  - et al.
- 2011
- ACM-SIAM 2011
Submodular maximization by simulated annealing
- - Shayan Oveis Gharan
  - Jan Vondrák
- 2011
- ACM-SIAM 2011
The matroid median problem
- - Ravishankar Krishnaswamy
  - Amit Kumar
  - et al.
- 2011
- ACM-SIAM 2011
Multi-budgeted matchings and matroid intersection via dependent rounding
- - Chandra Chekuri
  - Jan Vondrák
  - et al.
- 2011
- ACM-SIAM 2011
The rigidity transition in random graphs
- - Shiva Prasad Kasiviswanathan
  - Cristopher Moore
  - et al.
- 2011
- ACM-SIAM 2011

Hardness results for agnostically learning low-degree polynomial threshold functions