On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Faster mixing via average conductance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The risk profile problem for stock portfolio optimization (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Optimal outlier removal in high-dimensional
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Evaluating multiple attribute items using queries
Proceedings of the 3rd ACM conference on Electronic Commerce
Solving convex programs by random walks
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Improved bounds for sampling contingency tables
Random Structures & Algorithms
What is the complexity of volume calculation?
Journal of Complexity
Similarity of personal preferences: theoretical foundations and empirical analysis
Artificial Intelligence
Efficient algorithms for universal portfolios
The Journal of Machine Learning Research
Journal of Computer and System Sciences - STOC 2002
Optimal outlier removal in high-dimensional spaces
Journal of Computer and System Sciences - STOC 2001
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Solving convex programs by random walks
Journal of the ACM (JACM)
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Online convex optimization in the bandit setting: gradient descent without a gradient
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Coupling with the stationary distribution and improved sampling for colorings and independent sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGGRAPH 2005 Papers
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Blocking Conductance and Mixing in Random Walks
Combinatorics, Probability and Computing
Simulated annealing in convex bodies and an O*(n4) volume algorithm
Journal of Computer and System Sciences - Special issue on FOCS 2003
Uniform generation in spatial constraint databases and applications
Journal of Computer and System Sciences
The geometry of logconcave functions and sampling algorithms
Random Structures & Algorithms
Simulated Annealing for Convex Optimization
Mathematics of Operations Research
A permutation-augmented sampler for DP mixture models
Proceedings of the 24th international conference on Machine learning
Games of fixed rank: a hierarchy of bimatrix games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Random Structures & Algorithms
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM (JACM)
Random walks on polytopes and an affine interior point method for linear programming
Proceedings of the forty-first annual ACM symposium on Theory of computing
Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Complexity of Approximating the Vertex Centroid of a Polyhedron
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
On the geometry of differential privacy
Proceedings of the forty-second ACM symposium on Theory of computing
Thin partitions: isoperimetric inequalities and a sampling algorithm for star shaped bodies
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An analysis of a variation of hit-and-run for uniform sampling from general regions
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Similarity measures on preference structures, part ii: utility functions
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
SIAM Journal on Optimization
Complexity of approximating the vertex centroid of a polyhedron
Theoretical Computer Science
Ellipsoid approximation using random vectors
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Efficient learning of pseudo-boolean functions from limited training data
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
Mathematics of Operations Research
Optimization of a convex program with a polynomial perturbation
Operations Research Letters
Volume computation using a direct monte carlo method
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Approximate verification and enumeration problems
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Uniformly generating origin destination tables
Information Theory, Combinatorics, and Search Theory
Efficient active learning of halfspaces: an aggressive approach
The Journal of Machine Learning Research
| Hi-index | 0.01 |