| Publication | Date of Publication | Type |
|---|
Approximate Clustering with Same-Cluster Queries
(available as arXiv preprint) | 2021-06-15 | Paper |
Deep metric learning using triplet network
(available as arXiv preprint) | 2021-05-25 | Paper |
The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform
Information Processing Letters | 2021-02-04 | Paper |
Paraunitary matrices, entropy, algebraic condition number and Fourier computation
Theoretical Computer Science | 2020-03-12 | Paper |
Approximate correlation clustering using same-cluster queries
(available as arXiv preprint) | 2020-02-12 | Paper |
| Interesting Open Problem Related to Complexity of Computing the Fourier Transform and Group Theory | 2019-07-17 | Paper |
| A new and flexible approach to the analysis of paired comparison data | 2019-01-30 | Paper |
| An almost optimal unrestricted fast Johnson-Lindenstrauss transform | 2017-09-29 | Paper |
An \(\mathrm{Omega}((n \log n)/R)\) lower bound for Fourier transform computation in the \(R\)-well conditioned model
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Bandit online optimization over the permutahedron
Theoretical Computer Science | 2016-10-21 | Paper |
Tight lower bound instances for k-means++ in two dimensions
Theoretical Computer Science | 2016-05-18 | Paper |
Aggregating inconsistent information: ranking and clustering
Journal of the ACM | 2015-11-11 | Paper |
Tighter Fourier transform lower bounds
Automata, Languages, and Programming | 2015-10-27 | Paper |
| Iterative and active graph clustering using trace norm minimization without cluster size constraints | 2015-08-17 | Paper |
Fast and RIP-optimal transforms
Discrete & Computational Geometry | 2015-02-03 | Paper |
Bandit online optimization over the permutahedron
Lecture Notes in Computer Science | 2015-01-14 | Paper |
| Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists | 2014-12-18 | Paper |
| Active learning using smooth relative regret approximations with applications | 2014-12-08 | Paper |
Active learning using smooth relative regret approximations with applications
(available as arXiv preprint) | 2014-12-08 | Paper |
An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
A lower bound for Fourier transform computation in a linear model over \(2\times 2\) unitary gates using matrix entropy
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
A tight lower bound instance for k-means++ in constant dimension
Lecture Notes in Computer Science | 2014-04-16 | Paper |
| An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity | 2014-04-01 | Paper |
An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity
(available as arXiv preprint) | 2014-04-01 | Paper |
Learning and Optimizing with Preferences
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Improved approximation algorithms for bipartite correlation clustering
SIAM Journal on Computing | 2013-02-04 | Paper |
Fitting Tree Metrics: Hierarchical Clustering and Phylogeny
SIAM Journal on Computing | 2012-02-11 | Paper |
Improved Approximation Algorithms for Bipartite Correlation Clustering
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Self-improving algorithms
SIAM Journal on Computing | 2011-07-29 | Paper |
Dense fast random projections and Lean Walsh transforms
Discrete & Computational Geometry | 2011-03-10 | Paper |
Preference-based learning to rank
Machine Learning | 2010-10-07 | Paper |
Aggregating inconsistent information
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Self-improving algorithms
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Lower bounds for linear degeneracy testing
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764801 (Why is no real title available?) | 2010-08-06 | Paper |
Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
Algorithmica | 2010-03-23 | Paper |
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
SIAM Journal on Computing | 2010-03-17 | Paper |
Fast dimension reduction using Rademacher series on dual BCH codes
Discrete & Computational Geometry | 2009-12-14 | Paper |
Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
Automata, Languages and Programming | 2009-07-14 | Paper |
Lower bounds for linear degeneracy testing
Journal of the ACM | 2008-12-21 | Paper |
Dense Fast Random Projections and Lean Walsh Transforms
Lecture Notes in Computer Science | 2008-11-27 | Paper |
On Clusters in Markov Chains
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Property-preserving data reconstruction
Algorithmica | 2008-07-01 | Paper |
Estimating the distance to a monotone function
Random Structures & Algorithms | 2008-01-08 | Paper |
Hardness of fully dense problems
Information and Computation | 2007-08-23 | Paper |
Information theory in property testing and monotonicity testing in higher dimension
Information and Computation | 2007-01-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Torsion points on curves and common divisors of a<sup>k</sup>-1 and b<sup>k</sup>-1
Acta Arithmetica | 2004-08-18 | Paper |
Torsion points on curves and common divisors of a<sup>k</sup>-1 and b<sup>k</sup>-1
Acta Arithmetica | 2004-08-18 | Paper |
