☰

Nisheeth K. Vishnoi, Ph.D. - Publications

Affiliations: 
2004 Georgia Institute of Technology, Atlanta, GA 
Area:
Computer Science, Operations Research
Tree Info Similar researchers PubMed Report error

11 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Straszak D, Vishnoi NK. Belief Propagation, Bethe Approximation and Polynomials Ieee Transactions On Information Theory. 65: 4353-4363. DOI: 10.1109/Tit.2019.2901854  0.345
2016 Sachdeva S, Vishnoi NK. The mixing time of the Dikin walk in a polytope—A simple proof Operations Research Letters. 44: 630-634. DOI: 10.1016/J.Orl.2016.07.005  0.34
2015 Khot SA, Vishnoi NK. The unique games conjecture, integrality gap for cut problems and embeddability of negative-type metrics into ℓ1 Journal of the Acm. 62: 8. DOI: 10.1145/2629614  0.308
2015 Gopalan P, Karloff H, Mehta A, Mihail M, Vishnoi N. Caching with expiration times for internet applications Internet Mathematics. 2: 165-184. DOI: 10.1080/15427951.2005.10129102  0.437
2014 Khot SA, Popat P, Vishnoi NK. Almost polynomial factor hardness for closest vector problem with preprocessing Siam Journal On Computing. 43: 1184-1205. DOI: 10.1137/130919623  0.302
2012 Orecchia L, Sachdeva S, Vishnoi NK. 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. DOI: 10.1145/2213977.2214080  0.301
2012 Vishnoi NK. A permanent approach to the traveling salesman problem Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 76-80. DOI: 10.1109/FOCS.2012.81  0.311
2010 Louis A, Vishnoi NK. 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. DOI: 10.1007/978-3-642-13731-0_38  0.31
2009 Bläser M, Hardt M, Lipton RJ, Vishnoi NK. Deterministically testing sparse polynomial identities of unbounded degree Information Processing Letters. 109: 187-192. DOI: 10.1016/J.Ipl.2008.09.029  0.358
2009 Kolountzakis MN, Lipton RJ, Markakis E, Mehta A, Vishnoi NK. On the Fourier spectrum of symmetric Boolean functions Combinatorica. 29: 363-387. DOI: 10.1007/S00493-009-2310-Z  0.469
2005 Lipton RJ, Mehta A, Markakis E, Vishnoi NK. On the Fourier spectrum of symmetric boolean functions with applications to learning symmetric juntas Proceedings of the Annual Ieee Conference On Computational Complexity. 112-119. DOI: 10.1109/CCC.2005.19  0.441
Show low-probability matches.