| Publication | Date of Publication | Type |
|---|
| On sampling based algorithms for \(k\)-means | 2026-03-23 | Paper |
| FPT approximation for capacitated sum of radii | 2025-11-04 | Paper |
| Multiplicative rank-1 approximation using length-squared sampling | 2024-05-14 | Paper |
Hardness of approximation for Euclidean \(k\)-median
(available as arXiv preprint) | 2023-11-20 | Paper |
FPT Approximation for Constrained Metric k-Median/Means
(available as arXiv preprint) | 2023-11-13 | Paper |
Tight FPT approximation for socially fair clustering
Information Processing Letters | 2023-06-05 | Paper |
Tight FPT approximation for constrained \(k\)-center and \(k\)-supplier
Theoretical Computer Science | 2023-04-20 | Paper |
On the \(k\)-means/median cost function
Information Processing Letters | 2022-06-03 | Paper |
Approximate Clustering with Same-Cluster Queries
(available as arXiv preprint) | 2021-06-15 | Paper |
A note on the relation between XOR and selective XOR lemmas
Information Processing Letters | 2020-10-07 | Paper |
Approximate correlation clustering using same-cluster queries
(available as arXiv preprint) | 2020-02-12 | Paper |
Sampling in space restricted settings
Algorithmica | 2018-05-18 | Paper |
Faster algorithms for the constrained \(k\)-means problem
Theory of Computing Systems | 2018-03-01 | Paper |
Faster algorithms for the constrained \(k\)-means problem
(available as arXiv preprint) | 2018-01-24 | Paper |
Simultaneous secrecy and reliability amplification for a general channel model
Theory of Cryptography | 2016-12-21 | Paper |
Tight lower bound instances for \(k\)-means++ in two dimensions
Theoretical Computer Science | 2016-05-18 | Paper |
scientific article; zbMATH DE number 6537946 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2016-02-01 | Paper |
Sampling in space restricted settings
Lecture Notes in Computer Science | 2015-10-29 | Paper |
\(k\)-means++ under approximation stability
Theoretical Computer Science | 2015-06-11 | Paper |
A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
Algorithmica | 2015-01-19 | Paper |
Improved analysis of \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
Information Processing Letters | 2014-12-09 | Paper |
Bounded Independence Fools Halfspaces
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
A tight lower bound instance for \(k\)-means++ in constant dimension
Lecture Notes in Computer Science | 2014-04-16 | Paper |
k-means++ under approximation stability
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Analysis of \(k\)-means++ for separable data
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
A simple \(D ^{2}\)-sampling based PTAS for \(k\)-means and other clustering problems
Lecture Notes in Computer Science | 2012-09-25 | Paper |
| On the Distribution of the Fourier Spectrum of Halfspaces | 2012-02-29 | Paper |
Bounded Independence Fools Halfspaces
SIAM Journal on Computing | 2011-04-04 | Paper |
Uniform direct product theorems: simplified, optimized, and derandomized
SIAM Journal on Computing | 2010-09-06 | Paper |
Approximate list-decoding of direct product codes and uniform hardness amplification
SIAM Journal on Computing | 2010-04-29 | Paper |
Chernoff-type direct product theorems
Journal of Cryptology | 2009-06-30 | Paper |
Chernoff-Type Direct Product Theorems
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Security Amplification for Interactive Cryptographic Primitives
Theory of Cryptography | 2009-03-03 | Paper |
| scientific article; zbMATH DE number 5485571 (Why is no real title available?) | 2009-01-05 | Paper |
