Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDNisheeth K. Vishnoi
Person information
- affiliation: Yale University
- affiliation: Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c63]L. Elisa Celis, Chris Hays, Anay Mehrotra, Nisheeth K. Vishnoi:
The Effect of the Rooney Rule on Implicit Bias in the Long Term. FAccT 2021: 678-689- 2020
- [j16]Javad B. Ebrahimi
, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration. SIAM J. Comput. 49(6): 1249-1270 (2020) - [c62]L. Elisa Celis, Anay Mehrotra, Nisheeth K. Vishnoi:
Interventions for ranking in the presence of implicit bias. FAT* 2020: 369-380 - [c61]L. Elisa Celis, Vijay Keswani, Nisheeth K. Vishnoi:
Data preprocessing to mitigate bias: A maximum entropy based approach. ICML 2020: 1349-1359 - [c60]Lingxiao Huang, K. Sudhir, Nisheeth K. Vishnoi:
Coresets for Regressions with Panel Data. NeurIPS 2020 - [c59]Jonathan Leake, Nisheeth K. Vishnoi:
On the computability of continuous maximum entropy distributions with applications. STOC 2020: 930-943 - [c58]Lingxiao Huang, Nisheeth K. Vishnoi:
Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal. STOC 2020: 1416-1429 - [i60]L. Elisa Celis, Anay Mehrotra, Nisheeth K. Vishnoi:
Interventions for Ranking in the Presence of Implicit Bias. CoRR abs/2001.08767 (2020) - [i59]Lingxiao Huang, Nisheeth K. Vishnoi:
Coresets for Clustering in Euclidean Spaces: Importance Sampling is Nearly Optimal. CoRR abs/2004.06263 (2020) - [i58]Jonathan Leake, Nisheeth K. Vishnoi:
On the computability of continuous maximum entropy distributions with applications. CoRR abs/2004.07403 (2020) - [i57]L. Elisa Celis, Lingxiao Huang, Nisheeth K. Vishnoi:
Fair Classification with Noisy Protected Attributes. CoRR abs/2006.04778 (2020) - [i56]Oren Mangoubi, Nisheeth K. Vishnoi:
A Second-order Equilibrium in Nonconvex-Nonconcave Min-max Optimization: Existence and Algorithm. CoRR abs/2006.12363 (2020) - [i55]Oren Mangoubi, Sushant Sachdeva, Nisheeth K. Vishnoi:
A Provably Convergent and Practical Algorithm for Min-max Optimization with Applications to GANs. CoRR abs/2006.12376 (2020) - [i54]L. Elisa Celis, Chris Hays, Anay Mehrotra, Nisheeth K. Vishnoi:
The Effect of the Rooney Rule on Implicit Bias in the Long Term. CoRR abs/2010.10992 (2020) - [i53]Lingxiao Huang, K. Sudhir, Nisheeth K. Vishnoi:
Coresets for Regressions with Panel Data. CoRR abs/2011.00981 (2020) - [i52]Jonathan Leake, Nisheeth K. Vishnoi:
On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups. CoRR abs/2011.01851 (2020) - [i51]Jonathan Leake, Colin S. McSwiggen, Nisheeth K. Vishnoi:
A Polynomial-Time Algorithm and Applications for Matrix Sampling from Harish-Chandra-Itzykson-Zuber Densities. CoRR abs/2011.05417 (2020)
2010 – 2019
- 2019
- [j15]L. Elisa Celis, Sayash Kapoor, Farnood Salehi, Vijay Keswani, Nisheeth K. Vishnoi:
A dashboard for controlling polarization in personalization. AI Commun. 32(1): 77-89 (2019) - [j14]Nisheeth K. Vishnoi:
Technical perspective: Isolating a matching when your coins go missing. Commun. ACM 62(3): 108 (2019) - [j13]Damian Straszak, Nisheeth K. Vishnoi:
Belief Propagation, Bethe Approximation and Polynomials. IEEE Trans. Inf. Theory 65(7): 4353-4363 (2019) - [c57]Oren Mangoubi, Nisheeth K. Vishnoi:
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm. COLT 2019: 2259-2293 - [c56]Damian Straszak, Nisheeth K. Vishnoi:
Maximum Entropy Distributions: Bit Complexity and Stability. COLT 2019: 2861-2891 - [c55]L. Elisa Celis, Sayash Kapoor, Farnood Salehi, Nisheeth K. Vishnoi:
Controlling Polarization in Personalization: An Algorithmic Framework. FAT 2019: 160-169 - [c54]L. Elisa Celis, Lingxiao Huang, Vijay Keswani, Nisheeth K. Vishnoi:
Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees. FAT 2019: 319-328 - [c53]Oren Mangoubi, Nisheeth K. Vishnoi:
Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk. FOCS 2019: 1338-1357 - [c52]Lingxiao Huang, Nisheeth K. Vishnoi:
Stable and Fair Classification. ICML 2019: 2879-2890 - [c51]L. Elisa Celis, Anay Mehrotra, Nisheeth K. Vishnoi:
Toward Controlling Discrimination in Online Ad Auctions. ICML 2019: 4456-4465 - [c50]Holden Lee, Oren Mangoubi, Nisheeth K. Vishnoi:
Online sampling from log-concave distributions. NeurIPS 2019: 1226-1237 - [c49]Lingxiao Huang, Shaofeng H.-C. Jiang, Nisheeth K. Vishnoi:
Coresets for Clustering with Fairness Constraints. NeurIPS 2019: 7587-7598 - [c48]Rohit Gurjar, Nisheeth K. Vishnoi:
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). SODA 2019: 861-880 - [c47]Weiming Feng, Nisheeth K. Vishnoi, Yitong Yin:
Dynamic sampling from graphical models. STOC 2019: 1070-1081 - [i50]L. Elisa Celis, Anay Mehrotra, Nisheeth K. Vishnoi:
Fair Online Advertising. CoRR abs/1901.10450 (2019) - [i49]Lingxiao Huang, Nisheeth K. Vishnoi:
Stable and Fair Classification. CoRR abs/1902.07823 (2019) - [i48]Holden Lee, Oren Mangoubi, Nisheeth K. Vishnoi:
Online Sampling from Log-Concave Distributions. CoRR abs/1902.08179 (2019) - [i47]Oren Mangoubi, Nisheeth K. Vishnoi:
Nonconvex sampling with the Metropolis-adjusted Langevin algorithm. CoRR abs/1902.08452 (2019) - [i46]Oren Mangoubi, Nisheeth K. Vishnoi:
Faster algorithms for polytope rounding, sampling, and volume computation via a sublinear "Ball Walk". CoRR abs/1905.01745 (2019) - [i45]L. Elisa Celis, Vijay Keswani, Ozan Yildiz, Nisheeth K. Vishnoi:
Fair Distributions from Biased Samples: A Maximum Entropy Optimization Framework. CoRR abs/1906.02164 (2019) - [i44]Lingxiao Huang, Shaofeng H.-C. Jiang, Nisheeth K. Vishnoi:
Coresets for Clustering with Fairness Constraints. CoRR abs/1906.08484 (2019) - 2018
- [c46]Suvrit Sra, Nisheeth K. Vishnoi, Ozan Yildiz:
On Geodesically Convex Formulations for the Brascamp-Lieb Constant. APPROX-RANDOM 2018: 25:1-25:15 - [c45]Oren Mangoubi, Nisheeth K. Vishnoi:
Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing. COLT 2018: 1086-1124 - [c44]L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi:
Ranking with Fairness Constraints. ICALP 2018: 28:1-28:15 - [c43]Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. ICALP 2018: 74:1-74:14 - [c42]L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi:
Fair and Diverse DPP-Based Data Summarization. ICML 2018: 715-724 - [c41]L. Elisa Celis, Lingxiao Huang, Nisheeth K. Vishnoi:
Multiwinner Voting with Fairness Constraints. IJCAI 2018: 144-151 - [c40]Sayash Kapoor, Vijay Keswani, Nisheeth K. Vishnoi, L. Elisa Celis:
Balanced News Using Constrained Bandit-based Personalization. IJCAI 2018: 5835-5837 - [c39]Oren Mangoubi, Nisheeth K. Vishnoi:
Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo. NeurIPS 2018: 6030-6040 - [i43]L. Elisa Celis, Vijay Keswani, Damian Straszak, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi:
Fair and Diverse DPP-based Data Summarization. CoRR abs/1802.04023 (2018) - [i42]L. Elisa Celis, Sayash Kapoor, Farnood Salehi, Nisheeth K. Vishnoi:
An Algorithmic Framework to Control Bias in Bandit-based Personalization. CoRR abs/1802.08674 (2018) - [i41]Oren Mangoubi, Nisheeth K. Vishnoi:
Dimensionally Tight Running Time Bounds for Second-Order Hamiltonian Monte Carlo. CoRR abs/1802.08898 (2018) - [i40]Nisheeth K. Vishnoi, Ozan Yildiz:
On Geodesically Convex Formulations for the Brascamp-Lieb Constant. CoRR abs/1804.04051 (2018) - [i39]L. Elisa Celis, Lingxiao Huang, Vijay Keswani, Nisheeth K. Vishnoi:
Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees. CoRR abs/1806.06055 (2018) - [i38]Nisheeth K. Vishnoi:
Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity. CoRR abs/1806.06373 (2018) - [i37]Sayash Kapoor, Vijay Keswani, Nisheeth K. Vishnoi, L. Elisa Celis:
Balanced News Using Constrained Bandit-based Personalization. CoRR abs/1806.09202 (2018) - [i36]Rohit Gurjar, Nisheeth K. Vishnoi:
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). CoRR abs/1807.05164 (2018) - 2017
- [c38]Damian Straszak, Nisheeth K. Vishnoi:
Belief propagation, bethe approximation and polynomials. Allerton 2017: 666-671 - [c37]L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi:
On the Complexity of Constrained Determinantal Point Processes. APPROX-RANDOM 2017: 36:1-36:22 - [c36]Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration. FOCS 2017: 1020-1031 - [c35]Yuval Peres, Mohit Singh, Nisheeth K. Vishnoi:
Random Walks in Polytopes and Negative Dependence. ITCS 2017: 50:1-50:10 - [c34]L. Elisa Celis, Peter M. Krafft, Nisheeth K. Vishnoi:
A Distributed Learning Dynamics in Social Groups. PODC 2017: 441-450 - [c33]Damian Straszak, Nisheeth K. Vishnoi:
Real stable polynomials and matroids: optimization and counting. STOC 2017: 370-383 - [c32]L. Elisa Celis, Mina Dalirrooyfard, Nisheeth K. Vishnoi:
A Dynamics for Advertising on Networks. WINE 2017: 88-102 - [i35]Damian Straszak, Nisheeth K. Vishnoi:
On Convex Programming Relaxations for the Permanent. CoRR abs/1701.01419 (2017) - [i34]L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi:
Ranking with Fairness Constraints. CoRR abs/1704.06840 (2017) - [i33]L. Elisa Celis, Peter M. Krafft, Nisheeth K. Vishnoi:
A Distributed Learning Dynamics in Social Groups. CoRR abs/1705.03414 (2017) - [i32]L. Elisa Celis, Nisheeth K. Vishnoi:
Fair Personalization. CoRR abs/1707.02260 (2017) - [i31]Javad B. Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi:
Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration. CoRR abs/1707.02757 (2017) - [i30]Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. CoRR abs/1708.02222 (2017) - [i29]Damian Straszak, Nisheeth K. Vishnoi:
Belief Propagation, Bethe Approximation and Polynomials. CoRR abs/1708.02581 (2017) - [i28]L. Elisa Celis, Lingxiao Huang, Nisheeth K. Vishnoi:
Group Fairness in Multiwinner Voting. CoRR abs/1710.10057 (2017) - [i27]Damian Straszak, Nisheeth K. Vishnoi:
Computing Maximum Entropy Distributions Everywhere. CoRR abs/1711.02036 (2017) - [i26]Oren Mangoubi, Nisheeth K. Vishnoi:
Convex Optimization with Nonconvex Oracles. CoRR abs/1711.02621 (2017) - [i25]Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. Electron. Colloquium Comput. Complex. 24: 127 (2017) - 2016
- [j12]Sushant Sachdeva, Nisheeth K. Vishnoi:
The mixing time of the Dikin walk in a polytope - A simple proof. Oper. Res. Lett. 44(5): 630-634 (2016) - [c31]Nisheeth K. Vishnoi:
Evolution and Computation (Invited Talk). Computational Complexity Conference 2016: 21:1-21:1 - [c30]Ioannis Panageas, Nisheeth K. Vishnoi:
Mixing Time of Markov Chains, Dynamical Systems and Evolution. ICALP 2016: 63:1-63:14 - [c29]Damian Straszak, Nisheeth K. Vishnoi:
On a Natural Dynamics for Linear Programming. ITCS 2016: 291 - [c28]Christos H. Papadimitriou, Nisheeth K. Vishnoi:
On the Computational Complexity of Limit Cycles in Dynamical Systems. ITCS 2016: 403 - [c27]Ioannis Panageas, Piyush Srivastava, Nisheeth K. Vishnoi:
Evolutionary Dynamics in Finite Populations Mix Rapidly. SODA 2016: 480-497 - [c26]Damian Straszak, Nisheeth K. Vishnoi:
Natural Algorithms for Flow Problems. SODA 2016: 1868-1883 - [i24]Damian Straszak, Nisheeth K. Vishnoi:
IRLS and Slime Mold: Equivalence and Convergence. CoRR abs/1601.02712 (2016) - [i23]Damian Straszak, Nisheeth K. Vishnoi:
Generalized Determinantal Point Processes: The Linear Case. CoRR abs/1608.00554 (2016) - [i22]L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Nisheeth K. Vishnoi:
How to be Fair and Diverse? CoRR abs/1610.07183 (2016) - [i21]Damian Straszak, Nisheeth K. Vishnoi:
Real Stable Polynomials and Matroids: Optimization and Counting. CoRR abs/1611.04548 (2016) - [i20]Nick Barton, Per Kristian Lehre, Nisheeth K. Vishnoi:
Evolution and Computing (Dagstuhl Seminar 16011). Dagstuhl Reports 6(1): 1-14 (2016) - 2015
- [j11]Subhash Khot, Nisheeth K. Vishnoi:
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1. J. ACM 62(1): 8:1-8:39 (2015) - [c25]Nisheeth K. Vishnoi:
The Speed of Evolution. SODA 2015: 1590-1601 - [i19]Sushant Sachdeva, Nisheeth K. Vishnoi:
A Simple Analysis of the Dikin Walk. CoRR abs/1508.01977 (2015) - [i18]Damian Straszak, Nisheeth K. Vishnoi:
On a Natural Dynamics for Linear Programming. CoRR abs/1511.07020 (2015) - [i17]Christos H. Papadimitriou, Nisheeth K. Vishnoi:
On the Computational Complexity of Limit Cycles in Dynamical Systems. CoRR abs/1511.07605 (2015) - 2014
- [j10]Sushant Sachdeva, Nisheeth K. Vishnoi:
Faster Algorithms via Approximation Theory. Found. Trends Theor. Comput. Sci. 9(2): 125-210 (2014) - [j9]Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi:
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing. SIAM J. Comput. 43(3): 1184-1205 (2014) - [c24]Mohit Singh, Nisheeth K. Vishnoi:
Entropy, optimization and counting. STOC 2014: 50-59 - [i16]Rahul Jain, Troy Lee, Nisheeth K. Vishnoi:
A quadratically tight partition bound for classical communication complexity and query complexity. CoRR abs/1401.4512 (2014) - 2013
- [j8]Nisheeth K. Vishnoi:
Lx = b. Found. Trends Theor. Comput. Sci. 8(1-2): 1-141 (2013) - [c23]Nisheeth K. Vishnoi:
Making evolution rigorous: the error threshold. ITCS 2013: 59-60 - [c22]Jugal Garg, Ruta Mehta, Milind A. Sohoni, Nisheeth K. Vishnoi:
Towards Polynomial Simplex-Like Algorithms for Market Equlibria. SODA 2013: 1226-1242 - [e1]Anil Seth, Nisheeth K. Vishnoi:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India. LIPIcs 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2013, ISBN 978-3-939897-64-4 [contents] - [i15]Mohit Singh, Nisheeth K. Vishnoi:
Entropy, Optimization and Counting. CoRR abs/1304.8108 (2013) - [i14]Sushant Sachdeva, Nisheeth K. Vishnoi:
Matrix Inversion Is As Easy As Exponentiation. CoRR abs/1305.0526 (2013) - [i13]Subhash Khot, Nisheeth K. Vishnoi:
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into ℓ1. CoRR abs/1305.4581 (2013) - [i12]Sushant Sachdeva, Nisheeth K. Vishnoi:
Approximation Theory and the Design of Fast Algorithms. CoRR abs/1309.4882 (2013) - 2012
- [j7]Narendra M. Dixit, Piyush Srivastava, Nisheeth K. Vishnoi:
A Finite Population Model of Molecular Evolution: Theory and Computation. J. Comput. Biol. 19(10): 1176-1202 (2012) - [j6]Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi:
A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. J. Mach. Learn. Res. 13: 2339-2365 (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 Comput. Biol. 8(9) (2012) - [c21]Nisheeth K. Vishnoi:
A Permanent Approach to the Traveling Salesman Problem. FOCS 2012: 76-80 - [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. Comput. Complex. 20(4): 741-753 (2011) - [c18]Subhransu Maji, Nisheeth K. Vishnoi, Jitendra Malik:
Biased normalized cuts. CVPR 2011: 2057-2064 - [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. Electron. Colloquium Comput. Complex. 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. Comb. 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. Electron. Colloquium Comput. Complex. 16: 124 (2009) - [i1]David Steurer, Nisheeth K. Vishnoi:
Connections Between Unique Games and Multicut. Electron. Colloquium Comput. Complex. 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 Math. 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. Computational Complexity Conference 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
- [b1]Nisheeth K. Vishnoi:
Theoretical Aspects of Randomization in Computation. Georgia Institute of Technology, Atlanta, GA, USA, 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]Nisheeth K. Vishnoi:
Non Uniform Random Walks. DRW 2003: 345-358 - [c3]