| 2026 | SODA | An Unconditional Lower Bound for the Active-Set Method in Convex Quadratic Maximization. | Eleon Bach, Yann Disser, Sophie Huiberts, Nils Mosis |
| 2026 | STOC | Beyond Smoothed Analysis: Analyzing the Simplex Method By-the-Book. | Eleon Bach, Alexander E. Black, Sophie Huiberts, Sean Kafer |
| 2025 | FOCS | Optimal Smoothed Analysis of the Simplex Method. | Eleon Bach, Sophie Huiberts |
| 2023 | IPCO | A Nearly Optimal Randomized Algorithm for Explorable Heap Selection. | Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev |
| 2023 | STOC | Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method. | Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang |
| 2022 | IPCO | A Simple Method for Convex Optimization in the Oracle Model. | Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge |
| 2021 | IPCO | On the Integrality Gap of Binary Integer Programs with Gaussian Data. | Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari |
| 2020 | STOC | A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix. | Daniel Dadush, Sophie Huiberts, Bento Natura, Lszl A. Vgh |
| 2018 | STOC | A friendly smoothed analysis of the simplex method. | Daniel Dadush, Sophie Huiberts |