BibTeX records: Preyas Popat

download as .bib file

@inproceedings{DBLP:conf/innovations/PanigrahyP15,
  author       = {Rina Panigrahy and
                  Preyas Popat},
  editor       = {Tim Roughgarden},
  title        = {Fractal Structures in Adversarial Prediction},
  booktitle    = {Proceedings of the 2015 Conference on Innovations in Theoretical Computer
                  Science, {ITCS} 2015, Rehovot, Israel, January 11-13, 2015},
  pages        = {75--84},
  publisher    = {{ACM}},
  year         = {2015},
  url          = {https://doi.org/10.1145/2688073.2688088},
  doi          = {10.1145/2688073.2688088},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/PanigrahyP15.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/uai/PanigrahyP14,
  author       = {Rina Panigrahy and
                  Preyas Popat},
  editor       = {Nevin L. Zhang and
                  Jin Tian},
  title        = {Optimal amortized regret in every interval},
  booktitle    = {Proceedings of the Thirtieth Conference on Uncertainty in Artificial
                  Intelligence, {UAI} 2014, Quebec City, Quebec, Canada, July 23-27,
                  2014},
  pages        = {663--671},
  publisher    = {{AUAI} Press},
  year         = {2014},
  url          = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&\#38;smnu=2\&\#38;article\_id=2502\&\#38;proceeding\_id=30},
  timestamp    = {Wed, 03 Feb 2021 11:09:27 +0100},
  biburl       = {https://dblp.org/rec/conf/uai/PanigrahyP14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/us/Popat13,
  author       = {Preyas Popat},
  title        = {Inapproximability Reductions and Integrality Gaps},
  school       = {New York University, {USA}},
  year         = {2013},
  url          = {https://cs.nyu.edu/media/publications/popat\_p.pdf},
  timestamp    = {Mon, 09 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/phd/us/Popat13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1304-7576,
  author       = {Rina Panigrahy and
                  Preyas Popat},
  title        = {Fractal structures in Adversarial Prediction},
  journal      = {CoRR},
  volume       = {abs/1304.7576},
  year         = {2013},
  url          = {http://arxiv.org/abs/1304.7576},
  eprinttype    = {arXiv},
  eprint       = {1304.7576},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1304-7576.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-1304-7577,
  author       = {Rina Panigrahy and
                  Preyas Popat},
  title        = {Optimal amortized regret in every interval},
  journal      = {CoRR},
  volume       = {abs/1304.7577},
  year         = {2013},
  url          = {http://arxiv.org/abs/1304.7577},
  eprinttype    = {arXiv},
  eprint       = {1304.7577},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1304-7577.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/PopatW12,
  author       = {Preyas Popat and
                  Yi Wu},
  editor       = {Yuval Rabani},
  title        = {On the hardness of pricing loss-leaders},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages        = {735--749},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973099.60},
  doi          = {10.1137/1.9781611973099.60},
  timestamp    = {Tue, 02 Feb 2021 17:07:31 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/PopatW12.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}
}

@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/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/approx/KhotPS10,
  author       = {Subhash Khot and
                  Preyas Popat and
                  Rishi Saket},
  editor       = {Maria J. Serna and
                  Ronen Shaltiel and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim},
  title        = {Approximate Lasserre Integrality Gap for Unique Games},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
                  International Workshop, {RANDOM} 2010, Barcelona, Spain, September
                  1-3, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6302},
  pages        = {298--311},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-15369-3\_23},
  doi          = {10.1007/978-3-642-15369-3\_23},
  timestamp    = {Tue, 21 Sep 2021 09:36:24 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/KhotPS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/GuruswamiKOPTW10,
  author       = {Venkatesan Guruswami and
                  Subhash Khot and
                  Ryan O'Donnell and
                  Preyas Popat and
                  Madhur Tulsiani and
                  Yi Wu},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {{SDP} Gaps for 2-to-1 and Other Label-Cover Variants},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6198},
  pages        = {617--628},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14165-2\_52},
  doi          = {10.1007/978-3-642-14165-2\_52},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/GuruswamiKOPTW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ml/AloiseDHP09,
  author       = {Daniel Aloise and
                  Amit Deshpande and
                  Pierre Hansen and
                  Preyas Popat},
  title        = {NP-hardness of Euclidean sum-of-squares clustering},
  journal      = {Mach. Learn.},
  volume       = {75},
  number       = {2},
  pages        = {245--248},
  year         = {2009},
  url          = {https://doi.org/10.1007/s10994-009-5103-0},
  doi          = {10.1007/S10994-009-5103-0},
  timestamp    = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ml/AloiseDHP09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.