( en | de | ru )

 

Disambiguation of "Vempala, Santosh S."

Author of the publication

copydeleteadd this publication to your clipboard
Nash Equilibria in Random Games.

, , and . FOCS, page 123-131. IEEE Computer Society, (2005)

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 Vijayan

Santosh Nepal

Santosh Hosmani

 

Other publications of authors with the same name

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems., , , and . Theor. Comput. Sci., 235 (1): 25-42 (2000)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)Factor 4/3 approximations for minimum 2-connected subgraphs., and . APPROX, volume 1913 of Lecture Notes in Computer Science, page 262-273. Springer, (2000)Design and deployment of a blood safety monitoring tool., , , , and . ICTD, page 280-287. IEEE, (2009)Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices., and . NeurIPS, page 8092-8104. (2019)Condition-number-independent Convergence Rate of Riemannian Hamiltonian Monte Carlo with Numerical Integrators., , , and . COLT, volume 195 of Proceedings of Machine Learning Research, page 4504-4569. PMLR, (2023)Effective Principal Component Analysis.. SISAP, volume 7404 of Lecture Notes in Computer Science, page 1-7. Springer, (2012)On The Approximability Of The Traveling Salesman Problem., and . Combinatorica, 26 (1): 101-120 (2006)