| Streaming k-means approximation N Ailon, R Jaiswal, C Monteleoni Advances in neural information processing systems 22, 2009 | 279 | 2009 |
| Bounded independence fools halfspaces I Diakonikolas, P Gopalan, R Jaiswal, RA Servedio, E Viola SIAM Journal on Computing 39 (8), 3441-3462, 2010 | 164 | 2010 |
| Uniform direct product theorems: simplified, optimized, and derandomized R Impagliazzo, R Jaiswal, V Kabanets, A Wigderson Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, 579-588, 2008 | 119 | 2008 |
| A simple D 2-sampling based PTAS for k-means and other clustering problems R Jaiswal, A Kumar, S Sen Algorithmica 70 (1), 22-46, 2014 | 73 | 2014 |
| Approximate list-decoding of direct product codes and uniform hardness amplification R Impagliazzo, R Jaiswal, V Kabanets SIAM Journal on Computing 39 (2), 564-605, 2009 | 65 | 2009 |
| Faster Algorithms for the Constrained k-means Problem A Bhattacharya, R Jaiswal, A Kumar Theory of computing systems 62, 93-115, 2018 | 62 | 2018 |
| Security Amplification for Interactive Cryptographic Primitives Y Dodis, R Impagliazzo, R Jaiswal, V Kabanets Theory of Cryptography: 6th Theory of Cryptography Conference, TCC 2009, San …, 2009 | 39 | 2009 |
| Approximate clustering with same-cluster queries N Ailon, A Bhattacharya, R Jaiswal, A Kumar arXiv preprint arXiv:1704.01862, 2017 | 38 | 2017 |
| Approximate correlation clustering using same-cluster queries N Ailon, A Bhattacharya, R Jaiswal Latin American Symposium on Theoretical Informatics, 14-27, 2018 | 31 | 2018 |
| Tight lower bound instances for k-means++ in two dimensions A Bhattacharya, R Jaiswal, N Ailon Theoretical Computer Science 634, 55-66, 2016 | 29* | 2016 |
| Improved analysis of D2-sampling based PTAS for k-means and other clustering problems R Jaiswal, M Kumar, P Yadav Information Processing Letters 115 (2), 100-103, 2015 | 29 | 2015 |
| Tight fpt approximation for socially fair clustering D Goyal, R Jaiswal Information Processing Letters 182, 106383, 2023 | 28* | 2023 |
| Analysis of k-Means++ for Separable Data R Jaiswal, N Garg International Workshop on Approximation Algorithms for Combinatorial …, 2012 | 27 | 2012 |
| Chernoff-type direct product theorems R Impagliazzo, R Jaiswal, V Kabanets Advances in Cryptology-CRYPTO 2007: 27th Annual International Cryptology …, 2007 | 27 | 2007 |
| Chernoff-type direct product theorems R Impagliazzo, R Jaiswal, V Kabanets Journal of Cryptology 22 (1), 75-92, 2009 | 25 | 2009 |
| k-means++ under Approximation Stability M Agarwal, R Jaiswal, A Pal Theoretical Computer Science 588, 37-51, 2015 | 24 | 2015 |
| Modern factoring algorithms K Bimpikis, R Jaiswal University of California, San Diego, 2005 | 18 | 2005 |
| Tight FPT approximation for constrained k-center and k-supplier D Goyal, R Jaiswal Theoretical Computer Science 940, 190-208, 2023 | 15 | 2023 |
| FPT Approximation for Constrained Metric -Median/Means D Goyal, R Jaiswal, A Kumar arXiv preprint arXiv:2007.11773, 2020 | 14 | 2020 |
| On sampling based algorithms for k-means A Bhattacharya, D Goyal, R Jaiswal, A Kumar 40th IARCS Annual Conference on Foundations of Software Technology and …, 2020 | 14* | 2020 |
