A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A lower bound on the distortion of embedding planar metrics into Euclidean space
Proceedings of the eighteenth annual symposium on Computational geometry
Property testing of data dimensionality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Geometric Parameters of Kernel Machines
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Entropy, Combinatorial Dimensions and Random Averages
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
On average distortion of embedding metrics into the line and into L1
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A few notes on statistical learning theory
Advanced lectures on machine learning
On the performance of kernel classes
The Journal of Machine Learning Research
Combinatorics, Probability and Computing
On the Importance of Small Coordinate Projections
The Journal of Machine Learning Research
Linear vs. nonlinear algorithms for linear problems
Journal of Complexity
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Rapid Steiner Symmetrization of Most of a Convex Body and the Slicing Problem
Combinatorics, Probability and Computing
Local versus global properties of metric spaces
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Asymptotic Theory of Information-Theoretic Experimental Design
Neural Computation
Volume distortion for subsets of Euclidean spaces: extended abstract
Proceedings of the twenty-second annual symposium on Computational geometry
Metric structures in L1: dimension, snowflakes, and average distortion
European Journal of Combinatorics
Vertex cuts, random walks, and dimension reduction in series-parallel graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Curse of Dimensionality in Pivot Based Indexes
SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Fast private norm estimation and heavy hitters
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Indexability, concentration, and VC theory
Proceedings of the Third International Conference on SImilarity Search and APplications
Genus and the geometry of the cut graph
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Towards a calculus for non-linear spectral gaps
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Almost-Euclidean subspaces of l1Nvia tensor products: a simple approach to randomness reduction
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On kernel engineering via Paley---Wiener
Calcolo: a quarterly on numerical analysis and theory of computation
Quantum one-way communication can be exponentially stronger than classical communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the Fourth International Conference on SImilarity Search and APplications
Depolarizing behavior of quantum channels in higher dimensions
Quantum Information & Computation
On the limitations of embedding methods
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Polylogarithmic private approximations and efficient matching
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Indexability, concentration, and VC theory
Journal of Discrete Algorithms
Local Versus Global Properties of Metric Spaces
SIAM Journal on Computing
Journal of the ACM (JACM)
Information Theory, Combinatorics, and Search Theory
Quantum Information Processing
| Hi-index | 0.00 |