- Nash Equilibria in Random Games Imre B ar any # , Santosh Vempala + and Adrian Vetta #
- Expanders via Random Spanning Trees Navin Goyal
- Life (and routing) on the Wireless Manifold Varun Kanade
- Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
- Design and Deployment of a Blood Safety Monitoring Tool
- LifeNet: A Flexible Ad hoc Networking Solution for Transient Environments
- The Geometry of Logconcave Functions and Sampling Algorithms
- Learning Convex Concepts from Gaussian Distributions with PCA
- Path Splicing: Reliable Connectivity with Rapid Recovery Murtaza Motiwala, Nick Feamster and Santosh Vempala
- Dispersion of Mass and the Complexity of Randomized Geometric Luis Rademacher
- Semantic Communication for Simple Goals is Equivalent to On-line Learning
- Path Splicing Murtaza Motiwala, Megan Elmore, Nick Feamster and Santosh Vempala
- On Clusterings: Good, Bad and Spectral RAVI KANNAN
- Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions
- arXiv:0906.2448v1[cs.DS]13Jun2009 Sampling Harmonic Concave Functions: The Limit of Convexity
- Tensor Decomposition and Approximation Schemes for Constraint Satisfaction Problems
- Combinatorial and Computational Geometry MSRI Publications
- A Random Sampling based Algorithm for Learning Intersections of Halfspaces
- An Efficient Re-scaled Perceptron Algorithm for Conic Systems
- A New Approach to Strongly Polynomial Linear Programming
- MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxxxxx
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Algorithms for Implicit Hitting Set Problems Karthekeyan Chandrasekaran
- A Polynomial-time Algorithm for Learning Noisy Linear Threshold Functions
- Matrix Approximation and Projective Clustering via Volume Sampling # Amit Deshpande + Luis Rademacher + Santosh Vempala + Grant Wang +
- Sampling Lattice Points Ravi Kannan
- A Simple Polynomialtime Rescaling Algorithm for Solving Linear Programs
- Optimal Outlier Removal in High-Dimensional Spaces John Dunagan Santosh Vempala
- Flow Metrics Claudson F. Bornstein and Santosh Vempala 1;2
- Fast MonteCarlo Algorithms for Finding LowRank Approximations
- Latent Semantic Indexing: A Probabilistic Analysis Christos H. Papadimitriou
- Random Projection: a new approach to VLSI layout Santosh Vempala
- Edge Covers of Setpairs and the Iterative Rounding Method Joseph Cheriyan (corresponding author)
- A Random Sampling based Algorithm for Learning Intersections of Half-spaces
- On the Approximability of the Traveling Salesman Problem
- A Convex Relaxation for the Asymmetric TSP Santosh Vempala \Lambda Mihalis Yannakakis y
- Journal of Machine Learning Research 1 (2002) 1-48 Submitted 8/01; Published 11/01 Ecient Algorithms for Universal Portfolios
- APPROXIMATION ALGORITHMS FOR MINIMUM-COST k-VERTEX CONNECTED SUBGRAPHS
- A Constantfactor Approximation Algorithm for the kMST Problem
- Approximations for Minimum 2-Connected Subgraphs Santosh Vempala and Adrian Vetta y
- AN APPROXIMATION ALGORITHM FOR THE MINIMUMCOST kVERTEX CONNECTED SUBGRAPH #
- A Spectral Algorithm for Learning Mixture Models Santosh Vempala Grant Wang y
- Simple Markovchain algorithms for generating bipartite graphs and tournaments
- Improved Approximation Guarantees for MinimumWeight kTrees and PrizeCollecting
- The Colin de Verdi`ere number and sphere representations of a graph
- Solving Convex Programs by Random DIMITRIS BERTSIMAS and SANTOSH VEMPALA
- LocalityPreserving Hashing in Multidimensional Spaces
- An Algorithmic Theory of Learning: Robust Concepts and Random Projection #
- On Kernels, Margins, and Low-dimensional Maria-Florina Balcan 1 and Avrim Blum 1 and Santosh Vempala 2
- On the HeldKarp Relaxation for the Asymmetric and Symmetric Traveling Salesman Problems
- An Improved Approximation Algorithm for Finding the Minimum Biconnected Subgraph
- On Euclidean Embeddings and Bandwidth Minimization
- Approximating Multicast Congestion ? Santosh Vempala 1 and Berthold Vocking 2
- Simulated Annealing in Convex Bodies and an O # (n 4 ) Volume Algorithm
- Testing Geometric Convexity Luis Rademacher ## and Santosh Vempala ##
- The Spectral Method for General Mixture Models
- Randomized Metarounding Robert Carr
- Efficient Algorithms for Online Decision Adam Kalai 1 and Santosh Vempala 1
- Isotropic PCA and Affine-Invariant Clustering S. Charles Brubaker
- Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
- Symmetric Network Computation David Pritchard
- Isotropic PCA and Affine-Invariant Clustering (Extended Abstract)
- On Noise-Tolerant Learning of Sparse Parities and Related Problems
- Hit-and-Run from a Corner Laszlo Lovasz
- A Divide-and-Merge Methodology for Clustering DAVID CHENG
