Sophie Huiberts

According to our database, Sophie Huiberts authored at least 10 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.

Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh

Math. Program., March, 2024

2023

On the integrality gap of binary integer programs with Gaussian data.

Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari

Math. Program., February, 2023

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.

Sophie Huiberts, Yin Tat Lee, Xinzhi Zhang

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

A Nearly Optimal Randomized Algorithm for Explorable Heap Selection.

Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev

Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022

Prizes and Prejudice.

Sophie Huiberts

Bull. EATCS, 2022

A Simple Method for Convex Optimization in the Oracle Model.

Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes.

Gilles Bonnet, Daniel Dadush, Uri Grupel, Sophie Huiberts, Galyna Livshyts

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2020

A Friendly Smoothed Analysis of the Simplex Method.

Daniel Dadush, Sophie Huiberts

SIAM J. Comput., 2020

Simple Iterative Methods for Linear Optimization over Convex Sets.

Daniel Dadush, Christopher Hojny, Sophie Huiberts, Stefan Weltge

CoRR, 2020

Smoothed Analysis of the Simplex Method.

Daniel Dadush, Sophie Huiberts

Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020