Publications

Asymptotic Bounds on the Combinatorial Diameter of Random Polytopes

Joint work with Gilles Bonnet, Daniel Dadush, Uri Grupel, Galyna Livshyts.

PDF here.

Smoothed Analysis of the Simplex Method

Joint work with Daniel Dadush.

PDF here.

On the Integrality Gap of Binary Integer Programs with Gaussian Data

Joint work with Sander Borst, Daniel Dadush, Samarth Tiwari.

Published in Integer Programming and Combinatorial Optimization, 2021.

PDF here.

A Simple Method for Convex Optimization in the Oracle Model

Joint work with Daniel Dadush, Christopher Hojny, Stefan Weltge.

PDF here. Talk here.

A Friendly Smoothed Analysis of the Simplex Method

Joint work with Daniel Dadush.

Published in SIAM Journal on Computing, STOC special issue, 2020.

PDF here. Talk here.

A Scaling-Invariant Algorithm for Linear Programming Whose Running Time Depends Only on the Constraint Matrix

Joint work with Daniel Dadush, Bento Natura and László Végh.

Published in 52th Annual ACM SIGACT Symposium on Theory of Computing, 2020.

PDF here. Talk here.

How Large is the Shadow? Smoothed Analysis of the Simplex Method

PDF here.

A Friendly Smoothed Analysis of the Simplex Method

Joint work with Daniel Dadush.

Published in 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018.

PDF here. Talk here.