Sotabase

Career

· Associate Professor, Indian Institute of Technology Delhi2018–
· Assistant Professor, Indian Institute of Technology Delhi2010–2018
· Postdoctoral Research Scientist, Columbia University2008–2010
· Doctoral Degree in Computer Science and Engineering, University of California San Diego2008–
· Master of Philosophy in Computer Science and Engineering, University of California San Diego2006–
· Master of Science in Computer Science and Engineering, University of California San Diego2005–
· Undergraduate Degree in Computer Science and Engineering, Indian Institute of Technology Kanpur2003–
· Research/Teaching Assistant, University of California San Diego2003–2008

Publications (54)

Streaming k-means approximation
Neural Information Processing Systems · 2009
189
cited
Bounded Independence Fools Halfspaces
2009 50th Annual IEEE Symposium on Foundations of Computer Science · 2009
134
cited
Uniform direct product theorems: simplified, optimized, and derandomized
SIAM journal on computing (Print) · 2008
99
cited
A Simple D2-Sampling Based PTAS for k-Means and Other Clustering Problems
Algorithmica · 2012
67
cited
Faster Algorithms for the Constrained k-means Problem
Theory of Computing Systems · 2015
56
cited
Approximate List-Decoding of Direct Product Codes and Uniform Hardness Amplification
SIAM journal on computing (Print) · 2009
53
cited
Chernoff-Type Direct Product Theorems
Journal of Cryptology · 2007
42
cited
Approximate Clustering with Same-Cluster Queries
Information Technology Convergence and Services · 2017
32
cited
Approximate Correlation Clustering Using Same-Cluster Queries
Latin American Symposium on Theoretical Informatics · 2017
28
cited
Improved analysis of D2-sampling based PTAS for k-means and other clustering problems
Information Processing Letters · 2014
28
cited
Analysis of k-Means++ for Separable Data
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2012
25
cited
Tight FPT Approximation for Socially Fair Clustering
Information Processing Letters · 2021
17
cited
Tight FPT Approximation for Constrained k-Center and k-Supplier
Theoretical Computer Science · 2021
15
cited
Security Amplification for InteractiveCryptographic Primitives
Theory of Cryptography Conference · 2009
13
cited
FPT Approximation for Constrained Metric k-Median/Means
International Symposium on Parameterized and Exact Computation · 2020
12
cited
Tight lower bound instances for k-means++ in two dimensions
Theoretical Computer Science · 2016
11
cited
An O ∗ (1 . 0821 n )-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
2014
10
cited
A Tight Lower Bound Instance for k-means++ in Constant Dimension
Theory and Applications of Models of Computation · 2014
10
cited
Hardness of Approximation of Euclidean k-Median
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2020
10
cited
On Sampling Based Algorithms for k-Means
Foundations of Software Technology and Theoretical Computer Science · 2020
9
cited
Sotabase
Ragesh Jaiswal | Researcher Profile | Sotabase | Sotabase