The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Santosh Vempala: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala
    Latent Semantic Indexing: A Probabilistic Analysis. [Citation Graph (3, 4)][DBLP]
    PODS, 1998, pp:159-168 [Conf]
  2. Alan M. Frieze, Ravi Kannan, Santosh Vempala
    Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations. [Citation Graph (1, 0)][DBLP]
    FOCS, 1998, pp:370-378 [Conf]
  3. Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala
    Locality-Preserving Hashing in Multidimensional Spaces. [Citation Graph (1, 0)][DBLP]
    STOC, 1997, pp:618-625 [Conf]
  4. Maria-Florina Balcan, Avrim Blum, Santosh Vempala
    On Kernels, Margins, and Low-Dimensional Mappings. [Citation Graph (0, 0)][DBLP]
    ALT, 2004, pp:194-205 [Conf]
  5. Santosh Vempala, Adrian Vetta
    Factor 4/3 approximations for minimum 2-connected subgraphs. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:262-273 [Conf]
  6. Amit Deshpande, Santosh Vempala
    Adaptive Sampling and Fast Low-Rank Matrix Approximation. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:292-303 [Conf]
  7. Adam Kalai, Santosh Vempala
    Efficient Algorithms for Online Decision Problems. [Citation Graph (0, 0)][DBLP]
    COLT, 2003, pp:26-40 [Conf]
  8. Ravindran Kannan, Hadi Salmasian, Santosh Vempala
    The Spectral Method for General Mixture Models. [Citation Graph (0, 0)][DBLP]
    COLT, 2005, pp:444-457 [Conf]
  9. Rosa I. Arriaga, Santosh Vempala
    An Algorithmic Theory of Learning: Robust Concepts and Random Projection. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:616-623 [Conf]
  10. Imre Bárány, Santosh Vempala, Adrian Vetta
    Nash Equilibria in Random Games. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:123-131 [Conf]
  11. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:330-338 [Conf]
  12. Adam Kalai, Santosh Vempala
    Efficient Algorithms for Universal Portfolios. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:486-491 [Conf]
  13. László Lovász, Santosh Vempala
    Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:650-0 [Conf]
  14. László Lovász, Santosh Vempala
    Logconcave Functions: Geometry and Efficient Sampling Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:640-649 [Conf]
  15. Santosh Vempala
    A Random Sampling Based Algorithm for Learning the Intersection of Half-spaces. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:508-513 [Conf]
  16. Santosh Vempala
    Random Projection: A New Approach to VLSI Layout. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:389-395 [Conf]
  17. Ravi Kannan, Santosh Vempala, Adrian Vetta
    On Clusterings - Good, Bad and Spectral. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:367-377 [Conf]
  18. Santosh Vempala, Grant Wang
    A Spectral Algorithm for Learning Mixtures of Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:113-0 [Conf]
  19. László Lovász, Santosh Vempala
    Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:57-68 [Conf]
  20. Luis Rademacher, Santosh Vempala
    Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:729-738 [Conf]
  21. Vivek Arora, Santosh Vempala, Huzur Saran, Vijay V. Vazirani
    A Limited-Backtrack Greedy Schema for Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:318-329 [Conf]
  22. Luis Rademacher, Santosh Vempala
    Testing Geometric Convexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:469-480 [Conf]
  23. Joseph Cheriyan, Santosh Vempala
    Edge Covers of Setpairs and the Iterative Rounding Method. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:30-44 [Conf]
  24. Alantha Newman, Santosh Vempala
    Fences Are Futile: On Relaxations for the Linear Ordering Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2001, pp:333-347 [Conf]
  25. Santosh Vempala, Berthold Vöcking
    Approximating Multicast Congestion. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1999, pp:367-372 [Conf]
  26. Claudson F. Bornstein, Santosh Vempala
    Flow Metrics. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:516-527 [Conf]
  27. David Cheng, Santosh Vempala, Ravi Kannan, Grant Wang
    A divide-and-merge methodology for clustering. [Citation Graph (0, 0)][DBLP]
    PODS, 2005, pp:196-205 [Conf]
  28. John Dunagan, Santosh Vempala
    On Euclidean Embeddings and Bandwidth Minimization. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:229-240 [Conf]
  29. Prasad Tetali, Santosh Vempala
    Random Sampling of Euler Tours. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:57-66 [Conf]
  30. Sanjeev Arora, László Lovász, Ilan Newman, Yuval Rabani, Yuri Rabinovich, Santosh Vempala
    Local versus global properties of metric spaces. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:41-50 [Conf]
  31. Robert D. Carr, Santosh Vempala, Jacques Mandler
    Towards a 4/3 approximation for the asymmetric traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:116-125 [Conf]
  32. Amit Deshpande, Luis Rademacher, Santosh Vempala, Grant Wang
    Matrix approximation and projective clustering via volume sampling. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1117-1126 [Conf]
  33. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering in Large Graphs and Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:291-299 [Conf]
  34. Naveen Garg, Santosh Vempala, Aman Singla
    Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:103-111 [Conf]
  35. Ravi Kannan, Prasad Tetali, Santosh Vempala
    Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:193-200 [Conf]
  36. Santosh Vempala, Mihalis Yannakakis
    A Convex Relaxation for the Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:975-976 [Conf]
  37. David Pritchard, Santosh Vempala
    Symmetric network computation. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:261-270 [Conf]
  38. Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala
    Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:277-283 [Conf]
  39. Avrim Blum, Prasad Chalasani, Santosh Vempala
    A constant-factor approximation for the k-MST problem in the plane. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:294-302 [Conf]
  40. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala
    Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:100-105 [Conf]
  41. Avrim Blum, R. Ravi, Santosh Vempala
    A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:442-448 [Conf]
  42. Dimitris Bertsimas, Santosh Vempala
    Solving convex programs by random walks. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:109-115 [Conf]
  43. Robert D. Carr, Santosh Vempala
    Randomized metarounding (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:58-62 [Conf]
  44. Joseph Cheriyan, Santosh Vempala, Adrian Vetta
    Approximation algorithms for minimum-cost k-vertex connected subgraphs. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:306-312 [Conf]
  45. John Dunagan, Santosh Vempala
    Optimal outlier removal in high-dimensional. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:627-636 [Conf]
  46. John Dunagan, Santosh Vempala
    A simple polynomial-time rescaling algorithm for solving linear programs. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:315-320 [Conf]
  47. Ravi Kannan, Santosh Vempala
    Sampling Lattice Points. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:696-700 [Conf]
  48. László Lovász, Santosh Vempala
    Hit-and-run from a corner. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:310-314 [Conf]
  49. Christos H. Papadimitriou, Santosh Vempala
    On the approximability of the traveling salesman problem (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:126-133 [Conf]
  50. Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala
    Tensor decomposition and approximation schemes for constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:747-754 [Conf]
  51. Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh Vempala
    A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:22, n:1/2, pp:35-52 [Journal]
  52. Prasad Tetali, Santosh Vempala
    Random Sampling of Euler Tours. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:376-385 [Journal]
  53. Joseph Cheriyan, Santosh Vempala, Adrian Vetta
    Network Design Via Iterative Rounding Of Setpair Relaxations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:3, pp:255-275 [Journal]
  54. Andrew Kotlov, László Lovász, Santosh Vempala
    The Colin de Verdière Number and Sphere Representations of a Graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:4, pp:483-521 [Journal]
  55. Christos H. Papadimitriou, Santosh Vempala
    On The Approximability Of The Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:1, pp:101-120 [Journal]
  56. Hadi Salmasian, Ravindran Kannan, Santosh Vempala
    The Spectral Method for Mixture Models [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:067, pp:- [Journal]
  57. Dimitris Bertsimas, Santosh Vempala
    Solving convex programs by random walks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:4, pp:540-556 [Journal]
  58. Alan M. Frieze, Ravi Kannan, Santosh Vempala
    Fast monte-carlo algorithms for finding low-rank approximations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:6, pp:1025-1041 [Journal]
  59. Ravi Kannan, Santosh Vempala, Adrian Vetta
    On clusterings: Good, bad and spectral. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2004, v:51, n:3, pp:497-515 [Journal]
  60. Avrim Blum, R. Ravi, Santosh Vempala
    A Constant-Factor Approximation Algorithm for the k-MST Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:1, pp:101-108 [Journal]
  61. John Dunagan, Santosh Vempala
    Optimal outlier removal in high-dimensional spaces. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:335-373 [Journal]
  62. Adam Tauman Kalai, Santosh Vempala
    Efficient algorithms for online decision problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:3, pp:291-307 [Journal]
  63. László Lovász, Santosh Vempala
    Simulated annealing in convex bodies and an O*(n4) volume algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:392-417 [Journal]
  64. Christos H. Papadimitriou, Prabhakar Raghavan, Hisao Tamaki, Santosh Vempala
    Latent Semantic Indexing: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:2, pp:217-235 [Journal]
  65. Santosh Vempala, Grant Wang
    A spectral algorithm for learning mixture models. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:841-860 [Journal]
  66. Adam Kalai, Santosh Vempala
    Efficient Algorithms for Universal Portfolios. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2002, v:3, n:, pp:423-440 [Journal]
  67. Rosa I. Arriaga, Santosh Vempala
    An algorithmic theory of learning: Robust concepts and random projection. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2006, v:63, n:2, pp:161-182 [Journal]
  68. Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
    Clustering Large Graphs via the Singular Value Decomposition. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:56, n:1-3, pp:9-33 [Journal]
  69. Maria-Florina Balcan, Avrim Blum, Santosh Vempala
    Kernels as features: On kernels, margins, and low-dimensional mappings. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2006, v:65, n:1, pp:79-94 [Journal]
  70. Robert D. Carr, Santosh Vempala
    On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2004, v:100, n:3, pp:569-587 [Journal]
  71. Robert D. Carr, Santosh Vempala
    Randomized metarounding. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:343-352 [Journal]
  72. Ravi Kannan, Prasad Tetali, Santosh Vempala
    Simple Markov-chain algorithms for generating bipartite graphs and tournaments. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:4, pp:293-308 [Journal]
  73. Baruch Awerbuch, Yossi Azar, Avrim Blum, Santosh Vempala
    New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:254-262 [Journal]
  74. Joseph Cheriyan, Santosh Vempala, Adrian Vetta
    An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:4, pp:1050-1055 [Journal]
  75. László Lovász, Santosh Vempala
    Hit-and-Run from a Corner. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:985-1005 [Journal]
  76. Joseph S. B. Mitchell, Avrim Blum, Prasad Chalasani, Santosh Vempala
    A Constant-Factor Approximation Algorithm for the Geometric k-MST Problem in the Plane. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:3, pp:771-781 [Journal]
  77. Avrim Blum, Goran Konjevod, R. Ravi, Santosh Vempala
    Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:235, n:1, pp:25-42 [Journal]
  78. Claudson F. Bornstein, Santosh Vempala
    Flow metrics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:1, pp:13-24 [Journal]
  79. David Cheng, Ravi Kannan, Santosh Vempala, Grant Wang
    A divide-and-merge methodology for clustering. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:4, pp:1499-1525 [Journal]
  80. Alexandre Belloni, Robert M. Freund, Santosh Vempala
    An Efficient Re-scaled Perceptron Algorithm for Conic Systems. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:393-408 [Conf]
  81. Santosh Vempala
    Spectral Algorithms for Learning and Clustering. [Citation Graph (0, 0)][DBLP]
    COLT, 2007, pp:3-4 [Conf]
  82. Daniel Stefankovic, Santosh Vempala, Eric Vigoda
    Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  83. Luis Rademacher, Santosh Vempala
    Dispersion of Mass and the Complexity of Randomized Geometric Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  84. Sampling s-Concave Functions: The Limit of Convexity Based Isoperimetry. [Citation Graph (, )][DBLP]


  85. Random Tensors and Planted Cliques. [Citation Graph (, )][DBLP]


  86. Filtering spam with behavioral blacklisting. [Citation Graph (, )][DBLP]


  87. Isotropic PCA and Affine-Invariant Clustering. [Citation Graph (, )][DBLP]


  88. Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting. [Citation Graph (, )][DBLP]


  89. Path splicing. [Citation Graph (, )][DBLP]


  90. Circumventing censorship with collage. [Citation Graph (, )][DBLP]


  91. Expanders via random spanning trees. [Citation Graph (, )][DBLP]


  92. Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. [Citation Graph (, )][DBLP]


  93. A discriminative framework for clustering via similarity functions. [Citation Graph (, )][DBLP]


  94. Logconcave random graphs. [Citation Graph (, )][DBLP]


  95. A New Approach to Strongly Polynomial Linear Programming. [Citation Graph (, )][DBLP]


  96. Isotropic PCA and Affine-Invariant Clustering [Citation Graph (, )][DBLP]


  97. Expanders via Random Spanning Trees [Citation Graph (, )][DBLP]


  98. Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families [Citation Graph (, )][DBLP]


  99. Random Tensors and Planted Cliques [Citation Graph (, )][DBLP]


  100. The Limit of Convexity Based Isoperimetry: Sampling Harmonic-Concave Functions [Citation Graph (, )][DBLP]


  101. A Deterministic Polynomial-time Approximation Scheme for Counting Knapsack Solutions [Citation Graph (, )][DBLP]


  102. Dispersion of Mass and the Complexity of Randomized Geometric Algorithms. [Citation Graph (, )][DBLP]


  103. Adaptive Sampling and Fast Low-Rank Matrix Approximation. [Citation Graph (, )][DBLP]


Search in 0.607secs, Finished in 0.610secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002