Nisheeth K. Vishnoi, Ph.D.
Affiliations: | 2004 | Georgia Institute of Technology, Atlanta, GA |
Area:
Computer Science, Operations ResearchGoogle:
"Nisheeth Vishnoi"Parents
Sign in to add mentor| Richard Lipton | grad student | 2004 | Georgia Tech | |
| (Theoretical aspects of randomization in computation.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Straszak D, Vishnoi NK. (2019) Belief Propagation, Bethe Approximation and Polynomials Ieee Transactions On Information Theory. 65: 4353-4363 |
| Sachdeva S, Vishnoi NK. (2016) The mixing time of the Dikin walk in a polytope—A simple proof Operations Research Letters. 44: 630-634 |
| Khot SA, Vishnoi NK. (2015) The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into ℓ1 Journal of the Acm. 62: 8 |
| Gopalan P, Karloff H, Mehta A, et al. (2015) Caching with expiration times for internet applications Internet Mathematics. 2: 165-184 |
| Khot SA, Popat P, Vishnoi NK. (2014) Almost polynomial factor hardness for closest vector problem with preprocessing Siam Journal On Computing. 43: 1184-1205 |
| Orecchia L, Sachdeva S, Vishnoi NK. (2012) Approximating the exponential, the Lanczos method and an Õ(m)-time spectral algorithm for balanced separator Proceedings of the Annual Acm Symposium On Theory of Computing. 1141-1159 |
| Vishnoi NK. (2012) A permanent approach to the traveling salesman problem Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 76-80 |
| Louis A, Vishnoi NK. (2010) Improved algorithm for degree bounded survivable network design problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6139: 408-419 |
| Bläser M, Hardt M, Lipton RJ, et al. (2009) Deterministically testing sparse polynomial identities of unbounded degree Information Processing Letters. 109: 187-192 |
| Kolountzakis MN, Lipton RJ, Markakis E, et al. (2009) On the Fourier spectrum of symmetric Boolean functions Combinatorica. 29: 363-387 |