Gábor Braun

45 papers A* 7B 1C 1Journal 34Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Corrections to "Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory".
IEEE Trans. Inf. Theory
Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta
2019 J jnl
Affine reductions for LPs and SDPs.
Math. Program.
Gábor Braun, Sebastian Pokutta, Daniel Zink
2019 A* conf
Blended Conditonal Gradients.
ICML
Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright
2019 J jnl
Lazifying Conditional Gradient Algorithms.
J. Mach. Learn. Res.
Gábor Braun, Sebastian Pokutta, Daniel Zink
2018 J jnl
Blended Conditional Gradients: the unconditioning of conditional gradients.
CoRR
Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright
2018 J jnl
Strong reductions for extended formulations.
Math. Program.
Gábor Braun, Sebastian Pokutta, Aurko Roy
2017 J jnl
Information-theoretic approximations of the nonnegative rank.
Comput. Complex.
Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta
2017 A* conf
Lazifying Conditional Gradient Algorithms.
ICML
Gábor Braun, Sebastian Pokutta, Daniel Zink
2017 J jnl
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.
IEEE Trans. Inf. Theory
Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta
2017 J jnl
The matching problem has no small symmetric SDP.
Math. Program.
Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink
2016 J jnl
A Polyhedral Characterization of Border Bases.
SIAM J. Discret. Math.
Gábor Braun, Sebastian Pokutta
2016 J jnl
An efficient high-probability algorithm for Linear Bandits.
CoRR
Gábor Braun, Sebastian Pokutta
2016 J jnl
Average case polyhedral complexity of the maximum stable set problem.
Math. Program.
Gábor Braun, Samuel Fiorini, Sebastian Pokutta
2016 J jnl
Common Information and Unique Disjointness.
Algorithmica
Gábor Braun, Sebastian Pokutta
2016 J jnl
Lazifying Conditional Gradient Algorithms.
CoRR
Gábor Braun, Sebastian Pokutta, Daniel Zink
2016 B conf
Strong Reductions for Extended Formulations.
IPCO
Gábor Braun, Sebastian Pokutta, Aurko Roy
2016 A* conf
The matching problem has no small symmetric SDP.
SODA
Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink
2015 J jnl
An information diffusion Fano inequality.
CoRR
Gábor Braun, Sebastian Pokutta
2015 J jnl
Approximation Limits of Linear Programs (Beyond Hierarchies).
Math. Oper. Res.
Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
2015 A* conf
Inapproximability of Combinatorial Problems via Small LPs and SDPs.
STOC
Gábor Braun, Sebastian Pokutta, Daniel Zink
2015 J jnl
Info-Greedy Sequential Adaptive Compressed Sensing.
IEEE J. Sel. Top. Signal Process.
Gábor Braun, Sebastian Pokutta, Yao Xie
2015 J jnl
Strong reductions for extended formulations.
CoRR
Gábor Braun, Sebastian Pokutta, Aurko Roy
2015 J jnl
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes.
IEEE Trans. Inf. Theory
Gábor Braun, Sebastian Pokutta
2015 A* conf
The matching polytope does not admit fully-polynomial size relaxation schemes.
SODA
Gábor Braun, Sebastian Pokutta
2015 J jnl
The matching problem has no small symmetric SDP.
CoRR
Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink
2014 J jnl
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set.
Oper. Res. Lett.
Gábor Braun, Sebastian Pokutta
2014 — conf
Average Case Polyhedral Complexity of the Maximum Stable Set Problem.
APPROX-RANDOM
Gábor Braun, Samuel Fiorini, Sebastian Pokutta
2014 J jnl
Info-Greedy sequential adaptive compressed sensing.
CoRR
Gábor Braun, Sebastian Pokutta, Yao Xie
2014 — conf
Info-greedy sequential adaptive compressed sensing.
Allerton
Gábor Braun, Sebastian Pokutta, Yao Xie
2014 J jnl
LP and SDP inapproximability of combinatorial problems.
CoRR
Gábor Braun, Sebastian Pokutta, Daniel Zink
2014 J jnl
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory.
CoRR
Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta
2014 J jnl
The matching polytope does not admit fully-polynomial size relaxation schemes.
CoRR
Gábor Braun, Sebastian Pokutta
2013 J jnl
Average case polyhedral complexity of the maximum stable set problem.
CoRR
Gábor Braun, Samuel Fiorini, Sebastian Pokutta
2013 A* conf
Common Information and Unique Disjointness.
FOCS
Gábor Braun, Sebastian Pokutta
2013 J jnl
Common information and unique disjointness.
Electron. Colloquium Comput. Complex.
Gábor Braun, Sebastian Pokutta
2013 J jnl
Information-theoretic approximations of the nonnegative rank.
Electron. Colloquium Comput. Complex.
Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta
2012 J jnl
A short proof for the polyhedrality of the Chvátal--Gomory closure of a compact convex set
CoRR
Gábor Braun, Sebastian Pokutta
2012 C conf
An Algebraic Approach to Symmetric Extended Formulations.
ISCO
Gábor Braun, Sebastian Pokutta
2012 J jnl
An algebraic approach to symmetric extended formulations
CoRR
Gábor Braun, Sebastian Pokutta
2012 J jnl
Approximation Limits of Linear Programs (Beyond Hierarchies)
CoRR
Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
2012 A* conf
Approximation Limits of Linear Programs (Beyond Hierarchies).
FOCS
Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
2011 J jnl
Breaking up Finite Automata Presentable torsion-Free Abelian Groups.
Int. J. Algebra Comput.
Gábor Braun, Lutz Strüngmann
2011 J jnl
Random half-integral polytopes.
Oper. Res. Lett.
Gábor Braun, Sebastian Pokutta
2010 J jnl
Rank of random half-integral polytopes - extended abstract -.
Electron. Notes Discret. Math.
Gábor Braun, Sebastian Pokutta
2005 J jnl
Random Orders and Gambler's Ruin.
Electron. J. Comb.
Andreas Blass, Gábor Braun