| Publication | Date of Publication | Type |
|---|
| Residual based sampling for online low rank approximation | 2025-08-12 | Paper |
| Smoothed analysis in unsupervised learning via decoupling | 2025-08-12 | Paper |
| Online learning and bandits with queried hints | 2024-09-25 | Paper |
Smoothed analysis for tensor methods in unsupervised learning
Mathematical Programming. Series A. Series B | 2022-06-14 | Paper |
Low rank approximation in the presence of outliers
(available as arXiv preprint) | 2021-08-04 | Paper |
Sublinear algorithms for MAXCUT and correlation clustering
(available as arXiv preprint) | 2021-07-28 | Paper |
| Non-negative sparse regression and column subset selection with \(L_1\) error | 2021-06-15 | Paper |
Approximating a planar convex set using a sparse grid
Information Processing Letters | 2019-09-20 | Paper |
Minimum makespan scheduling with low rank processing times
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Polynomial integrality gaps for strong SDP relaxations of densest \(k\)-subgraph
(available as arXiv preprint) | 2019-05-10 | Paper |
| Polynomial integrality gaps for strong SDP relaxations of densest \(k\)-subgraph | 2019-05-10 | Paper |
| On binary embedding using circulant matrices | 2018-11-22 | Paper |
On binary embedding using circulant matrices
(available as arXiv preprint) | 2018-11-22 | Paper |
Expanders via local edge flips
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| scientific article; zbMATH DE number 6783411 (Why is no real title available?) | 2017-09-29 | Paper |
Centrality of trees for capacitated \(k\)-center
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Smoothed analysis of tensor decompositions
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Optimal hitting sets for combinatorial shapes
Theory of Computing | 2014-10-06 | Paper |
Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Centrality of trees for capacitated \(k\)-center
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Unconditional differentially private mechanisms for linear queries
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
On quadratic programming with a ratio objective
Automata, Languages, and Programming | 2013-08-12 | Paper |
Optimal Hitting Sets for Combinatorial Shapes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
