( en | de | ru )

 

Disambiguation of "Vempala, Santosh S."

Author of the publication

copydeleteadd this publication to your clipboard
Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract).

, , and . SODA, page 193-200. ACM/SIAM, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Santosh Panjikar

Santosh Noronha

Santosh Nepal

Santosh Vijayan

Santosh Hosmani

 

Other publications of authors with the same name

Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev., and . STOC, page 1122-1129. ACM, (2018)Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems., , , and . Theor. Comput. Sci., 235 (1): 25-42 (2000)Effective Principal Component Analysis.. SISAP, volume 7404 of Lecture Notes in Computer Science, page 1-7. Springer, (2012)Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm., and . FOCS, page 650-659. IEEE Computer Society, (2003)Logconcave Functions: Geometry and Efficient Sampling Algorithms, and . FOCS, page 640-649. IEEE Computer Society, (2003)The Random Projection Method. DIMACS Series in Discrete Mathematics and Theoretical Computer Science DIMACS/AMS, (2004)Solving Sparse Linear Systems Faster than Matrix Multiplication., and . SODA, page 504-521. SIAM, (2021)Fences Are Futile: On Relaxations for the Linear Ordering Problem., and . IPCO, volume 2081 of Lecture Notes in Computer Science, page 333-347. Springer, (2001)Usability of Humanly Computable Passwords., , and . HCOMP, page 174-183. AAAI Press, (2018)On The Approximability Of The Traveling Salesman Problem., and . Combinatorica, 26 (1): 101-120 (2006)