Thomas Rothvoss

54 papers A* 16B 6Journal 32

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	A parameterized linear formulation of the integer hull. SODA Friedrich Eisenbrand, Thomas Rothvoss
2026	A*	`conf`	Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure. SODA Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer
2025	J	`jnl`	A parameterized linear formulation of the integer hull. CoRR Friedrich Eisenbrand, Thomas Rothvoss
2025	A*	`conf`	DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory. COLT Jerry Chee, Arturs Backurs, Rainie Heck, Li Zhang, Janardhan Kulkarni, Thomas Rothvoss, Sivakanth Gopi
2025	J	`jnl`	DiscQuant: A Quantization Method for Neural Networks Inspired by Discrepancy Theory. CoRR Jerry Chee, Arturs Backurs, Rainie Heck, Li Zhang, Janardhan Kulkarni, Thomas Rothvoss, Sivakanth Gopi
2025	J	`jnl`	Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure. CoRR Daniel Dadush, Friedrich Eisenbrand, Rom Pinchasi, Thomas Rothvoss, Neta Singer
2025	A*	`conf`	Forall-exist statements in pseudopolynomial time. SODA Eleonore Bach, Friedrich Eisenbrand, Thomas Rothvoss, Robert Weismantel
2025	J	`jnl`	From approximate to exact integer programming. Math. Program. Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2025	A*	`conf`	Tensor Concentration Inequalities: A Geometric Approach. STOC Afonso S. Bandeira, Sivakanth Gopi, Haotian Jiang, Kevin Lucca, Thomas Rothvoss
2024	J	`jnl`	A Geometric Perspective on the Injective Norm of Sums of Random Tensors. CoRR Afonso S. Bandeira, Sivakanth Gopi, Haotian Jiang, Kevin Lucca, Thomas Rothvoss
2024	A*	`conf`	Optimal Online Discrepancy Minimization. STOC Janardhan Kulkarni, Victor Reis, Thomas Rothvoss
2024	B	`conf`	The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. IPCO Sally Dong, Thomas Rothvoss
2023	B	`conf`	From Approximate to Exact Integer Programming. IPCO Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2023	J	`jnl`	Optimal Online Discrepancy Minimization. CoRR Janardhan Kulkarni, Victor Reis, Thomas Rothvoss
2023	J	`jnl`	Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity. CoRR Sally Dong, Thomas Rothvoss
2023	J	`jnl`	Stronger Coreset Bounds for Kernel Density Estimators via Chaining. CoRR Rainie Bozzai, Thomas Rothvoss
2023	A*	`conf`	The Subspace Flatness Conjecture and Faster Integer Programming. FOCS Victor Reis, Thomas Rothvoss
2023	J	`jnl`	The Subspace Flatness Conjecture and Faster Integer Programming. CoRR Victor Reis, Thomas Rothvoss
2023	A*	`conf`	The Vector Balancing Constant for Zonotopes. FOCS Rainie Bozzai, Victor Reis, Thomas Rothvoss
2023	J	`jnl`	Vector balancing in Lebesgue spaces. Random Struct. Algorithms Victor Reis, Thomas Rothvoss
2022	B	`conf`	Approximate $\mathrm {CVP}_{}$ in Time 2 IPCO Thomas Rothvoss, Moritz Venzin
2022	J	`jnl`	Approximate Carathéodory bounds via Discrepancy Theory. CoRR Victor Reis, Thomas Rothvoss
2022	J	`jnl`	From approximate to exact integer programming. CoRR Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss
2022	A*	`conf`	On the Hardness of Scheduling With Non-Uniform Communication Delays. SODA Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
2022	J	`jnl`	The Vector Balancing Constant for Zonotopes. CoRR Laurel Heck, Victor Reis, Thomas Rothvoss
2021	J	`jnl`	Approximate CVP in time 2 CoRR Thomas Rothvoss, Moritz Venzin
2021	J	`jnl`	On the Hardness of Scheduling With Non-Uniform Communication Delays. CoRR Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang
2021	A*	`conf`	Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines. SODA Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
2021	J	`jnl`	Tight bounds on the Fourier growth of bounded functions on the hypercube. CoRR Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff
2021	J	`jnl`	Tight bounds on the Fourier growth of bounded functions on the hypercube. Electron. Colloquium Comput. Complex. Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff
2020	A*	`conf`	A Tale of Santa Claus, Hypergraphs and Matroids. SODA Sami Davies, Thomas Rothvoss, Yihao Zhang
2020	A*	`conf`	Linear Size Sparsifier and the Geometry of the Operator Norm Ball. SODA Victor Reis, Thomas Rothvoss
2020	J	`jnl`	Polynomiality for Bin Packing with a Constant Number of Item Types. J. ACM Michel X. Goemans, Thomas Rothvoss
2020	A*	`conf`	Scheduling with Communication Delays via LP Hierarchies and Clustering. FOCS Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
2020	J	`jnl`	Scheduling with Communication Delays via LP Hierarchies and Clustering. CoRR Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang
2020	J	`jnl`	Vector Balancing in Lebesgue Spaces. CoRR Victor Reis, Thomas Rothvoss
2019	A*	`conf`	A Fourier-Analytic Approach for the Discrepancy of Random Set Systems. SODA Rebecca Hoberg, Thomas Rothvoss
2019	J	`jnl`	Linear Size Sparsifier and the Geometry of the Operator Norm Ball. CoRR Victor Reis, Thomas Rothvoss
2018	J	`jnl`	A Fourier-Analytic Approach for the Discrepancy of Random Set Systems. CoRR Rebecca Hoberg, Thomas Rothvoss
2018	J	`jnl`	A Tale of Santa Claus, Hypergraphs and Matroids. CoRR Sami Davies, Thomas Rothvoss, Yihao Zhang
2017	A*	`conf`	A Logarithmic Additive Integrality Gap for Bin Packing. SODA Rebecca Hoberg, Thomas Rothvoss
2017	B	`conf`	An Improved Deterministic Rescaling for Linear Programming Algorithms. IPCO Rebecca Hoberg, Thomas Rothvoss
2017	J	`jnl`	Constructive Discrepancy Minimization for Convex Sets. SIAM J. Comput. Thomas Rothvoss
2017	B	`conf`	Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. IPCO Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
2017	B	`conf`	Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector. IPCO Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang
2017	J	`jnl`	The Matching Polytope has Exponential Extension Complexity. J. ACM Thomas Rothvoss
2016	A*	`conf`	A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies. STOC Elaine Levey, Thomas Rothvoss
2016	J	`jnl`	An Improved Deterministic Rescaling for Linear Programming Algorithms. CoRR Rebecca Hoberg, Thomas Rothvoss
2016	J	`jnl`	Better Bin Packing Approximations via Discrepancy Theory. SIAM J. Comput. Thomas Rothvoss
2016	J	`jnl`	Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. CoRR Avi Levy, Harishchandra Ramadas, Thomas Rothvoss
2016	J	`jnl`	Lecture Notes on the ARV Algorithm for Sparsest Cut. CoRR Thomas Rothvoss
2016	J	`jnl`	Number Balancing is as hard as Minkowski's Theorem and Shortest Vector. CoRR Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang
2015	J	`jnl`	A Lasserre-based $(1+\varepsilon)$-approximation for $Pm \mid p_j=1, \textrm{prec} \mid C_{\max}$. CoRR Elaine Levey, Thomas Rothvoss
2015	J	`jnl`	A Logarithmic Additive Integrality Gap for Bin Packing. CoRR Rebecca Hoberg, Thomas Rothvoss