RECENT PAPERS


Algorithms & Complexity, Optimization, Dynamical Systems and Probability


  1. Bullet Computing maximum entropy distributions everywhere. [arXiv]

Damian Straszak, Nisheeth K. Vishnoi


  1. Bullet On convex programming relaxations for the permanent. [arxiv]

Damian Straszak, Nisheeth K. Vishnoi


  1. Bullet Classification with Fairness Constraints: A Meta-Algorithm with Provable Guarantees. [arXiv]

L. Elisa Celis, Lingxiao Huang, Vijay Keswani, Nisheeth K. Vishnoi

ACM FAT* 2019.


  1. Bullet An Algorithmic Framework to Control Bias in Bandit-based Personalization. [arXiv]

L. Elisa Celis, Sayash Kapoor, Farnood Salehi, Nisheeth K. Vishnoi

ACM FAT* 2019.


  1. Bullet On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). [arXiv]

Rohit Gurjar, Nisheeth K. Vishnoi

SODA 2019.


  1. Bullet Dimensionally tight running time bounds for second-order Hamiltonian Monte Carlo. [arXiv]

Oren Mangoubi, Nisheeth K. Vishnoi

NIPS 2018.


  1. Bullet On geodesically convex formulations for the Brascamp-Lieb constant. [arXiv]

Suvrit Sra, Nisheeth K. Vishnoi, Ozan Yildiz

APPROX 2018.


  1. Bullet Convex optimization with nonconvex oracles. [arXiv]

Oren Mangoubi, Nisheeth K. Vishnoi

COLT 2018.


  1. Bullet Group fairness in multiwinner voting. [arxiv]

L. Elisa Celis, Lingxiao Huang, Nisheeth K. Vishnoi

IJCAI-ECAI 2018.


  1. Bullet Isolating a vertex via lattices: Polytopes with totally unimodular faces. [arxiv]

Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi

ICALP 2018.


  1. Bullet Ranking with Fairness Constraints. [arxiv]

L. Elisa Celis, Damian Straszak, Nisheeth K. Vishnoi

ICALP 2018.


  1. Bullet Belief Propagation, Bethe Approximation and Polynomials. [arxiv]

Damian Straszak, Nisheeth K. Vishnoi

Invited to ALLERTON 2017.


  1. Bullet Subdeterminant maximization via nonconvex relaxations and anticoncentration. [arXiv]

Javad Ebrahimi, Damian Straszak, Nisheeth K. Vishnoi

FOCS 2017.


  1. Bullet On the Complexity of Constrained Determinantal Point Processes. [arxiv]

L. Elisa Celis, Amit Deshpande, Tarun Kathuria, Damian Straszak, Nisheeth K. Vishnoi

RANDOM 2017.


  1. Bullet Real stable polynomials and matroids: optimization and counting. [arxiv]

Damian Straszak, Nisheeth K. Vishnoi

STOC 2017.


  1. Bullet IRLS and Slime Mold: Equivalence and Convergence. [arXiv]

Damian Straszak, Nisheeth K. Vishnoi

Invited to ITCS 2017.


  1. Bullet Random walks in polytopes and negative dependence

Yuval Peres, Mohit Singh, Nisheeth K. Vishnoi

ITCS 2017.


  1. Bullet The Mixing time of the Dikin walk in polytopes -- a simple proof. [journal]

Sushant Sachdeva, Nisheeth K. Vishnoi

Operations Research Letters 2016.


  1. Bullet Mixing time of Markov chains, dynamical systems and evolution. [pdf]

Ioannis Panageas, Nisheeth K. Vishnoi

ICALP 2016.


  1. Bullet On a natural dynamics for linear programming. [arxiv]

Damian Straszak, Nisheeth K. Vishnoi

ITCS 2016.


  1. Bullet On the computational complexity of limit cycles in dynamical systems. [arxiv]

Christos H. Papadimitriou, Nisheeth K. Vishnoi

ITCS 2016.


  1. Bullet Natural algorithms for flow problems. [journal]

Damian Straszak, Nisheeth K. Vishnoi

SODA 2016.


  1. Bullet Evolutionary dynamics in finite populations mix rapidly. [pdf]

Ioannis Panageas, Piyush Srivastava, Nisheeth K. Vishnoi

SODA 2016.


  1. BulletThe unique games conjecture, integrality gap for cut problems and the embeddability of negative type metrics into l_1. [journal]

Subhash Khot, Nisheeth K. Vishnoi

Journal of the ACM, 62(1), 2015.


  1. Bullet The speed of evolution. [pdf]

Nisheeth K. Vishnoi

SODA 2015.


  1. Bullet Entropy, optimization and counting. [arxiv]

Mohit Singh, Nisheeth K. Vishnoi

STOC 2014.


  1. Bullet Almost polynomial factor hardness for Closest Vector Problem with Preprocessing. [journal]

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi

SIAM Journal of Computing, 43(3), 1184–1205, 2014.


  1. Bullet Towards polynomial simlpex-like algorithms for market equilibria. [pdf]

Jugal Garg, Ruta Mehta, Milind Sohoni, Nisheeth K. Vishnoi

SODA 2013.


  1. Bullet A permanent approach to the traveling salesman problem. [conf]

Nisheeth K. Vishnoi

FOCS 2012.


  1. Bullet A Local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally. [journal]

Michael W. Mahoney, Lorenzo Orecchia, Nisheeth K. Vishnoi

In Journal of Machine Learning Research (JMLR),Vol 13., pp. 2339-2365, 2012.


  1. Bullet 2^{\log^{1-\eps} n} hardness for closest vector problem with preprocessing. [arxiv]

Subhash Khot, Preyas Popat, Nisheeth K. Vishnoi

STOC 2012.


  1. Bullet Approximating the exponential, the lanczos method and an \tilde{O}(m)-time spectral algorithm for balanced separator. [arxiv]

Lorenzo Orecchia, Sushant Sachdeva, Nisheeth K. Vishnoi

STOC 2012.


  1. BulletHardness of approximating the closest vector problem with pre-processing. [journal]

Misha Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi

Computational Complexity, 2012



OTHER TOPICS


BulletAlogrithmic Bias


BulletNatural Algorithms and Evolution



ALL PAPERS