Sophie Huiberts

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 19

Top Topics

Linear Programming

Convex Optimization

Upper And Lower Bounds

Totally Unimodular

Top Venues

Publications

Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. Math. Program. 204 (1) (2024)
Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
A simple method for convex optimization in the oracle model. Math. Program. 206 (1) (2024)
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
On the integrality gap of binary integer programs with Gaussian data. Math. Program. 197 (2) (2023)
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. IPCO (2023)
Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. STOC (2023)
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
A nearly optimal randomized algorithm for explorable heap selection. CoRR (2022)
Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. SoCG (2022)
Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. CoRR (2022)
Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
A Simple Method for Convex Optimization in the Oracle Model. IPCO (2022)
Sophie Huiberts
Prizes and Prejudice. Bull. EATCS 138 (2022)
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
On the Integrality Gap of Binary Integer Programs with Gaussian Data. IPCO (2021)
Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes. CoRR (2021)
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. STOC (2020)
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
On the Integrality Gap of Binary Integer Programs with Gaussian Data. CoRR (2020)
Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
Simple Iterative Methods for Linear Optimization over Convex Sets. CoRR (2020)
Daniel Dadush, Sophie Huiberts
A Friendly Smoothed Analysis of the Simplex Method. SIAM J. Comput. 49 (5) (2020)
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. CoRR (2019)
Daniel Dadush, Sophie Huiberts
A friendly smoothed analysis of the simplex method. STOC (2018)
Daniel Dadush, Sophie Huiberts
A Friendly Smoothed Analysis of the Simplex Method. CoRR (2017)