| Publication | Date of Publication | Type |
|---|
Labelings vs. embeddings: on distributed and prioritized representations of distances
Discrete \& Computational Geometry | 2024-04-02 | Paper |
Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Learning Convex Polyhedra With Margin
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Faster algorithms for orienteering and \(k\)-TSP
Theoretical Computer Science | 2022-04-19 | Paper |
Apportioned margin approach for cost sensitive large margin classifiers
Annals of Mathematics and Artificial Intelligence | 2021-12-17 | Paper |
Non-uniform packings
Information Processing Letters | 2021-12-14 | Paper |
Labelings vs. Embeddings: On Distributed Representations of Distances
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Non-uniform packings
| 2020-08-04 | Paper |
Functions with average smoothness: structure, algorithms, and learning
| 2020-07-13 | Paper |
Approximate nearest neighbor search for \(\ell_p\)-spaces \((2<p<\infty)\) via embeddings
| 2020-02-12 | Paper |
Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
Theoretical Computer Science | 2019-01-18 | Paper |
Near-Optimal Sample Compression for Nearest Neighbors
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
On the impossibility of dimension reduction for doubling subsets of \(\ell_p\)
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Light spanners for snowflake metrics
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Dimension reduction techniques for \(\ell_p\) \((1<p<2)\), with applications
| 2018-01-30 | Paper |
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
A nonlinear approach to dimension reduction
| 2017-09-29 | Paper |
Fast, precise and dynamic distance queries
| 2017-09-29 | Paper |
Nearly optimal classification for semimetrics
| 2017-09-27 | Paper |
Efficient Classification for Metric Data
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Matrix sparsification and the sparse null space problem
Algorithmica | 2016-10-21 | Paper |
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
SIAM Journal on Computing | 2016-09-02 | Paper |
Optimizing budget allocation for center and median points
Theoretical Computer Science | 2016-04-01 | Paper |
Adaptive metric dimensionality reduction
Theoretical Computer Science | 2016-02-26 | Paper |
A nonlinear approach to dimension reduction
Discrete \& Computational Geometry | 2015-12-02 | Paper |
On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)
SIAM Journal on Discrete Mathematics | 2015-07-31 | Paper |
Searching dynamic point sets in spaces with bounded doubling dimension
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Proximity algorithms for nearly doubling spaces
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Adaptive Metric Dimensionality Reduction
Lecture Notes in Computer Science | 2013-11-06 | Paper |
VC bounds on the cardinality of nearly orthogonal function classes
Discrete Mathematics | 2012-05-30 | Paper |
Proximity algorithms for nearly-doubling spaces
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Matrix sparsification and the sparse null space problem
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Dictionary matching and indexing with errors and don't cares
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
scientific article; zbMATH DE number 5764857 (Why is no real title available?)
| 2010-08-06 | Paper |
An Optimal Dynamic Spanner for Doubling Metric Spaces
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Efficient data storage in large nanoarrays
Theory of Computing Systems | 2006-02-08 | Paper |
Strong stability preserving properties of Runge--Kutta time discretization methods for linear constant coefficient operators
Journal of Scientific Computing | 2003-08-20 | Paper |
