Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nisheeth K. Vishnoi
2010 – today
- 2013
[c23]- [c22]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Nisheeth K. Vishnoi: Towards Polynomial Simplex-Like Algorithms for Market Equlibria. SODA 2013: 1226-1242
- [i14]
- [i13]Sushant Sachdeva, Nisheeth K. Vishnoi: Matrix Inversion Is As Easy As Exponentiation. CoRR abs/1305.0526 (2013)
- [i12]Subhash Khot, Nisheeth K. Vishnoi: The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into $\ell_1$. CoRR abs/1305.4581 (2013)
- 2012
- [j6]Narendra M. Dixit, Piyush Srivastava, Nisheeth K. Vishnoi: A Finite Population Model of Molecular Evolution: Theory and Computation. Journal of Computational Biology 19(10): 1176-1202 (2012)
- [j5]Kushal Tripathi, Rajesh Balagam, Nisheeth K. Vishnoi, Narendra M. Dixit: Stochastic Simulations Suggest that HIV-1 Survives Close to Its Error Threshold. PLoS Computational Biology 8(9) (2012)
- [c21]
- [c20]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi: 2log1-ε n hardness for the closest vector problem with preprocessing. STOC 2012: 277-288
- [c19]Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi: Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator. STOC 2012: 1141-1160
- [i11]Narendra M. Dixit, Piyush Srivastava, Nisheeth K. Vishnoi: A Finite Population Model of Molecular Evolution: Theory and Computation. CoRR abs/1203.1287 (2012)
- 2011
- [j4]Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. Computational Complexity 20(4): 741-753 (2011)
- [c18]
- [c17]Amit Deshpande, Madhur Tulsiani, Nisheeth K. Vishnoi: Algorithms and Hardness for Subspace Approximation. SODA 2011: 482-496
- [c16]Lorenzo Orecchia, Nisheeth K. Vishnoi: Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. SODA 2011: 532-545
- [c15]Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi: On LP-Based Approximability for Strict CSPs. SODA 2011: 1560-1573
- [i10]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi: $2^{\log^{1-\eps} n}$ Hardness for Closest Vector Problem with Preprocessing. CoRR abs/1109.2176 (2011)
- [i9]Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi: Approximating the Exponential, the Lanczos Method and an \tilde{O}(m)-Time Spectral Algorithm for Balanced Separator. CoRR abs/1111.1491 (2011)
- [i8]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi: 2log1-έn Hardness for Closest Vector Problem with Preprocessing. Electronic Colloquium on Computational Complexity (ECCC) 18: 119 (2011)
- 2010
- [c14]Anand Louis, Nisheeth K. Vishnoi: Improved Algorithm for Degree Bounded Survivable Network Design Problem. SWAT 2010: 408-419
- [i7]Lorenzo Orecchia, Nisheeth K. Vishnoi: Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition. CoRR abs/1010.4108 (2010)
2000 – 2009
- 2009
- [j3]Mihail N. Kolountzakis, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi: On the Fourier spectrum of symmetric Boolean functions. Combinatorica 29(3): 363-387 (2009)
- [j2]Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi: Deterministically testing sparse polynomial identities of unbounded degree. Inf. Process. Lett. 109(3): 187-192 (2009)
- [i6]Anand Louis, Nisheeth K. Vishnoi: Improved Algorithm for Degree Bounded Survivable Network Design Problem. CoRR abs/0911.4544 (2009)
- [i5]Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi: A Spectral Algorithm for Improving Graph Partitions. CoRR abs/0912.0681 (2009)
- [i4]Amit Deshpande, Kasturi R. Varadarajan, Madhur Tulsiani, Nisheeth K. Vishnoi: Algorithms and Hardness for Subspace Approximation. CoRR abs/0912.1403 (2009)
- [i3]Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi: On the Optimality of a Class of LP-based Algorithms. CoRR abs/0912.1776 (2009)
- [i2]Amit Kumar, Rajsekar Manokaran, Madhur Tulsiani, Nisheeth K. Vishnoi: On the Optimality of a Class of LP-based Algorithms. Electronic Colloquium on Computational Complexity (ECCC) 16: 124 (2009)
- [i1]David Steurer, Nisheeth K. Vishnoi: Connections Between Unique Games and Multicut. Electronic Colloquium on Computational Complexity (ECCC) 16: 125 (2009)
- 2008
- [c13]Sanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi: Unique games on expanding constraint graphs are easy: extended abstract. STOC 2008: 21-28
- [c12]Lorenzo Orecchia, Leonard J. Schulman, Umesh V. Vazirani, Nisheeth K. Vishnoi: On partitioning graphs via single commodity flows. STOC 2008: 461-470
- 2007
- [c11]Nisheeth K. Vishnoi: The Impact of Noise on the Scaling of Collectives: The Nearest Neighbor Model [Extended Abstract]. HiPC 2007: 476-487
- 2006
- [c10]Nikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi: Integrality gaps for sparsest cut and minimum linear arrangement problems. STOC 2006: 537-546
- 2005
- [j1]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with Expiration Times for Internet Applications. Internet Mathematics 2(2): 165-184 (2005)
- [c9]Richard J. Lipton, Evangelos Markakis, Aranyak Mehta, Nisheeth K. Vishnoi: On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas. IEEE Conference on Computational Complexity 2005: 112-119
- [c8]Subhash Khot, Nisheeth K. Vishnoi: The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. FOCS 2005: 53-62
- [c7]Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. FOCS 2005: 216-225
- [c6]Saurabh Agarwal, Rahul Garg, Nisheeth K. Vishnoi: The Impact of Noise on the Scaling of Collectives: A Theoretical Approach. HiPC 2005: 280-289
- 2004
- [c5]Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi: On the Complexity of Hilbert's 17th Problem. FSTTCS 2004: 237-249
- 2003
- [c4]
- [c3]Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi: Who's The Weakest Link? SAGA 2003: 108-116
- [c2]Richard J. Lipton, Nisheeth K. Vishnoi: Deterministic identity testing for multivariate polynomials. SODA 2003: 756-760
- 2002
- [c1]Parikshit Gopalan, Howard J. Karloff, Aranyak Mehta, Milena Mihail, Nisheeth K. Vishnoi: Caching with expiration times. SODA 2002: 540-547
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-04 00:23 CEST by the dblp team