default search action
BibTeX records: Nisheeth K. Vishnoi
@inproceedings{DBLP:conf/iclr/MangoubiV24, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Faster Sampling from Log-Concave Densities over Polytopes via Efficient Linear Solvers}, booktitle = {The Twelfth International Conference on Learning Representations, {ICLR} 2024, Vienna, Austria, May 7-11, 2024}, publisher = {OpenReview.net}, year = {2024}, url = {https://openreview.net/forum?id=v63GWletn8}, timestamp = {Wed, 07 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iclr/MangoubiV24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/Celis0VX24, author = {L. Elisa Celis and Amit Kumar and Nisheeth K. Vishnoi and Andrew Xu}, title = {Centralized Selection with Preferences in the Presence of Biases}, booktitle = {Forty-first International Conference on Machine Learning, {ICML} 2024, Vienna, Austria, July 21-27, 2024}, publisher = {OpenReview.net}, year = {2024}, url = {https://openreview.net/forum?id=9QRcp2ubDt}, timestamp = {Mon, 02 Sep 2024 16:45:29 +0200}, biburl = {https://dblp.org/rec/conf/icml/Celis0VX24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MangoubiV23, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Gergely Neu and Lorenzo Rosasco}, title = {Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations}, booktitle = {The Thirty Sixth Annual Conference on Learning Theory, {COLT} 2023, 12-15 July 2023, Bangalore, India}, series = {Proceedings of Machine Learning Research}, volume = {195}, pages = {1522--1587}, publisher = {{PMLR}}, year = {2023}, url = {https://proceedings.mlr.press/v195/mangoubi23a.html}, timestamp = {Wed, 06 Sep 2023 17:49:05 +0200}, biburl = {https://dblp.org/rec/conf/colt/MangoubiV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/Vishnoi23, author = {Nisheeth K. Vishnoi}, editor = {Patricia Bouyer and Srikanth Srinivasan}, title = {Algorithms in the Presence of Biased Inputs (Invited Talk)}, booktitle = {43rd {IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2023, December 18-20, 2023, {IIIT} Hyderabad, Telangana, India}, series = {LIPIcs}, volume = {284}, pages = {5:1--5:2}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2023.5}, doi = {10.4230/LIPICS.FSTTCS.2023.5}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/Vishnoi23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/BoehmerCHMV23, author = {Niclas Boehmer and L. Elisa Celis and Lingxiao Huang and Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Andreas Krause and Emma Brunskill and Kyunghyun Cho and Barbara Engelhardt and Sivan Sabato and Jonathan Scarlett}, title = {Subset Selection Based On Multiple Rankings in the Presence of Bias: Effectiveness of Fairness Constraints for Multiwinner Voting Score Functions}, booktitle = {International Conference on Machine Learning, {ICML} 2023, 23-29 July 2023, Honolulu, Hawaii, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {202}, pages = {2641--2688}, publisher = {{PMLR}}, year = {2023}, url = {https://proceedings.mlr.press/v202/boehmer23a.html}, timestamp = {Mon, 28 Aug 2023 17:23:08 +0200}, biburl = {https://dblp.org/rec/conf/icml/BoehmerCHMV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/CelisKMV23, author = {L. Elisa Celis and Amit Kumar and Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Bias in Evaluation Processes: An Optimization-Based Model}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/e4748b6b6ca49f04b6a8cfce1d5f9a70-Abstract-Conference.html}, timestamp = {Wed, 14 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nips/CelisKMV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/MangoubiV23, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Alice Oh and Tristan Naumann and Amir Globerson and Kate Saenko and Moritz Hardt and Sergey Levine}, title = {Sampling from Structured Log-Concave Distributions via a Soft-Threshold Dikin Walk}, booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023}, year = {2023}, url = {http://papers.nips.cc/paper\_files/paper/2023/hash/656faa09eb6e82dd86de9a417111c3b0-Abstract-Conference.html}, timestamp = {Fri, 01 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/MangoubiV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/www/MehrotraV23, author = {Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Ying Ding and Jie Tang and Juan F. Sequeda and Lora Aroyo and Carlos Castillo and Geert{-}Jan Houben}, title = {Maximizing Submodular Functions for Recommendation in the Presence of Biases}, booktitle = {Proceedings of the {ACM} Web Conference 2023, {WWW} 2023, Austin, TX, USA, 30 April 2023 - 4 May 2023}, pages = {3625--3636}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3543507.3583195}, doi = {10.1145/3543507.3583195}, timestamp = {Mon, 28 Aug 2023 21:17:10 +0200}, biburl = {https://dblp.org/rec/conf/www/MehrotraV23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2305-02806, author = {Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Maximizing Submodular Functions for Recommendation in the Presence of Biases}, journal = {CoRR}, volume = {abs/2305.02806}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2305.02806}, doi = {10.48550/ARXIV.2305.02806}, eprinttype = {arXiv}, eprint = {2305.02806}, timestamp = {Wed, 10 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2305-02806.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-09835, author = {Niclas Boehmer and L. Elisa Celis and Lingxiao Huang and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Subset Selection Based On Multiple Rankings in the Presence of Bias: Effectiveness of Fairness Constraints for Multiwinner Voting Score Functions}, journal = {CoRR}, volume = {abs/2306.09835}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.09835}, doi = {10.48550/ARXIV.2306.09835}, eprinttype = {arXiv}, eprint = {2306.09835}, timestamp = {Thu, 22 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-09835.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2306-16648, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Private Covariance Approximation and Eigenvalue-Gap Bounds for Complex Gaussian Perturbations}, journal = {CoRR}, volume = {abs/2306.16648}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2306.16648}, doi = {10.48550/ARXIV.2306.16648}, eprinttype = {arXiv}, eprint = {2306.16648}, timestamp = {Mon, 03 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2306-16648.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2307-09524, author = {Boaz Barak and Yael Kalai and Ran Raz and Salil P. Vadhan and Nisheeth K. Vishnoi}, title = {On the works of Avi Wigderson}, journal = {CoRR}, volume = {abs/2307.09524}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2307.09524}, doi = {10.48550/ARXIV.2307.09524}, eprinttype = {arXiv}, eprint = {2307.09524}, timestamp = {Tue, 25 Jul 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2307-09524.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2310-17489, author = {L. Elisa Celis and Amit Kumar and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Bias in Evaluation Processes: An Optimization-Based Model}, journal = {CoRR}, volume = {abs/2310.17489}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2310.17489}, doi = {10.48550/ARXIV.2310.17489}, eprinttype = {arXiv}, eprint = {2310.17489}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2310-17489.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/StraszakV22, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {Iteratively reweighted least squares and slime mold dynamics: connection and convergence}, journal = {Math. Program.}, volume = {194}, number = {1}, pages = {685--717}, year = {2022}, url = {https://doi.org/10.1007/s10107-021-01644-z}, doi = {10.1007/S10107-021-01644-Z}, timestamp = {Tue, 05 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/StraszakV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/LeakeV22, author = {Jonathan Leake and Nisheeth K. Vishnoi}, title = {On the Computability of Continuous Maximum Entropy Distributions with Applications}, journal = {{SIAM} J. Comput.}, volume = {51}, number = {5}, pages = {1451--1505}, year = {2022}, url = {https://doi.org/10.1137/21m1440864}, doi = {10.1137/21M1440864}, timestamp = {Sun, 13 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/LeakeV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MangoubiWKTV22, author = {Oren Mangoubi and Yikai Wu and Satyen Kale and Abhradeep Thakurta and Nisheeth K. Vishnoi}, editor = {Po{-}Ling Loh and Maxim Raginsky}, title = {Private Matrix Approximation and Geometry of Unitary Orbits}, booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}}, series = {Proceedings of Machine Learning Research}, volume = {178}, pages = {3547--3588}, publisher = {{PMLR}}, year = {2022}, url = {https://proceedings.mlr.press/v178/mangoubi22a.html}, timestamp = {Tue, 12 Jul 2022 17:36:51 +0200}, biburl = {https://dblp.org/rec/conf/colt/MangoubiWKTV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fat/MehrotraPV22, author = {Anay Mehrotra and Bary S. R. Pradelski and Nisheeth K. Vishnoi}, title = {Selection in the Presence of Implicit Bias: The Advantage of Intersectional Constraints}, booktitle = {FAccT '22: 2022 {ACM} Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21 - 24, 2022}, pages = {599--609}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3531146.3533124}, doi = {10.1145/3531146.3533124}, timestamp = {Wed, 22 Jun 2022 10:08:56 +0200}, biburl = {https://dblp.org/rec/conf/fat/MehrotraPV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fat/FongKMV22, author = {Hortense Fong and Vineet Kumar and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Fairness for {AUC} via Feature Augmentation}, booktitle = {FAccT '22: 2022 {ACM} Conference on Fairness, Accountability, and Transparency, Seoul, Republic of Korea, June 21 - 24, 2022}, pages = {610}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3531146.3533126}, doi = {10.1145/3531146.3533126}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fat/FongKMV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/KeswaniMSV22, author = {Vijay Keswani and Oren Mangoubi and Sushant Sachdeva and Nisheeth K. Vishnoi}, editor = {Kamalika Chaudhuri and Stefanie Jegelka and Le Song and Csaba Szepesv{\'{a}}ri and Gang Niu and Sivan Sabato}, title = {A Convergent and Dimension-Independent Min-Max Optimization Algorithm}, booktitle = {International Conference on Machine Learning, {ICML} 2022, 17-23 July 2022, Baltimore, Maryland, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {162}, pages = {10939--10973}, publisher = {{PMLR}}, year = {2022}, url = {https://proceedings.mlr.press/v162/keswani22a.html}, timestamp = {Tue, 12 Jul 2022 17:36:52 +0200}, biburl = {https://dblp.org/rec/conf/icml/KeswaniMSV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/MangoubiV22, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Sanmi Koyejo and S. Mohamed and A. Agarwal and Danielle Belgrave and K. Cho and A. Oh}, title = {Sampling from Log-Concave Distributions with Infinity-Distance Guarantees}, booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022}, year = {2022}, url = {http://papers.nips.cc/paper\_files/paper/2022/hash/520b7f40c79813ff1ec5ce41ecbea8a1-Abstract-Conference.html}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/MangoubiV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/MangoubiV22a, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Sanmi Koyejo and S. Mohamed and A. Agarwal and Danielle Belgrave and K. Cho and A. Oh}, title = {Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion}, booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022}, year = {2022}, url = {http://papers.nips.cc/paper\_files/paper/2022/hash/fbc9981dd6316378aee7fd5975250f21-Abstract-Conference.html}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/MangoubiV22a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/MehrotraV22, author = {Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Sanmi Koyejo and S. Mohamed and A. Agarwal and Danielle Belgrave and K. Cho and A. Oh}, title = {Fair Ranking with Noisy Protected Attributes}, booktitle = {Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, NeurIPS 2022, New Orleans, LA, USA, November 28 - December 9, 2022}, year = {2022}, url = {http://papers.nips.cc/paper\_files/paper/2022/hash/cdd0640218a27e9e2c0e52e324e25db0-Abstract-Conference.html}, timestamp = {Mon, 08 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/MehrotraV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-01661, author = {Anay Mehrotra and Bary S. R. Pradelski and Nisheeth K. Vishnoi}, title = {Selection in the Presence of Implicit Bias: The Advantage of Intersectional Constraints}, journal = {CoRR}, volume = {abs/2202.01661}, year = {2022}, url = {https://arxiv.org/abs/2202.01661}, eprinttype = {arXiv}, eprint = {2202.01661}, timestamp = {Wed, 09 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-01661.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-09384, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Faster Sampling from Log-Concave Distributions over Polytopes via a Soft-Threshold Dikin Walk}, journal = {CoRR}, volume = {abs/2206.09384}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.09384}, doi = {10.48550/ARXIV.2206.09384}, eprinttype = {arXiv}, eprint = {2206.09384}, timestamp = {Mon, 27 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-09384.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2207-02794, author = {Oren Mangoubi and Yikai Wu and Satyen Kale and Abhradeep Guha Thakurta and Nisheeth K. Vishnoi}, title = {Private Matrix Approximation and Geometry of Unitary Orbits}, journal = {CoRR}, volume = {abs/2207.02794}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2207.02794}, doi = {10.48550/ARXIV.2207.02794}, eprinttype = {arXiv}, eprint = {2207.02794}, timestamp = {Wed, 13 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2207-02794.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-06418, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Re-Analyze Gauss: Bounds for Private Matrix Approximation via Dyson Brownian Motion}, journal = {CoRR}, volume = {abs/2211.06418}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.06418}, doi = {10.48550/ARXIV.2211.06418}, eprinttype = {arXiv}, eprint = {2211.06418}, timestamp = {Tue, 15 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-06418.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-17067, author = {Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Fair Ranking with Noisy Protected Attributes}, journal = {CoRR}, volume = {abs/2211.17067}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.17067}, doi = {10.48550/ARXIV.2211.17067}, eprinttype = {arXiv}, eprint = {2211.17067}, timestamp = {Fri, 02 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-17067.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/FengVY21, author = {Weiming Feng and Nisheeth K. Vishnoi and Yitong Yin}, title = {Dynamic Sampling from Graphical Models}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {2}, pages = {350--381}, year = {2021}, url = {https://doi.org/10.1137/20M1315099}, doi = {10.1137/20M1315099}, timestamp = {Wed, 24 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/FengVY21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/GurjarTV21, author = {Rohit Gurjar and Thomas Thierauf and Nisheeth K. Vishnoi}, title = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {2}, pages = {636--661}, year = {2021}, url = {https://doi.org/10.1137/19M1290802}, doi = {10.1137/19M1290802}, timestamp = {Sun, 16 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/GurjarTV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GurjarV21, author = {Rohit Gurjar and Nisheeth K. Vishnoi}, title = {On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)}, journal = {{SIAM} J. Discret. Math.}, volume = {35}, number = {3}, pages = {1688--1705}, year = {2021}, url = {https://doi.org/10.1137/20M1338642}, doi = {10.1137/20M1338642}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/GurjarV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fat/CelisHMV21, author = {L. Elisa Celis and Chris Hays and Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Madeleine Clare Elish and William Isaac and Richard S. Zemel}, title = {The Effect of the Rooney Rule on Implicit Bias in the Long Term}, booktitle = {FAccT '21: 2021 {ACM} Conference on Fairness, Accountability, and Transparency, Virtual Event / Toronto, Canada, March 3-10, 2021}, pages = {678--689}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3442188.3445930}, doi = {10.1145/3442188.3445930}, timestamp = {Fri, 05 May 2023 15:54:55 +0200}, biburl = {https://dblp.org/rec/conf/fat/CelisHMV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Vishnoi21, author = {Nisheeth K. Vishnoi}, title = {{FOCS} 2021 Preface}, booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2021, Denver, CO, USA, February 7-10, 2022}, pages = {xvii}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/FOCS52979.2021.00005}, doi = {10.1109/FOCS52979.2021.00005}, timestamp = {Wed, 09 Mar 2022 12:12:23 +0100}, biburl = {https://dblp.org/rec/conf/focs/Vishnoi21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/CelisHKV21, author = {L. Elisa Celis and Lingxiao Huang and Vijay Keswani and Nisheeth K. Vishnoi}, editor = {Marina Meila and Tong Zhang}, title = {Fair Classification with Noisy Protected Attributes: {A} Framework with Provable Guarantees}, booktitle = {Proceedings of the 38th International Conference on Machine Learning, {ICML} 2021, 18-24 July 2021, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {139}, pages = {1349--1361}, publisher = {{PMLR}}, year = {2021}, url = {http://proceedings.mlr.press/v139/celis21a.html}, timestamp = {Wed, 25 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icml/CelisHKV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/CelisMV21, author = {L. Elisa Celis and Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan}, title = {Fair Classification with Adversarial Perturbations}, booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual}, pages = {8158--8171}, year = {2021}, url = {https://proceedings.neurips.cc/paper/2021/hash/44e207aecc63505eb828d442de03f2e9-Abstract.html}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nips/CelisMV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/HuangSV21, author = {Lingxiao Huang and K. Sudhir and Nisheeth K. Vishnoi}, editor = {Marc'Aurelio Ranzato and Alina Beygelzimer and Yann N. Dauphin and Percy Liang and Jennifer Wortman Vaughan}, title = {Coresets for Time Series Clustering}, booktitle = {Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, December 6-14, 2021, virtual}, pages = {22849--22862}, year = {2021}, url = {https://proceedings.neurips.cc/paper/2021/hash/c115ba9e04ab27fbbb664f932112246d-Abstract.html}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/nips/HuangSV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MangoubiV21, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {896--909}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3451097}, doi = {10.1145/3406325.3451097}, timestamp = {Tue, 22 Jun 2021 19:47:11 +0200}, biburl = {https://dblp.org/rec/conf/stoc/MangoubiV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeakeMV21, author = {Jonathan Leake and Colin S. McSwiggen and Nisheeth K. Vishnoi}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with applications to Quantum inference and differential privacy}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {1384--1397}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3451094}, doi = {10.1145/3406325.3451094}, timestamp = {Tue, 22 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LeakeMV21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-05964, author = {L. Elisa Celis and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Fair Classification with Adversarial Perturbations}, journal = {CoRR}, volume = {abs/2106.05964}, year = {2021}, url = {https://arxiv.org/abs/2106.05964}, eprinttype = {arXiv}, eprint = {2106.05964}, timestamp = {Tue, 15 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-05964.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2108-12107, author = {Nisheeth K. Vishnoi}, title = {An Introduction to Hamiltonian Monte Carlo Method for Sampling}, journal = {CoRR}, volume = {abs/2108.12107}, year = {2021}, url = {https://arxiv.org/abs/2108.12107}, eprinttype = {arXiv}, eprint = {2108.12107}, timestamp = {Thu, 02 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2108-12107.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2109-01080, author = {Jonathan Leake and Nisheeth K. Vishnoi}, title = {Optimization and Sampling Under Continuous Symmetry: Examples and Lie Theory}, journal = {CoRR}, volume = {abs/2109.01080}, year = {2021}, url = {https://arxiv.org/abs/2109.01080}, eprinttype = {arXiv}, eprint = {2109.01080}, timestamp = {Mon, 20 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2109-01080.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-15263, author = {Lingxiao Huang and K. Sudhir and Nisheeth K. Vishnoi}, title = {Coresets for Time Series Clustering}, journal = {CoRR}, volume = {abs/2110.15263}, year = {2021}, url = {https://arxiv.org/abs/2110.15263}, eprinttype = {arXiv}, eprint = {2110.15263}, timestamp = {Tue, 02 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-15263.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-04089, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Sampling from Log-Concave Distributions with Infinity-Distance Guarantees and Applications to Differentially Private Optimization}, journal = {CoRR}, volume = {abs/2111.04089}, year = {2021}, url = {https://arxiv.org/abs/2111.04089}, eprinttype = {arXiv}, eprint = {2111.04089}, timestamp = {Wed, 10 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-04089.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-12823, author = {Hortense Fong and Vineet Kumar and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Fairness for {AUC} via Feature Augmentation}, journal = {CoRR}, volume = {abs/2111.12823}, year = {2021}, url = {https://arxiv.org/abs/2111.12823}, eprinttype = {arXiv}, eprint = {2111.12823}, timestamp = {Wed, 01 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-12823.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/EbrahimiSV20, author = {Javad B. Ebrahimi and Damian Straszak and Nisheeth K. Vishnoi}, title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration}, journal = {{SIAM} J. Comput.}, volume = {49}, number = {6}, pages = {1249--1270}, year = {2020}, url = {https://doi.org/10.1137/19M1309523}, doi = {10.1137/19M1309523}, timestamp = {Thu, 31 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/EbrahimiSV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fat/CelisMV20, author = {L. Elisa Celis and Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Mireille Hildebrandt and Carlos Castillo and L. Elisa Celis and Salvatore Ruggieri and Linnet Taylor and Gabriela Zanfir{-}Fortuna}, title = {Interventions for ranking in the presence of implicit bias}, booktitle = {FAT* '20: Conference on Fairness, Accountability, and Transparency, Barcelona, Spain, January 27-30, 2020}, pages = {369--380}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3351095.3372858}, doi = {10.1145/3351095.3372858}, timestamp = {Thu, 26 Aug 2021 22:19:24 +0200}, biburl = {https://dblp.org/rec/conf/fat/CelisMV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/CelisKV20, author = {L. Elisa Celis and Vijay Keswani and Nisheeth K. Vishnoi}, title = {Data preprocessing to mitigate bias: {A} maximum entropy based approach}, booktitle = {Proceedings of the 37th International Conference on Machine Learning, {ICML} 2020, 13-18 July 2020, Virtual Event}, series = {Proceedings of Machine Learning Research}, volume = {119}, pages = {1349--1359}, publisher = {{PMLR}}, year = {2020}, url = {http://proceedings.mlr.press/v119/celis20a.html}, timestamp = {Tue, 15 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icml/CelisKV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/HuangSV20, author = {Lingxiao Huang and K. Sudhir and Nisheeth K. Vishnoi}, editor = {Hugo Larochelle and Marc'Aurelio Ranzato and Raia Hadsell and Maria{-}Florina Balcan and Hsuan{-}Tien Lin}, title = {Coresets for Regressions with Panel Data}, booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual}, year = {2020}, url = {https://proceedings.neurips.cc/paper/2020/hash/03287fcce194dbd958c2ec5b33705912-Abstract.html}, timestamp = {Tue, 19 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/HuangSV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeakeV20, author = {Jonathan Leake and Nisheeth K. Vishnoi}, editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath and Julia Chuzhoy}, title = {On the computability of continuous maximum entropy distributions with applications}, booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020}, pages = {930--943}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3357713.3384302}, doi = {10.1145/3357713.3384302}, timestamp = {Mon, 18 Dec 2023 07:33:37 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LeakeV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HuangV20, author = {Lingxiao Huang and Nisheeth K. Vishnoi}, editor = {Konstantin Makarychev and Yury Makarychev and Madhur Tulsiani and Gautam Kamath and Julia Chuzhoy}, title = {Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal}, booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020}, pages = {1416--1429}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3357713.3384296}, doi = {10.1145/3357713.3384296}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/HuangV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2001-08767, author = {L. Elisa Celis and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Interventions for Ranking in the Presence of Implicit Bias}, journal = {CoRR}, volume = {abs/2001.08767}, year = {2020}, url = {https://arxiv.org/abs/2001.08767}, eprinttype = {arXiv}, eprint = {2001.08767}, timestamp = {Thu, 30 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2001-08767.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2004-06263, author = {Lingxiao Huang and Nisheeth K. Vishnoi}, title = {Coresets for Clustering in Euclidean Spaces: Importance Sampling is Nearly Optimal}, journal = {CoRR}, volume = {abs/2004.06263}, year = {2020}, url = {https://arxiv.org/abs/2004.06263}, eprinttype = {arXiv}, eprint = {2004.06263}, timestamp = {Tue, 21 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-06263.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2004-07403, author = {Jonathan Leake and Nisheeth K. Vishnoi}, title = {On the computability of continuous maximum entropy distributions with applications}, journal = {CoRR}, volume = {abs/2004.07403}, year = {2020}, url = {https://arxiv.org/abs/2004.07403}, eprinttype = {arXiv}, eprint = {2004.07403}, timestamp = {Tue, 21 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-07403.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-04778, author = {L. Elisa Celis and Lingxiao Huang and Nisheeth K. Vishnoi}, title = {Fair Classification with Noisy Protected Attributes}, journal = {CoRR}, volume = {abs/2006.04778}, year = {2020}, url = {https://arxiv.org/abs/2006.04778}, eprinttype = {arXiv}, eprint = {2006.04778}, timestamp = {Fri, 12 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-04778.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-12363, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {A Second-order Equilibrium in Nonconvex-Nonconcave Min-max Optimization: Existence and Algorithm}, journal = {CoRR}, volume = {abs/2006.12363}, year = {2020}, url = {https://arxiv.org/abs/2006.12363}, eprinttype = {arXiv}, eprint = {2006.12363}, timestamp = {Tue, 23 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-12363.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-12376, author = {Oren Mangoubi and Sushant Sachdeva and Nisheeth K. Vishnoi}, title = {A Provably Convergent and Practical Algorithm for Min-max Optimization with Applications to GANs}, journal = {CoRR}, volume = {abs/2006.12376}, year = {2020}, url = {https://arxiv.org/abs/2006.12376}, eprinttype = {arXiv}, eprint = {2006.12376}, timestamp = {Tue, 23 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-12376.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2010-10992, author = {L. Elisa Celis and Chris Hays and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {The Effect of the Rooney Rule on Implicit Bias in the Long Term}, journal = {CoRR}, volume = {abs/2010.10992}, year = {2020}, url = {https://arxiv.org/abs/2010.10992}, eprinttype = {arXiv}, eprint = {2010.10992}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2010-10992.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-00981, author = {Lingxiao Huang and K. Sudhir and Nisheeth K. Vishnoi}, title = {Coresets for Regressions with Panel Data}, journal = {CoRR}, volume = {abs/2011.00981}, year = {2020}, url = {https://arxiv.org/abs/2011.00981}, eprinttype = {arXiv}, eprint = {2011.00981}, timestamp = {Fri, 06 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-00981.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-01851, author = {Jonathan Leake and Nisheeth K. Vishnoi}, title = {On the Computability of Continuous Maximum Entropy Distributions: Adjoint Orbits of Lie Groups}, journal = {CoRR}, volume = {abs/2011.01851}, year = {2020}, url = {https://arxiv.org/abs/2011.01851}, eprinttype = {arXiv}, eprint = {2011.01851}, timestamp = {Mon, 09 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-01851.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-05417, author = {Jonathan Leake and Colin S. McSwiggen and Nisheeth K. Vishnoi}, title = {A Polynomial-Time Algorithm and Applications for Matrix Sampling from Harish-Chandra-Itzykson-Zuber Densities}, journal = {CoRR}, volume = {abs/2011.05417}, year = {2020}, url = {https://arxiv.org/abs/2011.05417}, eprinttype = {arXiv}, eprint = {2011.05417}, timestamp = {Thu, 12 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-05417.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/aicom/CelisKSKV19, author = {L. Elisa Celis and Sayash Kapoor and Farnood Salehi and Vijay Keswani and Nisheeth K. Vishnoi}, title = {A dashboard for controlling polarization in personalization}, journal = {{AI} Commun.}, volume = {32}, number = {1}, pages = {77--89}, year = {2019}, url = {https://doi.org/10.3233/AIC-180606}, doi = {10.3233/AIC-180606}, timestamp = {Tue, 26 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/aicom/CelisKSKV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cacm/Vishnoi19, author = {Nisheeth K. Vishnoi}, title = {Technical perspective: Isolating a matching when your coins go missing}, journal = {Commun. {ACM}}, volume = {62}, number = {3}, pages = {108}, year = {2019}, url = {https://doi.org/10.1145/3306210}, doi = {10.1145/3306210}, timestamp = {Thu, 09 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cacm/Vishnoi19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/StraszakV19, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {Belief Propagation, Bethe Approximation and Polynomials}, journal = {{IEEE} Trans. Inf. Theory}, volume = {65}, number = {7}, pages = {4353--4363}, year = {2019}, url = {https://doi.org/10.1109/TIT.2019.2901854}, doi = {10.1109/TIT.2019.2901854}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/StraszakV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MangoubiV19, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Alina Beygelzimer and Daniel Hsu}, title = {Nonconvex sampling with the Metropolis-adjusted Langevin algorithm}, booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix, AZ, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {99}, pages = {2259--2293}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v99/mangoubi19a.html}, timestamp = {Mon, 08 Jul 2019 16:13:41 +0200}, biburl = {https://dblp.org/rec/conf/colt/MangoubiV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/StraszakV19, author = {Damian Straszak and Nisheeth K. Vishnoi}, editor = {Alina Beygelzimer and Daniel Hsu}, title = {Maximum Entropy Distributions: Bit Complexity and Stability}, booktitle = {Conference on Learning Theory, {COLT} 2019, 25-28 June 2019, Phoenix, AZ, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {99}, pages = {2861--2891}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v99/straszak19a.html}, timestamp = {Mon, 08 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/colt/StraszakV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fat/CelisKSV19, author = {L. Elisa Celis and Sayash Kapoor and Farnood Salehi and Nisheeth K. Vishnoi}, editor = {danah boyd and Jamie H. Morgenstern}, title = {Controlling Polarization in Personalization: An Algorithmic Framework}, booktitle = {Proceedings of the Conference on Fairness, Accountability, and Transparency, FAT* 2019, Atlanta, GA, USA, January 29-31, 2019}, pages = {160--169}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3287560.3287601}, doi = {10.1145/3287560.3287601}, timestamp = {Fri, 26 Mar 2021 16:46:37 +0100}, biburl = {https://dblp.org/rec/conf/fat/CelisKSV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fat/CelisHKV19, author = {L. Elisa Celis and Lingxiao Huang and Vijay Keswani and Nisheeth K. Vishnoi}, editor = {danah boyd and Jamie H. Morgenstern}, title = {Classification with Fairness Constraints: {A} Meta-Algorithm with Provable Guarantees}, booktitle = {Proceedings of the Conference on Fairness, Accountability, and Transparency, FAT* 2019, Atlanta, GA, USA, January 29-31, 2019}, pages = {319--328}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3287560.3287586}, doi = {10.1145/3287560.3287586}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fat/CelisHKV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/MangoubiV19, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {David Zuckerman}, title = {Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk}, booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2019, Baltimore, Maryland, USA, November 9-12, 2019}, pages = {1338--1357}, publisher = {{IEEE} Computer Society}, year = {2019}, url = {https://doi.org/10.1109/FOCS.2019.00082}, doi = {10.1109/FOCS.2019.00082}, timestamp = {Tue, 07 Jan 2020 13:25:31 +0100}, biburl = {https://dblp.org/rec/conf/focs/MangoubiV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/HuangV19, author = {Lingxiao Huang and Nisheeth K. Vishnoi}, editor = {Kamalika Chaudhuri and Ruslan Salakhutdinov}, title = {Stable and Fair Classification}, booktitle = {Proceedings of the 36th International Conference on Machine Learning, {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {97}, pages = {2879--2890}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v97/huang19e.html}, timestamp = {Tue, 11 Jun 2019 15:37:38 +0200}, biburl = {https://dblp.org/rec/conf/icml/HuangV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/MehrotraCV19, author = {L. Elisa Celis and Anay Mehrotra and Nisheeth K. Vishnoi}, editor = {Kamalika Chaudhuri and Ruslan Salakhutdinov}, title = {Toward Controlling Discrimination in Online Ad Auctions}, booktitle = {Proceedings of the 36th International Conference on Machine Learning, {ICML} 2019, 9-15 June 2019, Long Beach, California, {USA}}, series = {Proceedings of Machine Learning Research}, volume = {97}, pages = {4456--4465}, publisher = {{PMLR}}, year = {2019}, url = {http://proceedings.mlr.press/v97/mehrotra19a.html}, timestamp = {Thu, 29 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icml/MehrotraCV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/LeeMV19, author = {Holden Lee and Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alch{\'{e}}{-}Buc and Emily B. Fox and Roman Garnett}, title = {Online sampling from log-concave distributions}, booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada}, pages = {1226--1237}, year = {2019}, url = {https://proceedings.neurips.cc/paper/2019/hash/2e65f2f2fdaf6c699b223c61b1b5ab89-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/LeeMV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/HuangJV19, author = {Lingxiao Huang and Shaofeng H.{-}C. Jiang and Nisheeth K. Vishnoi}, editor = {Hanna M. Wallach and Hugo Larochelle and Alina Beygelzimer and Florence d'Alch{\'{e}}{-}Buc and Emily B. Fox and Roman Garnett}, title = {Coresets for Clustering with Fairness Constraints}, booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada}, pages = {7587--7598}, year = {2019}, url = {https://proceedings.neurips.cc/paper/2019/hash/810dfbbebb17302018ae903e9cb7a483-Abstract.html}, timestamp = {Thu, 21 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nips/HuangJV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GurjarV19, author = {Rohit Gurjar and Nisheeth K. Vishnoi}, editor = {Timothy M. Chan}, title = {On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {861--880}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.53}, doi = {10.1137/1.9781611975482.53}, timestamp = {Thu, 15 Jul 2021 13:49:01 +0200}, biburl = {https://dblp.org/rec/conf/soda/GurjarV19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FengVY19, author = {Weiming Feng and Nisheeth K. Vishnoi and Yitong Yin}, editor = {Moses Charikar and Edith Cohen}, title = {Dynamic sampling from graphical models}, booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019}, pages = {1070--1081}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3313276.3316365}, doi = {10.1145/3313276.3316365}, timestamp = {Wed, 24 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/FengVY19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1901-10450, author = {L. Elisa Celis and Anay Mehrotra and Nisheeth K. Vishnoi}, title = {Fair Online Advertising}, journal = {CoRR}, volume = {abs/1901.10450}, year = {2019}, url = {http://arxiv.org/abs/1901.10450}, eprinttype = {arXiv}, eprint = {1901.10450}, timestamp = {Sun, 03 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1901-10450.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-07823, author = {Lingxiao Huang and Nisheeth K. Vishnoi}, title = {Stable and Fair Classification}, journal = {CoRR}, volume = {abs/1902.07823}, year = {2019}, url = {http://arxiv.org/abs/1902.07823}, eprinttype = {arXiv}, eprint = {1902.07823}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-07823.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-08179, author = {Holden Lee and Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Online Sampling from Log-Concave Distributions}, journal = {CoRR}, volume = {abs/1902.08179}, year = {2019}, url = {http://arxiv.org/abs/1902.08179}, eprinttype = {arXiv}, eprint = {1902.08179}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-08179.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-08452, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Nonconvex sampling with the Metropolis-adjusted Langevin algorithm}, journal = {CoRR}, volume = {abs/1902.08452}, year = {2019}, url = {http://arxiv.org/abs/1902.08452}, eprinttype = {arXiv}, eprint = {1902.08452}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-08452.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1905-01745, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Faster algorithms for polytope rounding, sampling, and volume computation via a sublinear "Ball Walk"}, journal = {CoRR}, volume = {abs/1905.01745}, year = {2019}, url = {http://arxiv.org/abs/1905.01745}, eprinttype = {arXiv}, eprint = {1905.01745}, timestamp = {Mon, 27 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1905-01745.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-02164, author = {L. Elisa Celis and Vijay Keswani and Ozan Yildiz and Nisheeth K. Vishnoi}, title = {Fair Distributions from Biased Samples: {A} Maximum Entropy Optimization Framework}, journal = {CoRR}, volume = {abs/1906.02164}, year = {2019}, url = {http://arxiv.org/abs/1906.02164}, eprinttype = {arXiv}, eprint = {1906.02164}, timestamp = {Thu, 13 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-02164.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1906-08484, author = {Lingxiao Huang and Shaofeng H.{-}C. Jiang and Nisheeth K. Vishnoi}, title = {Coresets for Clustering with Fairness Constraints}, journal = {CoRR}, volume = {abs/1906.08484}, year = {2019}, url = {http://arxiv.org/abs/1906.08484}, eprinttype = {arXiv}, eprint = {1906.08484}, timestamp = {Mon, 24 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1906-08484.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/SraVY18, author = {Suvrit Sra and Nisheeth K. Vishnoi and Ozan Yildiz}, editor = {Eric Blais and Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Steurer}, title = {On Geodesically Convex Formulations for the Brascamp-Lieb Constant}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {116}, pages = {25:1--25:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.25}, doi = {10.4230/LIPICS.APPROX-RANDOM.2018.25}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/SraVY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colt/MangoubiV18, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {S{\'{e}}bastien Bubeck and Vianney Perchet and Philippe Rigollet}, title = {Convex Optimization with Unbounded Nonconvex Oracles using Simulated Annealing}, booktitle = {Conference On Learning Theory, {COLT} 2018, Stockholm, Sweden, 6-9 July 2018}, series = {Proceedings of Machine Learning Research}, volume = {75}, pages = {1086--1124}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v75/mangoubi18a.html}, timestamp = {Wed, 03 Apr 2019 18:17:23 +0200}, biburl = {https://dblp.org/rec/conf/colt/MangoubiV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CelisSV18, author = {L. Elisa Celis and Damian Straszak and Nisheeth K. Vishnoi}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Ranking with Fairness Constraints}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {28:1--28:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.28}, doi = {10.4230/LIPICS.ICALP.2018.28}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/CelisSV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GurjarTV18, author = {Rohit Gurjar and Thomas Thierauf and Nisheeth K. Vishnoi}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {74:1--74:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.74}, doi = {10.4230/LIPICS.ICALP.2018.74}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GurjarTV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icml/CelisKS0KV18, author = {L. Elisa Celis and Vijay Keswani and Damian Straszak and Amit Deshpande and Tarun Kathuria and Nisheeth K. Vishnoi}, editor = {Jennifer G. Dy and Andreas Krause}, title = {Fair and Diverse DPP-Based Data Summarization}, booktitle = {Proceedings of the 35th International Conference on Machine Learning, {ICML} 2018, Stockholmsm{\"{a}}ssan, Stockholm, Sweden, July 10-15, 2018}, series = {Proceedings of Machine Learning Research}, volume = {80}, pages = {715--724}, publisher = {{PMLR}}, year = {2018}, url = {http://proceedings.mlr.press/v80/celis18a.html}, timestamp = {Wed, 03 Apr 2019 18:17:30 +0200}, biburl = {https://dblp.org/rec/conf/icml/CelisKS0KV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/CelisHV18, author = {L. Elisa Celis and Lingxiao Huang and Nisheeth K. Vishnoi}, editor = {J{\'{e}}r{\^{o}}me Lang}, title = {Multiwinner Voting with Fairness Constraints}, booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm, Sweden}, pages = {144--151}, publisher = {ijcai.org}, year = {2018}, url = {https://doi.org/10.24963/ijcai.2018/20}, doi = {10.24963/IJCAI.2018/20}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/CelisHV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/KapoorKVC18, author = {Sayash Kapoor and Vijay Keswani and Nisheeth K. Vishnoi and L. Elisa Celis}, editor = {J{\'{e}}r{\^{o}}me Lang}, title = {Balanced News Using Constrained Bandit-based Personalization}, booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm, Sweden}, pages = {5835--5837}, publisher = {ijcai.org}, year = {2018}, url = {https://doi.org/10.24963/ijcai.2018/854}, doi = {10.24963/IJCAI.2018/854}, timestamp = {Tue, 20 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/KapoorKVC18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nips/MangoubiV18, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, editor = {Samy Bengio and Hanna M. Wallach and Hugo Larochelle and Kristen Grauman and Nicol{\`{o}} Cesa{-}Bianchi and Roman Garnett}, title = {Dimensionally Tight Bounds for Second-Order Hamiltonian Monte Carlo}, booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, December 3-8, 2018, Montr{\'{e}}al, Canada}, pages = {6030--6040}, year = {2018}, url = {https://proceedings.neurips.cc/paper/2018/hash/e07bceab69529b0f0b43625953fbf2a0-Abstract.html}, timestamp = {Mon, 16 May 2022 15:41:51 +0200}, biburl = {https://dblp.org/rec/conf/nips/MangoubiV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1802-04023, author = {L. Elisa Celis and Vijay Keswani and Damian Straszak and Amit Deshpande and Tarun Kathuria and Nisheeth K. Vishnoi}, title = {Fair and Diverse DPP-based Data Summarization}, journal = {CoRR}, volume = {abs/1802.04023}, year = {2018}, url = {http://arxiv.org/abs/1802.04023}, eprinttype = {arXiv}, eprint = {1802.04023}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-04023.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1802-08674, author = {L. Elisa Celis and Sayash Kapoor and Farnood Salehi and Nisheeth K. Vishnoi}, title = {An Algorithmic Framework to Control Bias in Bandit-based Personalization}, journal = {CoRR}, volume = {abs/1802.08674}, year = {2018}, url = {http://arxiv.org/abs/1802.08674}, eprinttype = {arXiv}, eprint = {1802.08674}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-08674.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1802-08898, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Dimensionally Tight Running Time Bounds for Second-Order Hamiltonian Monte Carlo}, journal = {CoRR}, volume = {abs/1802.08898}, year = {2018}, url = {http://arxiv.org/abs/1802.08898}, eprinttype = {arXiv}, eprint = {1802.08898}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1802-08898.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1804-04051, author = {Nisheeth K. Vishnoi and Ozan Yildiz}, title = {On Geodesically Convex Formulations for the Brascamp-Lieb Constant}, journal = {CoRR}, volume = {abs/1804.04051}, year = {2018}, url = {http://arxiv.org/abs/1804.04051}, eprinttype = {arXiv}, eprint = {1804.04051}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1804-04051.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-06055, author = {L. Elisa Celis and Lingxiao Huang and Vijay Keswani and Nisheeth K. Vishnoi}, title = {Classification with Fairness Constraints: {A} Meta-Algorithm with Provable Guarantees}, journal = {CoRR}, volume = {abs/1806.06055}, year = {2018}, url = {http://arxiv.org/abs/1806.06055}, eprinttype = {arXiv}, eprint = {1806.06055}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-06055.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-06373, author = {Nisheeth K. Vishnoi}, title = {Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexity}, journal = {CoRR}, volume = {abs/1806.06373}, year = {2018}, url = {http://arxiv.org/abs/1806.06373}, eprinttype = {arXiv}, eprint = {1806.06373}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-06373.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1806-09202, author = {Sayash Kapoor and Vijay Keswani and Nisheeth K. Vishnoi and L. Elisa Celis}, title = {Balanced News Using Constrained Bandit-based Personalization}, journal = {CoRR}, volume = {abs/1806.09202}, year = {2018}, url = {http://arxiv.org/abs/1806.09202}, eprinttype = {arXiv}, eprint = {1806.09202}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1806-09202.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-05164, author = {Rohit Gurjar and Nisheeth K. Vishnoi}, title = {On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)}, journal = {CoRR}, volume = {abs/1807.05164}, year = {2018}, url = {http://arxiv.org/abs/1807.05164}, eprinttype = {arXiv}, eprint = {1807.05164}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-05164.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/allerton/StraszakV17, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {Belief propagation, bethe approximation and polynomials}, booktitle = {55th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2017, Monticello, IL, USA, October 3-6, 2017}, pages = {666--671}, publisher = {{IEEE}}, year = {2017}, url = {https://doi.org/10.1109/ALLERTON.2017.8262801}, doi = {10.1109/ALLERTON.2017.8262801}, timestamp = {Wed, 16 Oct 2019 14:14:55 +0200}, biburl = {https://dblp.org/rec/conf/allerton/StraszakV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/CelisDKSV17, author = {L. Elisa Celis and Amit Deshpande and Tarun Kathuria and Damian Straszak and Nisheeth K. Vishnoi}, editor = {Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Williamson and Santosh S. Vempala}, title = {On the Complexity of Constrained Determinantal Point Processes}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2017, August 16-18, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {81}, pages = {36:1--36:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.36}, doi = {10.4230/LIPICS.APPROX-RANDOM.2017.36}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/CelisDKSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/EbrahimiSV17, author = {Javad B. Ebrahimi and Damian Straszak and Nisheeth K. Vishnoi}, editor = {Chris Umans}, title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration}, booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2017, Berkeley, CA, USA, October 15-17, 2017}, pages = {1020--1031}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/FOCS.2017.98}, doi = {10.1109/FOCS.2017.98}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/EbrahimiSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/PeresSV17, author = {Yuval Peres and Mohit Singh and Nisheeth K. Vishnoi}, editor = {Christos H. Papadimitriou}, title = {Random Walks in Polytopes and Negative Dependence}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {50:1--50:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.50}, doi = {10.4230/LIPICS.ITCS.2017.50}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/PeresSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/CelisKV17, author = {L. Elisa Celis and Peter M. Krafft and Nisheeth K. Vishnoi}, editor = {Elad Michael Schiller and Alexander A. Schwarzmann}, title = {A Distributed Learning Dynamics in Social Groups}, booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing, {PODC} 2017, Washington, DC, USA, July 25-27, 2017}, pages = {441--450}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3087801.3087820}, doi = {10.1145/3087801.3087820}, timestamp = {Tue, 06 Nov 2018 11:07:18 +0100}, biburl = {https://dblp.org/rec/conf/podc/CelisKV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/StraszakV17, author = {Damian Straszak and Nisheeth K. Vishnoi}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Real stable polynomials and matroids: optimization and counting}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {370--383}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055457}, doi = {10.1145/3055399.3055457}, timestamp = {Sun, 02 Jun 2019 21:10:31 +0200}, biburl = {https://dblp.org/rec/conf/stoc/StraszakV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wine/CelisDV17, author = {L. Elisa Celis and Mina Dalirrooyfard and Nisheeth K. Vishnoi}, editor = {Nikhil R. Devanur and Pinyan Lu}, title = {A Dynamics for Advertising on Networks}, booktitle = {Web and Internet Economics - 13th International Conference, {WINE} 2017, Bangalore, India, December 17-20, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10660}, pages = {88--102}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-71924-5\_7}, doi = {10.1007/978-3-319-71924-5\_7}, timestamp = {Sun, 02 Jun 2019 21:26:02 +0200}, biburl = {https://dblp.org/rec/conf/wine/CelisDV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/StraszakV17, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {On Convex Programming Relaxations for the Permanent}, journal = {CoRR}, volume = {abs/1701.01419}, year = {2017}, url = {http://arxiv.org/abs/1701.01419}, eprinttype = {arXiv}, eprint = {1701.01419}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/StraszakV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CelisSV17, author = {L. Elisa Celis and Damian Straszak and Nisheeth K. Vishnoi}, title = {Ranking with Fairness Constraints}, journal = {CoRR}, volume = {abs/1704.06840}, year = {2017}, url = {http://arxiv.org/abs/1704.06840}, eprinttype = {arXiv}, eprint = {1704.06840}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CelisSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CelisKV17, author = {L. Elisa Celis and Peter M. Krafft and Nisheeth K. Vishnoi}, title = {A Distributed Learning Dynamics in Social Groups}, journal = {CoRR}, volume = {abs/1705.03414}, year = {2017}, url = {http://arxiv.org/abs/1705.03414}, eprinttype = {arXiv}, eprint = {1705.03414}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CelisKV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CelisV17, author = {L. Elisa Celis and Nisheeth K. Vishnoi}, title = {Fair Personalization}, journal = {CoRR}, volume = {abs/1707.02260}, year = {2017}, url = {http://arxiv.org/abs/1707.02260}, eprinttype = {arXiv}, eprint = {1707.02260}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CelisV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/EbrahimiSV17, author = {Javad B. Ebrahimi and Damian Straszak and Nisheeth K. Vishnoi}, title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-concentration}, journal = {CoRR}, volume = {abs/1707.02757}, year = {2017}, url = {http://arxiv.org/abs/1707.02757}, eprinttype = {arXiv}, eprint = {1707.02757}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/EbrahimiSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-02222, author = {Rohit Gurjar and Thomas Thierauf and Nisheeth K. Vishnoi}, title = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces}, journal = {CoRR}, volume = {abs/1708.02222}, year = {2017}, url = {http://arxiv.org/abs/1708.02222}, eprinttype = {arXiv}, eprint = {1708.02222}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-02222.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1708-02581, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {Belief Propagation, Bethe Approximation and Polynomials}, journal = {CoRR}, volume = {abs/1708.02581}, year = {2017}, url = {http://arxiv.org/abs/1708.02581}, eprinttype = {arXiv}, eprint = {1708.02581}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1708-02581.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-10057, author = {L. Elisa Celis and Lingxiao Huang and Nisheeth K. Vishnoi}, title = {Group Fairness in Multiwinner Voting}, journal = {CoRR}, volume = {abs/1710.10057}, year = {2017}, url = {http://arxiv.org/abs/1710.10057}, eprinttype = {arXiv}, eprint = {1710.10057}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-10057.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-02036, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {Computing Maximum Entropy Distributions Everywhere}, journal = {CoRR}, volume = {abs/1711.02036}, year = {2017}, url = {http://arxiv.org/abs/1711.02036}, eprinttype = {arXiv}, eprint = {1711.02036}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-02036.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-02621, author = {Oren Mangoubi and Nisheeth K. Vishnoi}, title = {Convex Optimization with Nonconvex Oracles}, journal = {CoRR}, volume = {abs/1711.02621}, year = {2017}, url = {http://arxiv.org/abs/1711.02621}, eprinttype = {arXiv}, eprint = {1711.02621}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-02621.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GurjarTV17, author = {Rohit Gurjar and Thomas Thierauf and Nisheeth K. Vishnoi}, title = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-127}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/127}, eprinttype = {ECCC}, eprint = {TR17-127}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GurjarTV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/orl/SachdevaV16, author = {Sushant Sachdeva and Nisheeth K. Vishnoi}, title = {The mixing time of the Dikin walk in a polytope - {A} simple proof}, journal = {Oper. Res. Lett.}, volume = {44}, number = {5}, pages = {630--634}, year = {2016}, url = {https://doi.org/10.1016/j.orl.2016.07.005}, doi = {10.1016/J.ORL.2016.07.005}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/orl/SachdevaV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Vishnoi16, author = {Nisheeth K. Vishnoi}, editor = {Ran Raz}, title = {Evolution and Computation (Invited Talk)}, booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to June 1, 2016, Tokyo, Japan}, series = {LIPIcs}, volume = {50}, pages = {21:1--21:1}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.CCC.2016.21}, doi = {10.4230/LIPICS.CCC.2016.21}, timestamp = {Thu, 02 Feb 2023 13:27:05 +0100}, biburl = {https://dblp.org/rec/conf/coco/Vishnoi16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/PanageasV16, author = {Ioannis Panageas and Nisheeth K. Vishnoi}, editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi}, title = {Mixing Time of Markov Chains, Dynamical Systems and Evolution}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy}, series = {LIPIcs}, volume = {55}, pages = {63:1--63:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.63}, doi = {10.4230/LIPICS.ICALP.2016.63}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/PanageasV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/StraszakV16, author = {Damian Straszak and Nisheeth K. Vishnoi}, editor = {Madhu Sudan}, title = {On a Natural Dynamics for Linear Programming}, booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016}, pages = {291}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2840728.2840762}, doi = {10.1145/2840728.2840762}, timestamp = {Tue, 14 Jun 2022 13:12:41 +0200}, biburl = {https://dblp.org/rec/conf/innovations/StraszakV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/PapadimitriouV16, author = {Christos H. Papadimitriou and Nisheeth K. Vishnoi}, editor = {Madhu Sudan}, title = {On the Computational Complexity of Limit Cycles in Dynamical Systems}, booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016}, pages = {403}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2840728.2840752}, doi = {10.1145/2840728.2840752}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/PapadimitriouV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/PanageasSV16, author = {Ioannis Panageas and Piyush Srivastava and Nisheeth K. Vishnoi}, editor = {Robert Krauthgamer}, title = {Evolutionary Dynamics in Finite Populations Mix Rapidly}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016}, pages = {480--497}, publisher = {{SIAM}}, year = {2016}, url = {https://doi.org/10.1137/1.9781611974331.ch36}, doi = {10.1137/1.9781611974331.CH36}, timestamp = {Thu, 21 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/PanageasSV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/StraszakV16, author = {Damian Straszak and Nisheeth K. Vishnoi}, editor = {Robert Krauthgamer}, title = {Natural Algorithms for Flow Problems}, booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016}, pages = {1868--1883}, publisher = {{SIAM}}, year = {2016}, url = {https://doi.org/10.1137/1.9781611974331.ch131}, doi = {10.1137/1.9781611974331.CH131}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/StraszakV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/StraszakV16, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {{IRLS} and Slime Mold: Equivalence and Convergence}, journal = {CoRR}, volume = {abs/1601.02712}, year = {2016}, url = {http://arxiv.org/abs/1601.02712}, eprinttype = {arXiv}, eprint = {1601.02712}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/StraszakV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/StraszakV16a, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {Generalized Determinantal Point Processes: The Linear Case}, journal = {CoRR}, volume = {abs/1608.00554}, year = {2016}, url = {http://arxiv.org/abs/1608.00554}, eprinttype = {arXiv}, eprint = {1608.00554}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/StraszakV16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CelisDKV16, author = {L. Elisa Celis and Amit Deshpande and Tarun Kathuria and Nisheeth K. Vishnoi}, title = {How to be Fair and Diverse?}, journal = {CoRR}, volume = {abs/1610.07183}, year = {2016}, url = {http://arxiv.org/abs/1610.07183}, eprinttype = {arXiv}, eprint = {1610.07183}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CelisDKV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/StraszakV16b, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {Real Stable Polynomials and Matroids: Optimization and Counting}, journal = {CoRR}, volume = {abs/1611.04548}, year = {2016}, url = {http://arxiv.org/abs/1611.04548}, eprinttype = {arXiv}, eprint = {1611.04548}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/StraszakV16b.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dagstuhl-reports/BartonLV16, author = {Nick Barton and Per Kristian Lehre and Nisheeth K. Vishnoi}, title = {Evolution and Computing (Dagstuhl Seminar 16011)}, journal = {Dagstuhl Reports}, volume = {6}, number = {1}, pages = {1--14}, year = {2016}, url = {https://doi.org/10.4230/DagRep.6.1.1}, doi = {10.4230/DAGREP.6.1.1}, timestamp = {Wed, 07 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BartonLV16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/KhotV15, author = {Subhash Khot and Nisheeth K. Vishnoi}, title = {The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into {\(\mathscr{l}\)}\({}_{\mbox{1}}\)}, journal = {J. {ACM}}, volume = {62}, number = {1}, pages = {8:1--8:39}, year = {2015}, url = {https://doi.org/10.1145/2629614}, doi = {10.1145/2629614}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/KhotV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Vishnoi15, author = {Nisheeth K. Vishnoi}, editor = {Piotr Indyk}, title = {The Speed of Evolution}, booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015}, pages = {1590--1601}, publisher = {{SIAM}}, year = {2015}, url = {https://doi.org/10.1137/1.9781611973730.105}, doi = {10.1137/1.9781611973730.105}, timestamp = {Tue, 02 Feb 2021 17:07:30 +0100}, biburl = {https://dblp.org/rec/conf/soda/Vishnoi15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/SachdevaV15, author = {Sushant Sachdeva and Nisheeth K. Vishnoi}, title = {A Simple Analysis of the Dikin Walk}, journal = {CoRR}, volume = {abs/1508.01977}, year = {2015}, url = {http://arxiv.org/abs/1508.01977}, eprinttype = {arXiv}, eprint = {1508.01977}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/SachdevaV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/StraszakV15, author = {Damian Straszak and Nisheeth K. Vishnoi}, title = {On a Natural Dynamics for Linear Programming}, journal = {CoRR}, volume = {abs/1511.07020}, year = {2015}, url = {http://arxiv.org/abs/1511.07020}, eprinttype = {arXiv}, eprint = {1511.07020}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/StraszakV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/PapadimitriouV15, author = {Christos H. Papadimitriou and Nisheeth K. Vishnoi}, title = {On the Computational Complexity of Limit Cycles in Dynamical Systems}, journal = {CoRR}, volume = {abs/1511.07605}, year = {2015}, url = {http://arxiv.org/abs/1511.07605}, eprinttype = {arXiv}, eprint = {1511.07605}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/PapadimitriouV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fttcs/SachdevaV14, author = {Sushant Sachdeva and Nisheeth K. Vishnoi}, title = {Faster Algorithms via Approximation Theory}, journal = {Found. Trends Theor. Comput. Sci.}, volume = {9}, number = {2}, pages = {125--210}, year = {2014}, url = {https://doi.org/10.1561/0400000065}, doi = {10.1561/0400000065}, timestamp = {Thu, 20 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fttcs/SachdevaV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KhotPV14, author = {Subhash Khot and Preyas Popat and Nisheeth K. Vishnoi}, title = {Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing}, journal = {{SIAM} J. Comput.}, volume = {43}, number = {3}, pages = {1184--1205}, year = {2014}, url = {https://doi.org/10.1137/130919623}, doi = {10.1137/130919623}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KhotPV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SinghV14, author = {Mohit Singh and Nisheeth K. Vishnoi}, editor = {David B. Shmoys}, title = {Entropy, optimization and counting}, booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA, May 31 - June 03, 2014}, pages = {50--59}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2591796.2591803}, doi = {10.1145/2591796.2591803}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/SinghV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/JainLV14, author = {Rahul Jain and Troy Lee and Nisheeth K. Vishnoi}, title = {A quadratically tight partition bound for classical communication complexity and query complexity}, journal = {CoRR}, volume = {abs/1401.4512}, year = {2014}, url = {http://arxiv.org/abs/1401.4512}, eprinttype = {arXiv}, eprint = {1401.4512}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/JainLV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/fttcs/Vishnoi13, author = {Nisheeth K. Vishnoi}, title = {Lx = b}, journal = {Found. Trends Theor. Comput. Sci.}, volume = {8}, number = {1-2}, pages = {1--141}, year = {2013}, url = {https://doi.org/10.1561/0400000054}, doi = {10.1561/0400000054}, timestamp = {Thu, 20 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/fttcs/Vishnoi13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/Vishnoi13, author = {Nisheeth K. Vishnoi}, editor = {Robert D. Kleinberg}, title = {Making evolution rigorous: the error threshold}, booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley, CA, USA, January 9-12, 2013}, pages = {59--60}, publisher = {{ACM}}, year = {2013}, url = {https://doi.org/10.1145/2422436.2422445}, doi = {10.1145/2422436.2422445}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/Vishnoi13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GargMSV13, author = {Jugal Garg and Ruta Mehta and Milind A. Sohoni and Nisheeth K. Vishnoi}, editor = {Sanjeev Khanna}, title = {Towards Polynomial Simplex-Like Algorithms for Market Equlibria}, booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8, 2013}, pages = {1226--1242}, publisher = {{SIAM}}, year = {2013}, url = {https://doi.org/10.1137/1.9781611973105.89}, doi = {10.1137/1.9781611973105.89}, timestamp = {Tue, 02 Feb 2021 17:07:29 +0100}, biburl = {https://dblp.org/rec/conf/soda/GargMSV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/fsttcs/2013, editor = {Anil Seth and Nisheeth K. Vishnoi}, title = {{IARCS} Annual Conference on Foundations of Software Technology and Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013, Guwahati, India}, series = {LIPIcs}, volume = {24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2013}, url = {http://drops.dagstuhl.de/portals/extern/index.php?semnr=13018}, isbn = {978-3-939897-64-4}, timestamp = {Wed, 21 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/2013.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-8108, author = {Mohit Singh and Nisheeth K. Vishnoi}, title = {Entropy, Optimization and Counting}, journal = {CoRR}, volume = {abs/1304.8108}, year = {2013}, url = {http://arxiv.org/abs/1304.8108}, eprinttype = {arXiv}, eprint = {1304.8108}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-8108.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-0526, author = {Sushant Sachdeva and Nisheeth K. Vishnoi}, title = {Matrix Inversion Is As Easy As Exponentiation}, journal = {CoRR}, volume = {abs/1305.0526}, year = {2013}, url = {http://arxiv.org/abs/1305.0526}, eprinttype = {arXiv}, eprint = {1305.0526}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-0526.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1305-4581, author = {Subhash Khot and Nisheeth K. Vishnoi}, title = {The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into {\(\mathscr{l}\)}\({}_{\mbox{1}}\)}, journal = {CoRR}, volume = {abs/1305.4581}, year = {2013}, url = {http://arxiv.org/abs/1305.4581}, eprinttype = {arXiv}, eprint = {1305.4581}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1305-4581.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/SachdevaV13, author = {Sushant Sachdeva and Nisheeth K. Vishnoi}, title = {Approximation Theory and the Design of Fast Algorithms}, journal = {CoRR}, volume = {abs/1309.4882}, year = {2013}, url = {http://arxiv.org/abs/1309.4882}, eprinttype = {arXiv}, eprint = {1309.4882}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/SachdevaV13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcb/DixitSV12, author = {Narendra M. Dixit and Piyush Srivastava and Nisheeth K. Vishnoi}, title = {A Finite Population Model of Molecular Evolution: Theory and Computation}, journal = {J. Comput. Biol.}, volume = {19}, number = {10}, pages = {1176--1202}, year = {2012}, url = {https://doi.org/10.1089/cmb.2012.0064}, doi = {10.1089/CMB.2012.0064}, timestamp = {Thu, 21 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcb/DixitSV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jmlr/MahoneyOV12, author = {Michael W. Mahoney and Lorenzo Orecchia and Nisheeth K. Vishnoi}, title = {A local spectral method for graphs: with applications to improving graph partitions and exploring data graphs locally}, journal = {J. Mach. Learn. Res.}, volume = {13}, pages = {2339--2365}, year = {2012}, url = {https://dl.acm.org/doi/10.5555/2503308.2503318}, doi = {10.5555/2503308.2503318}, timestamp = {Thu, 02 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jmlr/MahoneyOV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ploscb/TripathiBVD12, author = {Kushal Tripathi and Rajesh Balagam and Nisheeth K. Vishnoi and Narendra M. Dixit}, title = {Stochastic Simulations Suggest that {HIV-1} Survives Close to Its Error Threshold}, journal = {PLoS Comput. Biol.}, volume = {8}, number = {9}, year = {2012}, url = {https://doi.org/10.1371/journal.pcbi.1002684}, doi = {10.1371/JOURNAL.PCBI.1002684}, timestamp = {Thu, 10 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ploscb/TripathiBVD12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Vishnoi12, author = {Nisheeth K. Vishnoi}, title = {A Permanent Approach to the Traveling Salesman Problem}, booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2012, New Brunswick, NJ, USA, October 20-23, 2012}, pages = {76--80}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/FOCS.2012.81}, doi = {10.1109/FOCS.2012.81}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Vishnoi12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KhotPV12, author = {Subhash Khot and Preyas Popat and Nisheeth K. Vishnoi}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {2\({}^{\mbox{log1-{\(\epsilon\)} \emph{n}}}\) hardness for the closest vector problem with preprocessing}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {277--288}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214004}, doi = {10.1145/2213977.2214004}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KhotPV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/OrecchiaSV12, author = {Lorenzo Orecchia and Sushant Sachdeva and Nisheeth K. Vishnoi}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {Approximating the exponential, the lanczos method and an {\~{O}}(\emph{m})-time spectral algorithm for balanced separator}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {1141--1160}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214080}, doi = {10.1145/2213977.2214080}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/OrecchiaSV12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1203-1287, author = {Narendra M. Dixit and Piyush Srivastava and Nisheeth K. Vishnoi}, title = {A Finite Population Model of Molecular Evolution: Theory and Computation}, journal = {CoRR}, volume = {abs/1203.1287}, year = {2012}, url = {http://arxiv.org/abs/1203.1287}, eprinttype = {arXiv}, eprint = {1203.1287}, timestamp = {Thu, 21 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1203-1287.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/AlekhnovichKKV11, author = {Mikhail Alekhnovich and Subhash Khot and Guy Kindler and Nisheeth K. Vishnoi}, title = {Hardness of Approximating the Closest Vector Problem with Pre-Processing}, journal = {Comput. Complex.}, volume = {20}, number = {4}, pages = {741--753}, year = {2011}, url = {https://doi.org/10.1007/s00037-011-0031-3}, doi = {10.1007/S00037-011-0031-3}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/AlekhnovichKKV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cvpr/MajiVM11, author = {Subhransu Maji and Nisheeth K. Vishnoi and Jitendra Malik}, title = {Biased normalized cuts}, booktitle = {The 24th {IEEE} Conference on Computer Vision and Pattern Recognition, {CVPR} 2011, Colorado Springs, CO, USA, 20-25 June 2011}, pages = {2057--2064}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/CVPR.2011.5995630}, doi = {10.1109/CVPR.2011.5995630}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cvpr/MajiVM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DeshpandeTV11, author = {Amit Deshpande and Madhur Tulsiani and Nisheeth K. Vishnoi}, editor = {Dana Randall}, title = {Algorithms and Hardness for Subspace Approximation}, booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25, 2011}, pages = {482--496}, publisher = {{SIAM}}, year = {2011}, url = {https://doi.org/10.1137/1.9781611973082.39}, doi = {10.1137/1.9781611973082.39}, timestamp = {Tue, 02 Feb 2021 17:07:23 +0100}, biburl = {https://dblp.org/rec/conf/soda/DeshpandeTV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/OrecchiaV11, author = {Lorenzo Orecchia and Nisheeth K. Vishnoi}, editor = {Dana Randall}, title = {Towards an SDP-based Approach to Spectral Methods: {A} Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition}, booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25, 2011}, pages = {532--545}, publisher = {{SIAM}}, year = {2011}, url = {https://doi.org/10.1137/1.9781611973082.42}, doi = {10.1137/1.9781611973082.42}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/OrecchiaV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KumarMTV11, author = {Amit Kumar and Rajsekar Manokaran and Madhur Tulsiani and Nisheeth K. Vishnoi}, editor = {Dana Randall}, title = {On LP-Based Approximability for Strict CSPs}, booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25, 2011}, pages = {1560--1573}, publisher = {{SIAM}}, year = {2011}, url = {https://doi.org/10.1137/1.9781611973082.121}, doi = {10.1137/1.9781611973082.121}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/KumarMTV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1109-2176, author = {Subhash Khot and Preyas Popat and Nisheeth K. Vishnoi}, title = {{\textdollar}2{\^{}}\{{\textbackslash}log{\^{}}\{1-{\textbackslash}eps\} n\}{\textdollar} Hardness for Closest Vector Problem with Preprocessing}, journal = {CoRR}, volume = {abs/1109.2176}, year = {2011}, url = {http://arxiv.org/abs/1109.2176}, eprinttype = {arXiv}, eprint = {1109.2176}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1109-2176.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1111-1491, author = {Lorenzo Orecchia and Sushant Sachdeva and Nisheeth K. Vishnoi}, title = {Approximating the Exponential, the Lanczos Method and an {\textbackslash}tilde\{O\}(m)-Time Spectral Algorithm for Balanced Separator}, journal = {CoRR}, volume = {abs/1111.1491}, year = {2011}, url = {http://arxiv.org/abs/1111.1491}, eprinttype = {arXiv}, eprint = {1111.1491}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-1491.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KhotPV11, author = {Subhash Khot and Preyas Popat and Nisheeth K. Vishnoi}, title = {2\({}^{\mbox{log\({}^{\mbox{1-{\(\acute{\epsilon}\)}}}\)n}}\) Hardness for Closest Vector Problem with Preprocessing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-119}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/119}, eprinttype = {ECCC}, eprint = {TR11-119}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KhotPV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/LouisV10, author = {Anand Louis and Nisheeth K. Vishnoi}, editor = {Haim Kaplan}, title = {Improved Algorithm for Degree Bounded Survivable Network Design Problem}, booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6139}, pages = {408--419}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13731-0\_38}, doi = {10.1007/978-3-642-13731-0\_38}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/LouisV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1010-4108, author = {Lorenzo Orecchia and Nisheeth K. Vishnoi}, title = {Towards an SDP-based Approach to Spectral Methods: {A} Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition}, journal = {CoRR}, volume = {abs/1010.4108}, year = {2010}, url = {http://arxiv.org/abs/1010.4108}, eprinttype = {arXiv}, eprint = {1010.4108}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1010-4108.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KolountzakisLMMV09, author = {Mihail N. Kolountzakis and Richard J. Lipton and Evangelos Markakis and Aranyak Mehta and Nisheeth K. Vishnoi}, title = {On the Fourier spectrum of symmetric Boolean functions}, journal = {Comb.}, volume = {29}, number = {3}, pages = {363--387}, year = {2009}, url = {https://doi.org/10.1007/s00493-009-2310-z}, doi = {10.1007/S00493-009-2310-Z}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KolountzakisLMMV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BlaserHLV09, author = {Markus Bl{\"{a}}ser and Moritz Hardt and Richard J. Lipton and Nisheeth K. Vishnoi}, title = {Deterministically testing sparse polynomial identities of unbounded degree}, journal = {Inf. Process. Lett.}, volume = {109}, number = {3}, pages = {187--192}, year = {2009}, url = {https://doi.org/10.1016/j.ipl.2008.09.029}, doi = {10.1016/J.IPL.2008.09.029}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BlaserHLV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0911-4544, author = {Anand Louis and Nisheeth K. Vishnoi}, title = {Improved Algorithm for Degree Bounded Survivable Network Design Problem}, journal = {CoRR}, volume = {abs/0911.4544}, year = {2009}, url = {http://arxiv.org/abs/0911.4544}, eprinttype = {arXiv}, eprint = {0911.4544}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0911-4544.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0912-0681, author = {Michael W. Mahoney and Lorenzo Orecchia and Nisheeth K. Vishnoi}, title = {A Spectral Algorithm for Improving Graph Partitions}, journal = {CoRR}, volume = {abs/0912.0681}, year = {2009}, url = {http://arxiv.org/abs/0912.0681}, eprinttype = {arXiv}, eprint = {0912.0681}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0912-0681.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0912-1403, author = {Amit Deshpande and Kasturi R. Varadarajan and Madhur Tulsiani and Nisheeth K. Vishnoi}, title = {Algorithms and Hardness for Subspace Approximation}, journal = {CoRR}, volume = {abs/0912.1403}, year = {2009}, url = {http://arxiv.org/abs/0912.1403}, eprinttype = {arXiv}, eprint = {0912.1403}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0912-1403.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0912-1776, author = {Amit Kumar and Rajsekar Manokaran and Madhur Tulsiani and Nisheeth K. Vishnoi}, title = {On the Optimality of a Class of LP-based Algorithms}, journal = {CoRR}, volume = {abs/0912.1776}, year = {2009}, url = {http://arxiv.org/abs/0912.1776}, eprinttype = {arXiv}, eprint = {0912.1776}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0912-1776.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KumarMTV09, author = {Amit Kumar and Rajsekar Manokaran and Madhur Tulsiani and Nisheeth K. Vishnoi}, title = {On the Optimality of a Class of LP-based Algorithms}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-124}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/124}, eprinttype = {ECCC}, eprint = {TR09-124}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KumarMTV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/SteurerV09, author = {David Steurer and Nisheeth K. Vishnoi}, title = {Connections Between Unique Games and Multicut}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-125}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/125}, eprinttype = {ECCC}, eprint = {TR09-125}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/SteurerV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AroraKKSTV08, author = {Sanjeev Arora and Subhash Khot and Alexandra Kolla and David Steurer and Madhur Tulsiani and Nisheeth K. Vishnoi}, editor = {Cynthia Dwork}, title = {Unique games on expanding constraint graphs are easy: extended abstract}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {21--28}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374380}, doi = {10.1145/1374376.1374380}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AroraKKSTV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/OrecchiaSVV08, author = {Lorenzo Orecchia and Leonard J. Schulman and Umesh V. Vazirani and Nisheeth K. Vishnoi}, editor = {Cynthia Dwork}, title = {On partitioning graphs via single commodity flows}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {461--470}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374442}, doi = {10.1145/1374376.1374442}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/OrecchiaSVV08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/hipc/Vishnoi07, author = {Nisheeth K. Vishnoi}, editor = {Srinivas Aluru and Manish Parashar and Ramamurthy Badrinath and Viktor K. Prasanna}, title = {The Impact of Noise on the Scaling of Collectives: The Nearest Neighbor Model [Extended Abstract]}, booktitle = {High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, December 18-21, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4873}, pages = {476--487}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-77220-0\_44}, doi = {10.1007/978-3-540-77220-0\_44}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/hipc/Vishnoi07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DevanurKSV06, author = {Nikhil R. Devanur and Subhash Khot and Rishi Saket and Nisheeth K. Vishnoi}, editor = {Jon M. Kleinberg}, title = {Integrality gaps for sparsest cut and minimum linear arrangement problems}, booktitle = {Proceedings of the 38th Annual {ACM} Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006}, pages = {537--546}, publisher = {{ACM}}, year = {2006}, url = {https://doi.org/10.1145/1132516.1132594}, doi = {10.1145/1132516.1132594}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DevanurKSV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/im/GopalanKMMV05, author = {Parikshit Gopalan and Howard J. Karloff and Aranyak Mehta and Milena Mihail and Nisheeth K. Vishnoi}, title = {Caching with Expiration Times for Internet Applications}, journal = {Internet Math.}, volume = {2}, number = {2}, pages = {165--184}, year = {2005}, url = {https://doi.org/10.1080/15427951.2005.10129102}, doi = {10.1080/15427951.2005.10129102}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/im/GopalanKMMV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/LiptonMMV05, author = {Richard J. Lipton and Evangelos Markakis and Aranyak Mehta and Nisheeth K. Vishnoi}, title = {On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas}, booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005), 11-15 June 2005, San Jose, CA, {USA}}, pages = {112--119}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/CCC.2005.19}, doi = {10.1109/CCC.2005.19}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/LiptonMMV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KhotV05, author = {Subhash Khot and Nisheeth K. Vishnoi}, title = {The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l\({}_{\mbox{1}}\)}, booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings}, pages = {53--62}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/SFCS.2005.74}, doi = {10.1109/SFCS.2005.74}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KhotV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/AlekhnovichKKV05, author = {Mikhail Alekhnovich and Subhash Khot and Guy Kindler and Nisheeth K. Vishnoi}, title = {Hardness of Approximating the Closest Vector Problem with Pre-Processing}, booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings}, pages = {216--225}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/SFCS.2005.40}, doi = {10.1109/SFCS.2005.40}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/AlekhnovichKKV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/hipc/AgarwalGV05, author = {Saurabh Agarwal and Rahul Garg and Nisheeth K. Vishnoi}, editor = {David A. Bader and Manish Parashar and Sridhar Varadarajan and Viktor K. Prasanna}, title = {The Impact of Noise on the Scaling of Collectives: {A} Theoretical Approach}, booktitle = {High Performance Computing - HiPC 2005, 12th International Conference, Goa, India, December 18-21, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3769}, pages = {280--289}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11602569\_31}, doi = {10.1007/11602569\_31}, timestamp = {Thu, 05 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/hipc/AgarwalGV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/basesearch/Vishnoi04, author = {Nisheeth K. Vishnoi}, title = {Theoretical Aspects of Randomization in Computation}, school = {Georgia Institute of Technology, Atlanta, GA, {USA}}, year = {2004}, url = {https://hdl.handle.net/1853/6424}, timestamp = {Wed, 04 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/basesearch/Vishnoi04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/DevanurLV04, author = {Nikhil R. Devanur and Richard J. Lipton and Nisheeth K. Vishnoi}, editor = {Kamal Lodaya and Meena Mahajan}, title = {On the Complexity of Hilbert's 17th Problem}, booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical Computer Science, 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3328}, pages = {237--249}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30538-5\_20}, doi = {10.1007/978-3-540-30538-5\_20}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/fsttcs/DevanurLV04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/drw/Vishnoi03, author = {Nisheeth K. Vishnoi}, editor = {Cyril Banderier and Christian Krattenthaler}, title = {Non Uniform Random Walks}, booktitle = {Discrete Random Walks, DRW'03, Paris, France, September 1-5, 2003}, series = {{DMTCS} Proceedings}, volume = {{AC}}, pages = {345--358}, publisher = {{DMTCS}}, year = {2003}, url = {http://dmtcs.episciences.org/3330}, timestamp = {Wed, 15 Jan 2020 16:23:04 +0100}, biburl = {https://dblp.org/rec/conf/drw/Vishnoi03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/saga/DevanurLV03, author = {Nikhil R. Devanur and Richard J. Lipton and Nisheeth K. Vishnoi}, editor = {Andreas Alexander Albrecht and Kathleen Steinh{\"{o}}fel}, title = {Who's The Weakest Link?}, booktitle = {Stochastic Algorithms: Foundations and Applications, Second International Symposium, {SAGA} 2003, Hatfield, UK, September 22-23, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2827}, pages = {108--116}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39816-5\_10}, doi = {10.1007/978-3-540-39816-5\_10}, timestamp = {Mon, 26 Jun 2023 20:48:58 +0200}, biburl = {https://dblp.org/rec/conf/saga/DevanurLV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/LiptonV03, author = {Richard J. Lipton and Nisheeth K. Vishnoi}, title = {Deterministic identity testing for multivariate polynomials}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {756--760}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644233}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/LiptonV03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/GopalanKMMV02, author = {Parikshit Gopalan and Howard J. Karloff and Aranyak Mehta and Milena Mihail and Nisheeth K. Vishnoi}, editor = {David Eppstein}, title = {Caching with expiration times}, booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, {USA}}, pages = {540--547}, publisher = {{ACM/SIAM}}, year = {2002}, url = {http://dl.acm.org/citation.cfm?id=545381.545454}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/GopalanKMMV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.