Ragesh Jaiswal

According to our database1, Ragesh Jaiswal authored at least 44 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
FPT Approximation for Capacitated Sum of Radii.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Universal Weak Coreset.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Tight FPT Approximation for Socially Fair Clustering.
Inf. Process. Lett., August, 2023

Tight FPT approximation for constrained <i>k</i>-center and <i>k</i>-supplier.
Theor. Comput. Sci., 2023

A Quantum Approximation Scheme for k-Means.
CoRR, 2023

Clustering What Matters in Constrained Settings.
CoRR, 2023

Clustering What Matters in Constrained Settings: Improved Outlier to Outlier-Free Reductions.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
On the <i>k</i>-means/median cost function.
Inf. Process. Lett., 2022

2021
Tight FPT Approximation for Constrained k-Center and k-Supplier.
CoRR, 2021

FPT Approximation for Socially Fair Clustering.
CoRR, 2021

Hardness of Approximation for Euclidean k-Median.
Proceedings of the Approximation, 2021

2020
A note on the relation between XOR and Selective XOR lemmas.
Inf. Process. Lett., 2020

Multiplicative Rank-1 Approximation using Length-Squared Sampling.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

FPT Approximation for Constrained Metric k-Median/Means.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

On Sampling Based Algorithms for k-Means.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
Streaming PTAS for Binary 𝓁<sub>0</sub>-Low Rank Approximation.
CoRR, 2019

Streaming PTAS for Constrained k-Means.
CoRR, 2019

2018
Faster Algorithms for the Constrained k-means Problem.
Theory Comput. Syst., 2018

Sampling in Space Restricted Settings.
Algorithmica, 2018

Approximate Correlation Clustering Using Same-Cluster Queries.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Approximate Clustering with Same-Cluster Queries.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

Approximate Clustering.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017
On the k-Means/Median Cost Function.
CoRR, 2017

2016
Tight lower bound instances for k-means++ in two dimensions.
Theor. Comput. Sci., 2016

Simultaneous Secrecy and Reliability Amplification for a General Channel Model.
IACR Cryptol. ePrint Arch., 2016

2015
k-Means++ under approximation stability.
Theor. Comput. Sci., 2015

Improved analysis of D<sup>2</sup>-sampling based PTAS for k-means and other clustering problems.
Inf. Process. Lett., 2015

Noise Stable Halfspaces are Close to Very Small Juntas.
Chic. J. Theor. Comput. Sci., 2015

2014
Improved analysis of D2-sampling based PTAS for k-means and other Clustering problems.
CoRR, 2014

On Uniform Reductions between Direct Product and XOR Lemmas.
CoRR, 2014

A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems.
Algorithmica, 2014

A Tight Lower Bound Instance for k-means++ in Constant Dimension.
Proceedings of the Theory and Applications of Models of Computation, 2014

2013
A bad 2-dimensional instance for k-means++.
CoRR, 2013

2012
On the Distribution of the Fourier Spectrum of Halfspaces
CoRR, 2012

Congestion lower bounds for secure in-network aggregation.
Proceedings of the Fifth ACM Conference on Security and Privacy in Wireless and Mobile Networks, 2012

Analysis of k-Means++ for Separable Data.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2009
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification.
SIAM J. Comput., 2009

Chernoff-Type Direct Product Theorems.
J. Cryptol., 2009

Bounded Independence Fools Halfspaces.
Electron. Colloquium Comput. Complex., 2009

Security Amplification for InteractiveCryptographic Primitives.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Streaming k-means approximation.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, 2009

2008
New proofs of (new) Direct Product Theorems.
PhD thesis, 2008

Uniform Direct-Product Theorems: Simplified, Optimized, and Derandomized.
Electron. Colloquium Comput. Complex., 2008

2006
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006


  Loading...