| File systems fated for senescence? nonsense, says science! A Conway, A Bakshi, Y Jiao, W Jannen, Y Zhan, J Yuan, MA Bender, ... 15th USENIX Conference on File and Storage Technologies (FAST 17), 45-58, 2017 | 63 | 2017 |
| Learning two layer rectified neural networks in polynomial time A Bakshi, R Jayaram, DP Woodruff Conference on Learning Theory, 195-268, 2019 | 44 | 2019 |
| Robust linear regression: Optimal rates in polynomial time A Bakshi, A Prasad Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 28 | 2021 |
| List-decodable subspace recovery: Dimension independent error in polynomial time A Bakshi, PK Kothari Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 24 | 2021 |
| Sublinear time low-rank approximation of distance matrices A Bakshi, DP Woodruff arXiv preprint arXiv:1809.06986, 2018 | 24* | 2018 |
| Outlier-robust clustering of non-spherical mixtures A Bakshi, P Kothari arXiv preprint arXiv:2005.02970, 2020 | 21 | 2020 |
| Robustly learning mixtures of k arbitrary Gaussians A Bakshi, I Diakonikolas, H Jia, DM Kane, PK Kothari, SS Vempala Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 14 | 2022 |
| A novel feature selection and extraction technique for classification K Goel, R Vohra, A Bakshi 2014 14th International Conference on Frontiers in Handwriting Recognition …, 2014 | 13 | 2014 |
| Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures A Bakshi, I Diakonikolas, SB Hopkins, D Kane, S Karmalkar, PK Kothari 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 11 | 2020 |
| Testing positive semi-definiteness via random submatrices A Bakshi, N Chepurko, R Jayaram 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 11 | 2020 |
| Robust and sample optimal algorithms for PSD low rank approximation A Bakshi, N Chepurko, DP Woodruff 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020 | 10 | 2020 |
| Chance constraint based multi-objective vendor selection using NSGAII R Aggarwal, A Bakshi Procedia Computer Science 48, 699-705, 2015 | 9 | 2015 |
| Non dominated sorting genetic algorithm for chance constrained supplier selection model with volume discounts R Aggarwal, A Bakshi Asian Conference on Intelligent Information and Database Systems, 465-474, 2014 | 8 | 2014 |
| Robust communication-optimal distributed clustering algorithms P Awasthi, A Bakshi, MF Balcan, C White, D Woodruff arXiv preprint arXiv:1703.00830, 2017 | 6 | 2017 |
| How to fragment your file system A Conway, A Bakshi, Y Jiao, Y Zhan, MA Bender, W Jannen, R Johnson, ... login Usenix Mag. 42 (2), 2017 | 6* | 2017 |
| Learning a Latent Simplex in Input-Sparsity Time A Bakshi, C Bhattacharyya, R Kannan, DP Woodruff, S Zhou arXiv preprint arXiv:2105.08005, 2021 | 4 | 2021 |
| Weighted maximum independent set of geometric objects in turnstile streams A Bakshi, N Chepurko, DP Woodruff arXiv preprint arXiv:1902.10328, 2019 | 2 | 2019 |
| Low-rank approximation with 1/𝜖1/3 matrix-vector products A Bakshi, KL Clarkson, DP Woodruff Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | | 2022 |
| Analytic Techniques for Robust Algorithm Design A Bakshi | | |
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
