Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification. - Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets (FOCS, 2006)

New proofs of (new) Direct Product Theorems. - Ragesh Jaiswal (2008)

Streaming k-means approximation. - Nir Ailon; Ragesh Jaiswal; Claire Monteleoni (NIPS, 2009)

Security Amplification for InteractiveCryptographic Primitives. - Yevgeniy Dodis; Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets (TCC, 2009)

Chernoff-Type Direct Product Theorems. - Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets (J. Cryptol., 2009)

Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification. - Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets (SIAM J. Comput., 2009)

Bounded Independence Fools Halfspaces. - Ilias Diakonikolas; Parikshit Gopalan; Ragesh Jaiswal; Rocco A. Servedio; Emanuele Viola (SIAM J. Comput., 2010)

Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. - Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets; Avi Wigderson (SIAM J. Comput., 2010)

Analysis of k-Means++ for Separable Data. - Ragesh Jaiswal; Nitin Garg (APPROX-RANDOM, 2012)

Congestion lower bounds for secure in-network aggregation. - Raghav Bhaskar; Ragesh Jaiswal; Sidharth Telang (WISEC, 2012)

On the Distribution of the Fourier Spectrum of Halfspaces - Ilias Diakonikolas; Ragesh Jaiswal; Rocco A. Servedio; Li-Yang Tan; Andrew Wan (CoRR, 2012)

A bad 2-dimensional instance for k-means++. - Ragesh Jaiswal; Prachi Jain; Saumya Yadav (CoRR, 2013)

A Tight Lower Bound Instance for k-means++ in Constant Dimension. - Anup Bhattacharya; Ragesh Jaiswal; Nir Ailon (TAMC, 2014)

A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems. - Ragesh Jaiswal; Amit Kumar 001; Sandeep Sen (Algorithmica, 2014)

On Uniform Reductions between Direct Product and XOR Lemmas. - Ragesh Jaiswal (CoRR, 2014)

Improved analysis of D2-sampling based PTAS for k-means and other Clustering problems. - Ragesh Jaiswal; Mehul Kumar; Pulkit Yadav (CoRR, 2014)

Noise Stable Halfspaces are Close to Very Small Juntas. - Ilias Diakonikolas; Ragesh Jaiswal; Rocco A. Servedio; Li-Yang Tan; Andrew Wan (Chic. J. Theor. Comput. Sci., 2015)

Improved analysis of D2-sampling based PTAS for k-means and other clustering problems. - Ragesh Jaiswal; Mehul Kumar; Pulkit Yadav (Inf. Process. Lett., 2015)

k-Means++ under approximation stability. - Manu Agarwal; Ragesh Jaiswal; Arindam Pal 001 (Theor. Comput. Sci., 2015)

Simultaneous Secrecy and Reliability Amplification for a General Channel Model. - Russell Impagliazzo; Ragesh Jaiswal; Valentine Kabanets; Bruce M. Kapron; Valerie King; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2016)

Tight lower bound instances for k-means++ in two dimensions. - Anup Bhattacharya; Ragesh Jaiswal; Nir Ailon (Theor. Comput. Sci., 2016)

On the k-Means/Median Cost Function. - Anup Bhattacharya; Ragesh Jaiswal (CoRR, 2017)

Approximate Clustering. - Ragesh Jaiswal; Sandeep Sen (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Approximate Clustering with Same-Cluster Queries. - Nir Ailon; Anup Bhattacharya; Ragesh Jaiswal; Amit Kumar 001 (ITCS, 2018)

Approximate Correlation Clustering Using Same-Cluster Queries. - Nir Ailon; Anup Bhattacharya; Ragesh Jaiswal (LATIN, 2018)

Sampling in Space Restricted Settings. - Anup Bhattacharya; Davis Issac; Ragesh Jaiswal; Amit Kumar 001 (Algorithmica, 2018)

Faster Algorithms for the Constrained k-means Problem. - Anup Bhattacharya; Ragesh Jaiswal; Amit Kumar 001 (Theory Comput. Syst., 2018)

Streaming PTAS for Constrained k-Means. - Dishant Goyal; Ragesh Jaiswal; Amit Kumar 001 (CoRR, 2019)

Streaming PTAS for Binary 𝓁0-Low Rank Approximation. - Anup Bhattacharya; Dishant Goyal; Ragesh Jaiswal; Amit Kumar 001 (CoRR, 2019)

On Sampling Based Algorithms for k-Means. - Anup Bhattacharya; Dishant Goyal; Ragesh Jaiswal; Amit Kumar 001 (FSTTCS, 2020)

FPT Approximation for Constrained Metric k-Median/Means. - Dishant Goyal; Ragesh Jaiswal; Amit Kumar 001 (IPEC, 2020)

Multiplicative Rank-1 Approximation using Length-Squared Sampling. - Ragesh Jaiswal; Amit Kumar 001 (SOSA, 2020)

A note on the relation between XOR and Selective XOR lemmas. - Ragesh Jaiswal (Inf. Process. Lett., 2020)

Hardness of Approximation for Euclidean k-Median. - Anup Bhattacharya; Dishant Goyal; Ragesh Jaiswal (APPROX-RANDOM, 2021)

FPT Approximation for Socially Fair Clustering. - Dishant Goyal; Ragesh Jaiswal (CoRR, 2021)

Tight FPT Approximation for Constrained k-Center and k-Supplier. - Dishant Goyal; Ragesh Jaiswal (CoRR, 2021)

On the k-means/median cost function. - Anup Bhattacharya; Yoav Freund; Ragesh Jaiswal (Inf. Process. Lett., 2022)

Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions. - Ragesh Jaiswal; Amit Kumar 001 (ISAAC, 2023)

Tight FPT approximation for constrained k-center and k-supplier. - Dishant Goyal; Ragesh Jaiswal (Theor. Comput. Sci., 2023)

Tight FPT Approximation for Socially Fair Clustering. - Dishant Goyal; Ragesh Jaiswal (Inf. Process. Lett., 2023)

Universal Weak Coreset. - Ragesh Jaiswal; Amit Kumar 001 (AAAI, 2024)

FPT Approximation for Capacitated Sum of Radii. - Ragesh Jaiswal; Amit Kumar 001; Jatin Yadav (ITCS, 2024)

Quantum (Inspired) D2-sampling with Applications. - Ragesh Jaiswal; Poojan Chetan Shah (CoRR, 2024)

Robust-Sorting and Applications to Ulam-Median. - Ragesh Jaiswal; Amit Kumar 001; Jatin Yadav (ICALP, 2025)

Quantum (Inspired) D2-sampling with Applications. - Poojan Chetan Shah; Ragesh Jaiswal (ICLR, 2025)

A New Rejection Sampling Approach to k-means++ With Improved Trade-Offs. - Poojan Chetan Shah; Shashwat Agrawal; Ragesh Jaiswal (CoRR, 2025)

Clustering What Matters in Constrained Settings. - Ragesh Jaiswal; Amit Kumar 001 (Algorithmica, 2025)