Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
Joint work with Yin Tat Lee, Xinzhi Zhang.
Conference version in STOC 2023.
Joint work with Yin Tat Lee, Xinzhi Zhang.
Conference version in STOC 2023.
Joint work with Sander Borst, Daniel Dadush, Danish Kashaev.
Conference version in IPCO 2023.
Joint work with Daniel Dadush, Christopher Hojny, Stefan Weltge.
Conference version in IPCO 2022. Journal version in Mathematical Programming.
Joint work with Gilles Bonnet, Daniel Dadush, Uri Grupel, Galyna Livshyts.
Conference version in SOCG 2022. Journal version to appear in Discrete and Computational Geometry.
PhD thesis. Stieltjes Prize for best PhD thesis in mathematics defended at a Dutch university 2021-2022.
PDF.
Joint work with Daniel Dadush.
Book chapter in Beyond the Worst-Case Analysis of Algorithms, ed. Tim Roughgarden, 2021.
PDF.
Joint work with Sander Borst, Daniel Dadush, Samarth Tiwari.
Conference version in IPCO 2021. Journal version in Mathematical Programming.
PDF.
Joint work with Daniel Dadush, Bento Natura and László Végh.
Conference version in STOC 2020. Journal version in Mathematical Programming.
Thesis for the master’s programme Mathematical Sciences at Utrecht University. Finalist (top 3) for Faculty of Science master thesis prize.
PDF.
Joint work with Daniel Dadush.
Conference version in STOC 2018. Journal version in SIAM Journal on Computing.