Sophie Huiberts

28 papers A* 6B 3Journal 18
YearRankTypeTitle / Venue / Authors
2026 A* conf
An Unconditional Lower Bound for the Active-Set Method in Convex Quadratic Maximization.
SODA
Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis
2026 J jnl
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes.
Discret. Comput. Geom.
Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna V. Livshyts
2025 J jnl
A nearly optimal randomized algorithm for explorable heap selection.
Math. Program.
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2025 J jnl
An unconditional lower bound for the active-set method in convex quadratic maximization.
CoRR
Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis
2025 J jnl
Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book.
CoRR
Eleon Bach, Alexander E. Black, Sophie Huiberts, Sean Kafer
2025 A* conf
Optimal Smoothed Analysis of the Simplex Method.
FOCS
Eleon Bach, Sophie Huiberts
2025 J jnl
Optimal Smoothed Analysis of the Simplex Method.
CoRR
Eleon Bach, Sophie Huiberts
2025 J jnl
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.
TheoretiCS
Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang
2024 J jnl
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.
Math. Program.
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2024 J jnl
A simple method for convex optimization in the oracle model.
Math. Program.
Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
2023 B conf
A Nearly Optimal Randomized Algorithm for Explorable Heap Selection.
IPCO
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2023 J jnl
On the integrality gap of binary integer programs with Gaussian data.
Math. Program.
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
2023 A* conf
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.
STOC
Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang
2022 B conf
A Simple Method for Convex Optimization in the Oracle Model.
IPCO
Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
2022 J jnl
A nearly optimal randomized algorithm for explorable heap selection.
CoRR
Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev
2022 A* conf
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes.
SoCG
Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna V. Livshyts
2022 J jnl
Prizes and Prejudice.
Bull. EATCS
Sophie Huiberts
2022 J jnl
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.
CoRR
Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang
2021 J jnl
Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes.
CoRR
Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna V. Livshyts
2021 B conf
On the Integrality Gap of Binary Integer Programs with Gaussian Data.
IPCO
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
2020 J jnl
A Friendly Smoothed Analysis of the Simplex Method.
SIAM J. Comput.
Daniel Dadush, Sophie Huiberts
2020 A* conf
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.
STOC
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2020 J jnl
On the Integrality Gap of Binary Integer Programs with Gaussian Data.
CoRR
Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari
2020 J jnl
Simple Iterative Methods for Linear Optimization over Convex Sets.
CoRR
Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge
2020 — ch.
Smoothed Analysis of the Simplex Method.
Beyond the Worst-Case Analysis of Algorithms
Daniel Dadush, Sophie Huiberts
2019 J jnl
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.
CoRR
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2018 A* conf
A friendly smoothed analysis of the simplex method.
STOC
Daniel Dadush, Sophie Huiberts
2017 J jnl
A Friendly Smoothed Analysis of the Simplex Method.
CoRR
Daniel Dadush, Sophie Huiberts