We stand with Ukraine  

Sophie Huiberts

Orcid: 0000-0003-2633-014X

Affiliations:
  • Clermont Auvergne University, LIMOS, Clermont-Ferrand, France
  • Centrum Wiskunde & Informatica, Amsterdam, The Netherlands
  • Utrecht University, The Netherlands (PhD 2022)


According to our database1, Sophie Huiberts authored at least 13 papers between 2018 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Beyond Smoothed Analysis: Analyzing the Simplex Method by the Book.
[BibTeX]
[DOI]
Eleon Bach
,
Alexander E. Black
,
Sophie Huiberts
,
Sean Kafer
CoRR, October, 2025

An unconditional lower bound for the active-set method in convex quadratic maximization.
[BibTeX]
[DOI]
Eleon Bach
,
Yann Disser
,
Sophie Huiberts
,
Nils Mosis
CoRR, July, 2025

Optimal Smoothed Analysis of the Simplex Method.
[BibTeX]
[DOI]
Eleon Bach
,
Sophie Huiberts
CoRR, April, 2025

2023
Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Sander Borst
,
Daniel Dadush
,
Sophie Huiberts
,
Danish Kashaev
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
Prizes and Prejudice.
[BibTeX]
[DOI]
Sophie Huiberts
Bull. EATCS, 2022

A Simple Method for Convex Optimization in the Oracle Model.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Gilles Bonnet
,
Daniel Dadush
,
Uri Grupel
,
Sophie Huiberts
,
Galyna Livshyts
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
On the Integrality Gap of Binary Integer Programs with Gaussian Data.
[BibTeX]
[DOI]
Sander Borst
,
Daniel Dadush
,
Sophie Huiberts
,
Samarth Tiwari
Proceedings of the Integer Programming and Combinatorial Optimization, 2021

2020
Simple Iterative Methods for Linear Optimization over Convex Sets.
[BibTeX]
[DOI]
Daniel Dadush
,
Christopher Hojny
,
Sophie Huiberts
,
Stefan Weltge
CoRR, 2020

A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix.
[BibTeX]
[DOI]
Daniel Dadush
,
Sophie Huiberts
,
Bento Natura
,
László A. Végh
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Smoothed Analysis of the Simplex Method.
[BibTeX]
[DOI]
Daniel Dadush
,
Sophie Huiberts
Proceedings of the Beyond the Worst-Case Analysis of Algorithms, 2020

2018
A friendly smoothed analysis of the simplex method.
[BibTeX]
[DOI]
Daniel Dadush
,
Sophie Huiberts
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018


  Loading...