BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Greece
13 × USA
2 × Canada
Collaborated with:
A.Blum R.Kannan J.Dunagan C.H.Papadimitriou R.Ravi V.Feldman Y.Xiao B.Cousins L.Lovász D.Bertsimas R.D.Carr P.Raghavan W.Perkins N.Goyal M.Balcan A.M.Frieze J.Vera J.Cheriyan A.Vetta P.Chalasani N.Alon T.Lee A.Shraibman A.Louis P.Raghavendra P.Tetali D.Cheng G.Wang W.F.d.l.Vega M.Karpinski H.Tamaki G.Konjevod P.Indyk R.Motwani B.Awerbuch Y.Azar E.Grigorescu L.Reyzin
Talks about:
approxim (8) algorithm (6) problem (6) random (4) minimum (3) decomposit (2) constant (2) program (2) cluster (2) vertex (2)

Person: Santosh Vempala

DBLP DBLP: Vempala:Santosh

Contributed to:

STOC 20152015
STOC 20142014
STOC 20132013
STOC 20122012
STOC 20082008
PODS 20052005
STOC 20052005
STOC 20042004
STOC 20022002
STOC 20012001
STOC 20002000
PODS 19981998
STOC 19981998
STOC 19971997
STOC 19961996
STOC 19951995

Wrote 24 papers:

STOC-2015-CousinsV #algorithm
Bypassing KLS: Gaussian Cooling and an O^*(n3) Volume Algorithm (BC, SV), pp. 539–548.
STOC-2015-FeldmanPV #complexity #on the #problem #random #satisfiability
On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.
STOC-2014-GoyalVX #composition #fourier #robust
Fourier PCA and robust tensor decomposition (NG, SV, YX), pp. 584–593.
STOC-2013-AlonLSV #algorithm #approximate #matrix #rank
The approximate rank of a matrix and its algorithmic applications: approximate rank (NA, TL, AS, SV), pp. 675–684.
STOC-2013-FeldmanGRVX #algorithm #bound #clique #detection #statistics
Statistical algorithms and a lower bound for detecting planted cliques (VF, EG, LR, SV, YX), pp. 655–664.
Many sparse cuts via higher eigenvalues (AL, PR, PT, SV), pp. 1131–1140.
STOC-2008-BalcanBV #clustering #framework #similarity
A discriminative framework for clustering via similarity functions (MFB, AB, SV), pp. 671–680.
STOC-2008-FriezeVV #graph #random
Logconcave random graphs (AMF, SV, JV), pp. 779–788.
PODS-2005-ChengVKW #clustering
A divide-and-merge methodology for clustering (DC, SV, RK, GW), pp. 196–205.
STOC-2005-VegaKKV #approximate #composition #constraints #problem
Tensor decomposition and approximation schemes for constraint satisfaction problems (WFdlV, MK, RK, SV), pp. 747–754.
STOC-2004-DunaganV #algorithm #linear #polynomial #source code
A simple polynomial-time rescaling algorithm for solving linear programs (JD, SV), pp. 315–320.
Hit-and-run from a corner (LL, SV), pp. 310–314.
STOC-2002-BertsimasV #random #source code
Solving convex programs by random walks (DB, SV), pp. 109–115.
STOC-2002-CheriyanVV #algorithm #approximate #low cost
Approximation algorithms for minimum-cost k-vertex connected subgraphs (JC, SV, AV), pp. 306–312.
Optimal outlier removal in high-dimensional (JD, SV), pp. 627–636.
STOC-2000-CarrV #random
Randomized metarounding (RDC, SV), pp. 58–62.
STOC-2000-PapadimitriouV #on the #problem
On the approximability of the traveling salesman problem (CHP, SV), pp. 126–133.
PODS-1998-PapadimitriouRTV #analysis #probability #semantics
Latent Semantic Indexing: A Probabilistic Analysis (CHP, PR, HT, SV), pp. 159–168.
STOC-1998-BlumKRV #problem
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems (AB, GK, RR, SV), pp. 100–105.
STOC-1997-IndykMRV #multi
Locality-Preserving Hashing in Multidimensional Spaces (PI, RM, PR, SV), pp. 618–625.
Sampling Lattice Points (RK, SV), pp. 696–700.
STOC-1996-BlumRV #algorithm #approximate #problem
A Constant-factor Approximation Algorithm for the k MST Problem (AB, RR, SV), pp. 442–448.
STOC-1995-AwerbuchABV #approximate
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen (BA, YA, AB, SV), pp. 277–283.
STOC-1995-BlumCV #approximate #problem
A constant-factor approximation for the k-MST problem in the plane (AB, PC, SV), pp. 294–302.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.