Feldman, Vitaly; Grigorescu, Elena; Reyzin, Lev; Vempala, Santosh S.; Xiao, Ying Statistical algorithms and a lower bound for detecting planted cliques. (English) Zbl 1397.68085 J. ACM 64, No. 2, Article No. 8, 37 p. (2017). MSC: 68Q17 05C69 05C80 68Q87 68T05 PDFBibTeX XMLCite \textit{V. Feldman} et al., J. ACM 64, No. 2, Article No. 8, 37 p. (2017; Zbl 1397.68085) Full Text: DOI arXiv
Vempala, Santosh A random-sampling-based algorithm for learning intersections of halfspaces. (English) Zbl 1327.68200 J. ACM 57, No. 6, Article No. 32, 14 p. (2010). MSC: 68T05 PDFBibTeX XMLCite \textit{S. Vempala}, J. ACM 57, No. 6, Article No. 32, 14 p. (2010; Zbl 1327.68200) Full Text: DOI
Štefankovič, Daniel; Vempala, Santosh; Vigoda, Eric Adaptive simulated annealing: a near-optimal connection between sampling and counting. (English) Zbl 1325.68198 J. ACM 56, No. 3, Article No. 18, 36 p. (2009). MSC: 68T05 60C05 62D05 PDFBibTeX XMLCite \textit{D. Štefankovič} et al., J. ACM 56, No. 3, Article No. 18, 36 p. (2009; Zbl 1325.68198) Full Text: DOI Link
Bertsimas, Dimitris; Vempala, Santosh Solving convex programs by random walks. (English) Zbl 1204.90074 J. ACM 51, No. 4, 540-556 (2004). MSC: 90C25 68W40 90C59 PDFBibTeX XMLCite \textit{D. Bertsimas} and \textit{S. Vempala}, J. ACM 51, No. 4, 540--556 (2004; Zbl 1204.90074) Full Text: DOI
Kannan, Ravi; Vempala, Santosh; Vetta, Adrian On clusterings: good, bad and spectral. (English) Zbl 1192.05160 J. ACM 51, No. 3, 497-515 (2004). MSC: 05C85 05C50 68W40 PDFBibTeX XMLCite \textit{R. Kannan} et al., J. ACM 51, No. 3, 497--515 (2004; Zbl 1192.05160) Full Text: DOI
Frieze, Alan; Kannan, Ravi; Vempala, Santosh Fast Monte-Carlo algorithms for finding low-rank approximations. (English) Zbl 1125.65005 J. ACM 51, No. 6, 1025-1041 (2004). MSC: 65C05 65F30 68P20 68W20 68W40 PDFBibTeX XMLCite \textit{A. Frieze} et al., J. ACM 51, No. 6, 1025--1041 (2004; Zbl 1125.65005) Full Text: DOI