BibTeX records: Sophie Huiberts

download as .bib file

@inproceedings{DBLP:conf/compgeom/BonnetDGHL22,
  author    = {Gilles Bonnet and
               Daniel Dadush and
               Uri Grupel and
               Sophie Huiberts and
               Galyna Livshyts},
  editor    = {Xavier Goaoc and
               Michael Kerber},
  title     = {Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes},
  booktitle = {38th International Symposium on Computational Geometry, SoCG 2022,
               June 7-10, 2022, Berlin, Germany},
  series    = {LIPIcs},
  volume    = {224},
  pages     = {18:1--18:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2022},
  url       = {https://doi.org/10.4230/LIPIcs.SoCG.2022.18},
  doi       = {10.4230/LIPIcs.SoCG.2022.18},
  timestamp = {Wed, 01 Jun 2022 16:45:26 +0200},
  biburl    = {https://dblp.org/rec/conf/compgeom/BonnetDGHL22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/DadushHHW22,
  author    = {Daniel Dadush and
               Christopher Hojny and
               Sophie Huiberts and
               Stefan Weltge},
  editor    = {Karen Aardal and
               Laura Sanit{\`{a}}},
  title     = {A Simple Method for Convex Optimization in the Oracle Model},
  booktitle = {Integer Programming and Combinatorial Optimization - 23rd International
               Conference, {IPCO} 2022, Eindhoven, The Netherlands, June 27-29, 2022,
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {13265},
  pages     = {154--167},
  publisher = {Springer},
  year      = {2022},
  url       = {https://doi.org/10.1007/978-3-031-06901-7\_12},
  doi       = {10.1007/978-3-031-06901-7\_12},
  timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/ipco/DadushHHW22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BorstDHT21,
  author    = {Sander Borst and
               Daniel Dadush and
               Sophie Huiberts and
               Samarth Tiwari},
  editor    = {Mohit Singh and
               David P. Williamson},
  title     = {On the Integrality Gap of Binary Integer Programs with Gaussian Data},
  booktitle = {Integer Programming and Combinatorial Optimization - 22nd International
               Conference, {IPCO} 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12707},
  pages     = {427--442},
  publisher = {Springer},
  year      = {2021},
  url       = {https://doi.org/10.1007/978-3-030-73879-2\_30},
  doi       = {10.1007/978-3-030-73879-2\_30},
  timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/ipco/BorstDHT21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-13027,
  author    = {Gilles Bonnet and
               Daniel Dadush and
               Uri Grupel and
               Sophie Huiberts and
               Galyna Livshyts},
  title     = {Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes},
  journal   = {CoRR},
  volume    = {abs/2112.13027},
  year      = {2021},
  url       = {https://arxiv.org/abs/2112.13027},
  eprinttype = {arXiv},
  eprint    = {2112.13027},
  timestamp = {Wed, 05 Jan 2022 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2112-13027.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DadushH20,
  author    = {Daniel Dadush and
               Sophie Huiberts},
  title     = {A Friendly Smoothed Analysis of the Simplex Method},
  journal   = {{SIAM} J. Comput.},
  volume    = {49},
  number    = {5},
  year      = {2020},
  url       = {https://doi.org/10.1137/18M1197205},
  doi       = {10.1137/18M1197205},
  timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DadushH20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DadushHNV20,
  author    = {Daniel Dadush and
               Sophie Huiberts and
               Bento Natura and
               L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  editor    = {Konstantin Makarychev and
               Yury Makarychev and
               Madhur Tulsiani and
               Gautam Kamath and
               Julia Chuzhoy},
  title     = {A scaling-invariant algorithm for linear programming whose running
               time depends only on the constraint matrix},
  booktitle = {Proccedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
  pages     = {761--774},
  publisher = {{ACM}},
  year      = {2020},
  url       = {https://doi.org/10.1145/3357713.3384326},
  doi       = {10.1145/3357713.3384326},
  timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/DadushHNV20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/cu/20/DadushH20,
  author    = {Daniel Dadush and
               Sophie Huiberts},
  editor    = {Tim Roughgarden},
  title     = {Smoothed Analysis of the Simplex Method},
  booktitle = {Beyond the Worst-Case Analysis of Algorithms},
  pages     = {309--333},
  publisher = {Cambridge University Press},
  year      = {2020},
  url       = {https://doi.org/10.1017/9781108637435.019},
  doi       = {10.1017/9781108637435.019},
  timestamp = {Mon, 04 Jan 2021 16:41:48 +0100},
  biburl    = {https://dblp.org/rec/books/cu/20/DadushH20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-08557,
  author    = {Daniel Dadush and
               Christopher Hojny and
               Sophie Huiberts and
               Stefan Weltge},
  title     = {Simple Iterative Methods for Linear Optimization over Convex Sets},
  journal   = {CoRR},
  volume    = {abs/2011.08557},
  year      = {2020},
  url       = {https://arxiv.org/abs/2011.08557},
  eprinttype = {arXiv},
  eprint    = {2011.08557},
  timestamp = {Thu, 19 Nov 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2011-08557.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-08346,
  author    = {Sander Borst and
               Daniel Dadush and
               Sophie Huiberts and
               Samarth Tiwari},
  title     = {On the Integrality Gap of Binary Integer Programs with Gaussian Data},
  journal   = {CoRR},
  volume    = {abs/2012.08346},
  year      = {2020},
  url       = {https://arxiv.org/abs/2012.08346},
  eprinttype = {arXiv},
  eprint    = {2012.08346},
  timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2012-08346.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-06252,
  author    = {Daniel Dadush and
               Sophie Huiberts and
               Bento Natura and
               L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
  title     = {A scaling-invariant algorithm for linear programming whose running
               time depends only on the constraint matrix},
  journal   = {CoRR},
  volume    = {abs/1912.06252},
  year      = {2019},
  url       = {http://arxiv.org/abs/1912.06252},
  eprinttype = {arXiv},
  eprint    = {1912.06252},
  timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1912-06252.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DadushH18,
  author    = {Daniel Dadush and
               Sophie Huiberts},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {A friendly smoothed analysis of the simplex method},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {390--403},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188826},
  doi       = {10.1145/3188745.3188826},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/DadushH18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-05667,
  author    = {Daniel Dadush and
               Sophie Huiberts},
  title     = {A Friendly Smoothed Analysis of the Simplex Method},
  journal   = {CoRR},
  volume    = {abs/1711.05667},
  year      = {2017},
  url       = {http://arxiv.org/abs/1711.05667},
  eprinttype = {arXiv},
  eprint    = {1711.05667},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1711-05667.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics