Santosh Vempala's papers (in ps/pdf) on Algorithms, Randomness, Geometry and Combinatorics.
Fourier PCA (N. Goyal, Y. Xiao) STOC 2014 |
Integer Feasibility of Random Polytopes (K. Chandrasekaran) ITCS 2014 |
A Cubic Algorithm for Computing Gaussian Volume (B. Cousins) SODA 2014 |
Near-optimal Deterministic Algorithms for Volume Computation via M-ellipsoids (D. Dadush) Proc. National Academy of Sciences (PNAS) |
The Complexity of Approximating Vertex Expansion (A. Louis and P. Raghavendra) FOCS 2013 |
Statistical Algorithms and a lower bound for detecting planted cliques (V. Feldman, E. Grigorescu, L. Reyzin, Y. Xiao) STOC 2013 |
The approximate rank of a matrix and its algorithmic applications. (N. Alon, T. Lee, A. Shraibman) STOC 2013 |
Randomly oriented k-d trees adapt to intrinsic dimension. FSTTCS 2012 |
The cutting plane method
is polynomial for perfect matchings. (K. Chandrasekaran, L. Vegh) FOCS 2012 |
Many sparse cuts via higher eigenvalues (A. Louis, P. Raghavendra, P. Tetali) STOC 2012 |
Deterministic construction of an approximate M-ellipsoid
and its applications to derandomizing lattice algorithms. (D. Dadush) SODA 2012 |
Modeling High-dimensional Data: Technical Perspective. Comm. ACM 55(2): 112, 2012. |
Enumerative Lattice Algorithms in Any Norm via M-Ellipsoid Coverings (D. Dadush, C. Peikert) Proc. of FOCS 2011. |
A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions(D. Stefankovic, E. Vigoda) Proc. of FOCS 2011. SIAM J. Comp., 41(2): 356-366, 2012 |
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues (A. Louis, P. Raghavendra, P. Tetali) Proc. of APPROX 2011. |
Semantic Communication for Simple Goals is Equivalent to On-line Learning (B. Juba) Proc. of ALT 2011. |
On Noise-Tolerant Learning of Sparse Parities
and Related Problems (E. Grigorescu, L. Reyzin) Proc. of ALT 2011. |
LifeNet: A Flexible Ad hoc Networking Solution for Transient Environments (H. Mehendale, A. Paranjpe) SIGCOMM 2011, demo. |
Algorithms for Implicit Hitting Set Problems (K. Chandrasekaran, R. Karp, E. Moreno-Centeno) Proc. of SODA 2011. |
Learning Convex Concepts from Gaussian Distributions with PCA Proc. of FOCS 2010. |
On Nash-Equilibria of Approximation-Stable Games (P. Awasthi, N. Balcan,
A. Blum, O. Sheffet) Proc. of SAGT 2010. |
Chipping Away at Censorship with User-Generated Content (S. Burnett, N. Feamster) Proc. of USENIX Security 2010. |
A Random Sampling Algorithm for Learning an Intersection of Halfspaces JACM, 2010. |
A New Approach to Strongly Polynomial Linear Programming (M. B�r�sz) Proc. of ICS 2010. |
Thin Partitions: Isoperimetry and Sampling for Star-shaped Bodies (K. Chandrasekara, D. Dadush) Proc. of SODA 2010. |
MyMANET: A Customizable Mobile Ad hoc Network (A. Paranjpe) Proc. of ACM NSDR 2009. |
Random Tensors and Planted Cliques (S. C. Brubaker) Proc. of RANDOM 2009. |
Sampling s-Concave Functions: The Limit of Convexity-based Isoperimetry (K. Chandrasekaran, A. Deshpande) Proc. of RANDOM 2009. |
Design and Deployment of a Blood Safety Monitoring Tool (S. Thomas, A. Osuntogun, J. Pitman, B. Mulenga) Proc. of ICTD 2009. |
Expanders via Random Spanning Trees (N. Goyal, L. Rademacher) Proc. of SODA 2009. |
Algorithmic Prediction of Health-Care Costs (D. Bertsimas, M. V. Bjarnad�ttir, M. A. Kane, J. C. Kryder, R. Pandey, G. Wang ) Operations Research, 2008 (special issue on Health Care). |
Isotropic PCA and Affine-Invariant Clustering (S.C. Brubaker) [conf version] Building Bridges (Ed.s M. Gr\"{o}tchel and G.O.H.Katona), Bolyai Society Mathematical Studies, 2008. (special issue in honor of L. Lov�sz). Proc. of FOCS 2008. |
Path Splicing (M. Motiwala, M. Elmore and N. Feamster) Proc. of SIGCOMM, 2008. |
Logconcave Random Graphs (A. Frieze and J. Vera) Proc. of STOC 2008. |
A Discriminative Framework for Clustering via Similarity
Functions (M. F. Balcan and A. Blum) Proc. of STOC, 2008. |
Life (and Routing) on the Wireless Manifold
(V. Kanade) Proc. of HotNets, 2007. |
Path Splicing: Reliable Connectivity with Rapid Recovery
(M. Motiwala and N. Feamster) Proc. of HotNets, 2007. |
Filtering Spam with Behavioral Blacklisting
(A. Ramachandran and N. Feamster) Proc. ACM Computer and Communication Security, 2007. |
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
(D. Stefankovic and E. Vigoda) JACM 2009 Proc. of the 48th IEEE Symposium on Foundations of Computer Science (FOCS '07), 2007. (invited to special issue) |
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
(A. Belloni, R. Freund) Proc. of 20th Conf. on Computational Learning Theory, San Diego, 2007. |
Dispersion of Mass and the Complexity of Randomized Geometric Algorithms
(L. Rademacher) Proc. of the 47th IEEE Symposium on Foundations of Computer Science (FOCS '06), 2006. |
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization (L. Lov�sz) Proc. of the 47th IEEE Symposium on Foundations of Computer Science (FOCS '06), 2006. |
Adaptive Sampling and Fast Low-rank Matrix Approximation
(A. Deshpande) Proc. of RANDOM, 2006. |
Symmetric Network Computation (D. Pritchard) Proc. of ACM SPAA, 2006. |
Matrix Approximation and Projective Clustering via Volume Sampling (A. Deshpande, L. Rademacher and G. Wang) Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms, 2006. Theory of Computing, 2006 |
Local versus Global Properties of Metric Spaces (S. Arora, L. Lov�sz, I. Newman, Y. Rabani and Y. Rabinovich) Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms, 2006. SIAM J. Comp. 41(1): 250-271, 2012 |
Nash Equilibria in Random Games (I. Barany and A. Vetta) Proc. of the 46th IEEE Symposium on Foundations of Computer Science (FOCS '05), 2005. (invited to special issue) Random Structures and Algorithms, 2007. |
The spectral method for general mixture models (R.
Kannan and H. Salmasian) Proc. of the 18th Conference on Learning Theory, 2005 (Mark Fulk award). SIAM J. Computing, 2008. |
A Divide-and-Merge Methodology for Clustering
(D. Cheng, R. Kannan and G. Wang) Proc. of the ACM Symposium on Principles of Database Systems, 2005. ACM Trans. Database Systems, 2006. |
Tensor decomposition and approximation schemes for
constraint satisfaction problems. (W. F. de la Vega, R. Kannan and M. Karpinski) Proc. of the 37th ACM Symposium on the Theory of Computing (STOC '05), 2005. |
Geometric Random Walks: A Survey. MSRI volume on Combinatorial and Computational Geometry. |
Testing geometric convexity.
(Luis Rademacher) Proc. of the 24th FST & TCS, Chennai, 2004. |
On Kernels, Margins and Low-dimensional Mappings.
(Nina Balcan, Avrim Blum) Proc. of the 15th Conf. Algorithmic Learning Theory, Padua, 2004. Machine Learning |
Hit-and-run from a corner.
(L. Lov�sz) Proc. of the 36th ACM Symposium on the Theory of Computing (STOC '04), Chicago, 2004. SIAM J. Computing (STOC04 special issue). |
A simple polynomial-time rescaling algorithm
for solving linear programs.(J. Dunagan) Proc. of the 36th ACM Symposium on the Theory of Computing (STOC '04), Chicago, 2004. Math. Prog. A |
Simulated annealing in convex bodies and an
O*(n^4) volume algorithm. (L. Lov�sz) Proc. of the 44th IEEE Foundations of Computer Science (FOCS '03), Boston, 2003. JCSS (FOCS03 special issue). |
Simulated annealing for convex optimization
. (Adam Kalai) Math of OR. |
Logconcave functions: Geometry and efficient
sampling algorithms. (L. Lov�sz) Proc. of the 44th IEEE Foundations of Computer Science (FOCS '03), Boston, 2003. Random Structures and Algorithms |
Efficient algorithms for the online decision problem. (Adam Kalai) Proc. of 16th Conf. on Computational Learning Theory, Washington D.C., 2003. |
A spectral algorithm for learning mixtures
of distributions. (Grant Wang) Proc. of the 43rd IEEE Foundations of Computer Science (FOCS '02), Vancouver, 2002. JCSS (special issue for FOCS '02), 68(4), 841--860, 2004. |
Solving convex programs by random walks. (Dimitris Bertsimas) Journal of the ACM (JACM) 51(4), 540--556, 2004. Proc. of the 34th ACM Symposium on the Theory of Computing (STOC '02), Montreal, 2002. |
An approximation algorithm for the minimum-cost k-vertex connected
subgraph. (Joseph Cheriyan, Adrian Vetta) SIAM J. Computing, 32(4) (2003), 1050-1055. |
Network design via iterative rounding of setpair relaxations. (Joseph Cheriyan, Adrian Vetta) Combinatorica. A preliminary version of the previous two appeared as Approximation algorithms for minimum-cost k-connected subgraphs. Proc. of the 34th ACM Symposium on the Theory of Computing (STOC '02), Montreal, 2002. |
Flow metrics. (Claudson Bornstein) Proc. of the 5th Symposium on Latin American Theoretical Informatics, Cancun, 2002. Theoretical Computer Science (special issue for LATIN '02), 321(1), 13--24, 2004. |
On Euclidean embeddings and bandwidth minimization. (John Dunagan) Proc. of the 5th Workshop on Randomization and Approximation, Berkeley, 2001. |
Optimal outlier removal in high-dimensional spaces. (John Dunagan) Proc. of the 33rd ACM Symposium on the Theory of Computing (STOC '01), Crete, 2001. JCSS (special issue for STOC '01), 68(2), 335--373, 2004. |
Edge covers of setpairs and the iterative rounding method. (Joseph Cheriyan) Proc. of Integer Programming and Combinatorial Optimization, Utrecht, 2001. |
Fences are futile: on relaxations for the linear
ordering problem. (Alantha Newman) Proc. of Integer Programming and Combinatorial Optimization, Utrecht, 2001. |
On clusterings: good, bad and spectral. (Ravi Kannan and Adrian Vetta) Journal of the ACM (JACM) 51(3), 497--515, 2004. Proc. of the 41st Foundations of Computer Science (FOCS '00), Redondo Beach, 2000. |
Efficient algorithms for universal portfolios. (Adam Kalai) J. Machine Learning Research, 3, (2002), 423--440 (invited). Proc. of the 41st Foundations of Computer Science (FOCS '00), Redondo Beach, 2000. |
Factor 4/3 approximations for minimum 2-connected subgraphs. (Adrian Vetta) Proc. of the 3rd Workshop on Approximation , Saarbrucken, 2000. |
On the approximability of the
traveling salesman problem. (Christos H. Papadimitriou) Proc. of the 32nd ACM Symposium on the Theory of Computing (STOC '00), Portland, 2000. To appear in Combinatorica. |
Randomized meta-rounding. (Bob Carr) Random Structures and Algorithms, 20(3), (2002), 343-352 (invited). Proc. of the 32nd ACM Symposium on the Theory of Computing (STOC '00), Portland, 2000. |
On the Held-Karp relaxation for
the asymmetric and symmetric TSPs. (Bob Carr) Proc. of the 11th ACM-SIAM Symposium on Discrete Algorithms , San Francisco, 2000. Mathematical Programming, 100(3), 569--587, 2004. |
Approximating multicast
congestion. (Berthold Vocking) Proc. of ISAAC, Chennai, 1999. |
An algorithmic theory of
learning: Robust Concepts and Random Projection. (Rosa I. Arriaga) Proc. of the 40th Foundations of Computer Science (FOCS '99), New York, 1999. To appear in Machine Learning. |
A convex relaxation for the
Asymmetric TSP. (Mihalis Yannakakis)[two pages only] Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 1999. |
Clustering large graphs via the Singular Value
Decomposition. (Petros Drineas, Ravi Kannan, Alan Frieze and V. Vinay) Machine Learning 56, 9--33, 2004. Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms, Baltimore, 1999. |
Random Projection: A New Approach to
VLSI Layout. Proc. of the 39th Foundations of Computer Science (FOCS '98), Palo Alto, 1998. |
Fast Monte-Carlo Algorithms for Finding
Low-Rank Approximations. (A. Frieze, R. Kannan) Proc. of the 39th Foundations of Computer Science (FOCS '98), Palo Alto, 1998. Journal of the ACM (JACM), 51(6), 1025-1041, 2004. |
Semi-Definite Relaxations for Minimum
Bandwidth and other Vertex-Ordering Problems. (Avrim Blum, Goran Konjevod and R. Ravi) Proc. of the 30th ACM Symposium on the Theory of Computing (STOC '98), Dallas, 1998. Theoretical Computer Science, 235 (2000), 25-42 (special issue in honour of Manuel Blum). |
A Random Sampling based Algorithm for
learning the Intersection of Half-spaces Proc. of the 38th Foundations of Computer Science (FOCS '97), Miami, 1997. (Machtey Prize) |
Sampling Lattice Points. (Ravi Kannan) Proc. 29th ACM Symposium on the Theory of Computing (STOC '97), El Paso, 1997. Invited for publication in Journal of Comp. and System Sciences. |
Locality-Preserving Hashing in
Multidimensional Spaces. (Piotr Indyk, Rajeev Motwani and Prabhakar Raghavan) Proc. 29th ACM Symposium on the Theory of Computing (STOC '97), El Paso, 1997. |
Latent Semantic Indexing: A Probabilistic
Analysis. (Christos Papadimitriou, Prabhakar Raghavan and Hisao Tamaki) Proc. 17th ACM Symposium on the Principles of Database Systems, Seattle, 1998. Journal of Comp. and System Sciences (special issue for PODS '01), 61, 2000 217-235. |
Simple Markov-Chain Algorithms for
Generating Bipartite Graphs and Tournaments. (Ravi Kannan and Prasad Tetali) Proc. 8th ACM-SIAM Symposium on Discrete Algorithms, New Orleans, 1997. Random Structures and Algorithms, 14(4), 1999, 293-308. |
A Polynomial-Time Algorithm for Learning
Noisy Linear Threshold Functions. (Avrim Blum, Alan Frieze and Ravi Kannan) Proc. 37th IEEE Symposium on the Foundations of Computer Science (FOCS '96), Burlington, 1996. Algorithmica, 22(1), 35-52 (invited). |
The Colin de Verdi�re Number and Sphere
Representations of a Graph (Andrew Kotlov and L�szl� Lov�sz) Combinatorica, 17(4), 1997. |
A Constant-Factor Approximation for the k-MST
Problem. (Avrim Blum, R. Ravi) Proc. 28th ACM Symposium on the Theory of Computing (STOC '96), Philadelphia, 1996. J. Computer and System Sciences, 58(1), 101-108 (special issue for STOC '96). |
Improved Approximations for
Minimum-Weight k-Trees and Prize-Collecting Salesmen. (Baruch Awerbuch, Yossi Azar, Avrim Blum) Proc. 27th ACM Symposium on the Theory of Computing (STOC '95), Las Vegas, 1995. SIAM J. on Computing, 28(1) 1999. |
A Constant-Factor Approximation
for the k-MST Problem in the Plane. (A. Blum, P. Chalasani) Proc. 27th ACM Symposium on the Theory of Computing (STOC '95), Las Vegas, 1995. |
A Constant-Factor
Approximation Algorithm for the Geometric k-MST Problem in the
Plane (J.S.B. Mitchell, A. Blum, P. Chalasani) Siam J. on Computing , 28(3) 1999. |
Improved Approximations for Finding Minimum
2-connected Subgraphs via Better Lower-Bounding Techniques (Naveen Garg, Aman Singla) Proc. 4th ACM-SIAM Symposium on Discrete Algorithms, Austin, 1993. |
``A Limited-Backtrack Greedy Schema for Approximation
Algorithms,'' Proc. 14th Conf. on the Foundations of Software Technology and Theoretical Computer Science, Madras, 1994. |