Thomas Rothvoss

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 42

Top Topics

Communication Delays

Integrality Gap

Integer Programming

Precedence Constraints

Top Venues

Publications

Janardhan Kulkarni, Victor Reis, Thomas Rothvoss
Optimal Online Discrepancy Minimization. STOC (2024)
Sally Dong, Thomas Rothvoss
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. IPCO (2024)
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
From Approximate to Exact Integer Programming. IPCO (2023)
Rainie Bozzai, Thomas Rothvoss
Stronger Coreset Bounds for Kernel Density Estimators via Chaining. CoRR (2023)
Victor Reis, Thomas Rothvoss
Vector balancing in Lebesgue spaces. Random Struct. Algorithms 62 (3) (2023)
Rainie Bozzai, Victor Reis, Thomas Rothvoss
The Vector Balancing Constant for Zonotopes. FOCS (2023)
Janardhan Kulkarni, Victor Reis, Thomas Rothvoss
Optimal Online Discrepancy Minimization. CoRR (2023)
Victor Reis, Thomas Rothvoss
The Subspace Flatness Conjecture and Faster Integer Programming. FOCS (2023)
Victor Reis, Thomas Rothvoss
The Subspace Flatness Conjecture and Faster Integer Programming. CoRR (2023)
Sally Dong, Thomas Rothvoss
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity. CoRR (2023)
Thomas Rothvoss, Moritz Venzin
- Now in Any Norm! IPCO (2022)
Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
From approximate to exact integer programming. CoRR (2022)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
On the Hardness of Scheduling With Non-Uniform Communication Delays. SODA (2022)
Laurel Heck, Victor Reis, Thomas Rothvoss
The Vector Balancing Constant for Zonotopes. CoRR (2022)
Victor Reis, Thomas Rothvoss
Approximate Carathéodory bounds via Discrepancy Theory. CoRR (2022)
Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff
Tight bounds on the Fourier growth of bounded functions on the hypercube. Electron. Colloquium Comput. Complex. 28 (2021)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
On the Hardness of Scheduling With Non-Uniform Communication Delays. CoRR (2021)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. SODA (2021)
Thomas Rothvoss, Moritz Venzin
- now in any norm! CoRR (2021)
Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff
Tight bounds on the Fourier growth of bounded functions on the hypercube. CoRR (2021)
Victor Reis, Thomas Rothvoss
Linear Size Sparsifier and the Geometry of the Operator Norm Ball. SODA (2020)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
Scheduling with Communication Delays via LP Hierarchies and Clustering. FOCS (2020)
Victor Reis, Thomas Rothvoss
Vector Balancing in Lebesgue Spaces. CoRR (2020)
Michel X. Goemans, Thomas Rothvoss
Polynomiality for Bin Packing with a Constant Number of Item Types. J. ACM 67 (6) (2020)
Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
Scheduling with Communication Delays via LP Hierarchies and Clustering. CoRR (2020)
Sami Davies, Thomas Rothvoss, Yihao Zhang
A Tale of Santa Claus, Hypergraphs and Matroids. SODA (2020)
Victor Reis, Thomas Rothvoss
Linear Size Sparsifier and the Geometry of the Operator Norm Ball. CoRR (2019)
Rebecca Hoberg, Thomas Rothvoss
A Fourier-Analytic Approach for the Discrepancy of Random Set Systems. SODA (2019)
Rebecca Hoberg, Thomas Rothvoss
A Fourier-Analytic Approach for the Discrepancy of Random Set Systems. CoRR (2018)
Sami Davies, Thomas Rothvoss, Yihao Zhang
A Tale of Santa Claus, Hypergraphs and Matroids. CoRR (2018)
Rebecca Hoberg, Thomas Rothvoss
A Logarithmic Additive Integrality Gap for Bin Packing. SODA (2017)
Thomas Rothvoss
Constructive Discrepancy Minimization for Convex Sets. SIAM J. Comput. 46 (1) (2017)
Thomas Rothvoss
The Matching Polytope has Exponential Extension Complexity. J. ACM 64 (6) (2017)
Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. IPCO (2017)
Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang
Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector. IPCO (2017)
Rebecca Hoberg, Thomas Rothvoss
An Improved Deterministic Rescaling for Linear Programming Algorithms. IPCO (2017)
Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang
Number Balancing is as hard as Minkowski's Theorem and Shortest Vector. CoRR (2016)
Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. CoRR (2016)
Rebecca Hoberg, Thomas Rothvoss
An Improved Deterministic Rescaling for Linear Programming Algorithms. CoRR (2016)
Thomas Rothvoss
Lecture Notes on the ARV Algorithm for Sparsest Cut. CoRR (2016)
Thomas Rothvoss
Better Bin Packing Approximations via Discrepancy Theory. SIAM J. Comput. 45 (3) (2016)
Elaine Levey, Thomas Rothvoss
A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies. STOC (2016)
Elaine Levey, Thomas Rothvoss
A Lasserre-based $(1+\varepsilon)$-approximation for $Pm \mid p_j=1, \textrm{prec} \mid C_{\max}$. CoRR (2015)
Rebecca Hoberg, Thomas Rothvoss
A Logarithmic Additive Integrality Gap for Bin Packing. CoRR (2015)