| Publication | Date of Publication | Type |
|---|
| Approximate Clustering with Same-Cluster Queries | 2021-06-15 | Paper |
| Deep metric learning using triplet network | 2021-05-25 | Paper |
| The complexity of computing (almost) orthogonal matrices with \(\varepsilon\)-copies of the Fourier transform | 2021-02-04 | Paper |
| Paraunitary matrices, entropy, algebraic condition number and Fourier computation | 2020-03-12 | Paper |
| Approximate correlation clustering using same-cluster queries | 2020-02-12 | Paper |
| Interesting Open Problem Related to Complexity of Computing the Fourier Transform and Group Theory | 2019-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4614094 | 2019-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365036 | 2017-09-29 | Paper |
| An Omega((n log n)/R) Lower Bound for Fourier Transform Computation in the R-Well Conditioned Model | 2016-10-24 | Paper |
| Bandit online optimization over the permutahedron | 2016-10-21 | Paper |
| Tight lower bound instances for \(k\)-means++ in two dimensions | 2016-05-18 | Paper |
| Aggregating inconsistent information | 2015-11-11 | Paper |
| Tighter Fourier Transform Lower Bounds | 2015-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5502120 | 2015-08-17 | Paper |
| Fast and RIP-optimal transforms | 2015-02-03 | Paper |
| Bandit Online Optimization over the Permutahedron | 2015-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934621 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934012 | 2014-12-08 | Paper |
| An Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform | 2014-12-05 | Paper |
| Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform | 2014-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414631 | 2014-05-07 | Paper |
| A Tight Lower Bound Instance for k-means++ in Constant Dimension | 2014-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405112 | 2014-04-01 | Paper |
| Learning and Optimizing with Preferences | 2013-11-06 | Paper |
| Improved Approximation Algorithms for Bipartite Correlation Clustering | 2013-02-04 | Paper |
| Fitting Tree Metrics: Hierarchical Clustering and Phylogeny | 2012-02-11 | Paper |
| Improved Approximation Algorithms for Bipartite Correlation Clustering | 2011-09-16 | Paper |
| Self-Improving Algorithms | 2011-07-29 | Paper |
| Dense fast random projections and Lean Walsh transforms | 2011-03-10 | Paper |
| Preference-based learning to rank | 2010-10-07 | Paper |
| Self-improving algorithms | 2010-08-16 | Paper |
| Aggregating inconsistent information | 2010-08-16 | Paper |
| Lower bounds for linear degeneracy testing | 2010-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579390 | 2010-08-06 | Paper |
| Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists | 2010-03-23 | Paper |
| The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors | 2010-03-17 | Paper |
| Fast dimension reduction using Rademacher series on dual BCH codes | 2009-12-14 | Paper |
| Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems | 2009-07-14 | Paper |
| Lower bounds for linear degeneracy testing | 2008-12-21 | Paper |
| Dense Fast Random Projections and Lean Walsh Transforms | 2008-11-27 | Paper |
| On Clusters in Markov Chains | 2008-09-18 | Paper |
| Property-preserving data reconstruction | 2008-07-01 | Paper |
| Estimating the distance to a monotone function | 2008-01-08 | Paper |
| Hardness of fully dense problems | 2007-08-23 | Paper |
| Information theory in property testing and monotonicity testing in higher dimension | 2007-01-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Torsion points on curves and common divisors of ak-1 and bk-1 | 2004-08-18 | Paper |
