Name
Affiliation
Papers
RAGESH JAISWAL
Columbia Univ, Dept Comp Sci, New York, NY 10027 USA
34
Collaborators
Citations 
PageRank 
37
220
18.33
Referers 
Referees 
References 
381
326
338
Search Limit
100381
Title
Citations
PageRank
Year
On the k-means/median cost function00.342022
Hardness of Approximation for Euclidean k-Median.00.342021
Hardness of Approximation for Euclidean k-Median.00.342021
Multiplicative Rank-1 Approximation using Length-Squared Sampling.00.342020
FPT Approximation for Constrained Metric k-Median/Means.00.342020
On Sampling Based Algorithms for k-Means.00.342020
A note on the relation between XOR and Selective XOR lemmas00.342019
Approximate Correlation Clustering Using Same-Cluster Queries.00.342018
Approximate Clustering with Same-Cluster Queries.30.452018
On the k-Means/Median Cost Function.00.342017
Faster Algorithms for the Constrained k-Means Problem.60.412016
Tight lower bound instances for k-means++ in two dimensions00.342016
Noise Stable Halfspaces are Close to Very Small Juntas.00.342016
Simultaneous Secrecy and Reliability Amplification for a General Channel Model.00.342016
k -Means++ under approximation stability30.392015
A Tight Lower Bound Instance for k-means plus plus in Constant Dimension30.472014
Improved analysis of D2-sampling based PTAS for k-means and other clustering problems.00.342014
Sampling in Space Restricted Settings.10.372014
On Uniform Reductions between Direct Product and XOR Lemmas.00.342014
k-means++ under Approximation Stability.70.522013
A bad 2-dimensional instance for k-means++.00.342013
An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3.10.362013
A Simple D 2-Sampling Based PTAS for k-Means and Other Clustering Problems.30.402012
On the Distribution of the Fourier Spectrum of Halfspaces00.342012
Congestion lower bounds for secure in-network aggregation00.342012
Analysis of k-Means++ for Separable Data.90.642012
A Simple D2-Sampling Based PTAS for k-Means and Other Clustering Problems180.842012
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized341.592010
Bounded Independence Fools Halfspaces251.072010
Security Amplification for InteractiveCryptographic Primitives10.372009
Streaming k-means approximation.602.022009
Chernoff-Type Direct Product Theorems210.962009
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification10.352009
Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification241.372006