default search action
Gábor Braun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Gábor Braun, Cristóbal Guzmán
, Sebastian Pokutta
Corrections to "Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory". IEEE Trans. Inf. Theory 70(7): 5408-5409 (2024)
2010 – 2019
- 2019
- [j17]Gábor Braun, Sebastian Pokutta, Daniel Zink:
Lazifying Conditional Gradient Algorithms. J. Mach. Learn. Res. 20: 71:1-71:42 (2019) - [j16]Gábor Braun, Sebastian Pokutta, Daniel Zink:
Affine reductions for LPs and SDPs. Math. Program. 173(1-2): 281-312 (2019) - [c11]Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright:
Blended Conditonal Gradients. ICML 2019: 735-743 - 2018
- [j15]Gábor Braun, Sebastian Pokutta, Aurko Roy:
Strong reductions for extended formulations. Math. Program. 172(1-2): 591-620 (2018) - [i16]Gábor Braun, Sebastian Pokutta, Dan Tu, Stephen J. Wright:
Blended Conditional Gradients: the unconditioning of conditional gradients. CoRR abs/1805.07311 (2018) - 2017
- [j14]Gábor Braun, Rahul Jain
Information-theoretic approximations of the nonnegative rank. Comput. Complex. 26(1): 147-197 (2017) - [j13]Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink:
The matching problem has no small symmetric SDP. Math. Program. 165(2): 643-662 (2017) - [j12]Gábor Braun, Cristóbal Guzmán
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory. IEEE Trans. Inf. Theory 63(7): 4709-4724 (2017) - [c10]Gábor Braun, Sebastian Pokutta, Daniel Zink:
Lazifying Conditional Gradient Algorithms. ICML 2017: 566-575 - 2016
- [j11]Gábor Braun, Sebastian Pokutta:
Common Information and Unique Disjointness. Algorithmica 76(3): 597-629 (2016) - [j10]Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average case polyhedral complexity of the maximum stable set problem. Math. Program. 160(1-2): 407-431 (2016) - [j9]Gábor Braun, Sebastian Pokutta:
A Polyhedral Characterization of Border Bases. SIAM J. Discret. Math. 30(1): 239-265 (2016) - [c9]Gábor Braun, Sebastian Pokutta, Aurko Roy:
Strong Reductions for Extended Formulations. IPCO 2016: 350-361 - [c8]Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink:
The matching problem has no small symmetric SDP. SODA 2016: 1067-1078 - [i15]Gábor Braun, Sebastian Pokutta:
An efficient high-probability algorithm for Linear Bandits. CoRR abs/1610.02072 (2016) - [i14]Gábor Braun, Sebastian Pokutta, Daniel Zink:
Lazifying Conditional Gradient Algorithms. CoRR abs/1610.05120 (2016) - 2015
- [j8]Gábor Braun, Sebastian Pokutta, Yao Xie:
Info-Greedy Sequential Adaptive Compressed Sensing. IEEE J. Sel. Top. Signal Process. 9(4): 601-611 (2015) - [j7]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
Approximation Limits of Linear Programs (Beyond Hierarchies). Math. Oper. Res. 40(3): 756-772 (2015) - [j6]Gábor Braun, Sebastian Pokutta:
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes. IEEE Trans. Inf. Theory 61(10): 5754-5764 (2015) - [c7]Gábor Braun, Sebastian Pokutta:
The matching polytope does not admit fully-polynomial size relaxation schemes. SODA 2015: 837-846 - [c6]Gábor Braun, Sebastian Pokutta, Daniel Zink:
Inapproximability of Combinatorial Problems via Small LPs and SDPs. STOC 2015: 107-116 - [i13]Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink:
The matching problem has no small symmetric SDP. CoRR abs/1504.00703 (2015) - [i12]Gábor Braun, Sebastian Pokutta:
An information diffusion Fano inequality. CoRR abs/1504.05492 (2015) - [i11]Gábor Braun, Sebastian Pokutta, Aurko Roy:
Strong reductions for extended formulations. CoRR abs/1512.04932 (2015) - 2014
- [j5]Gábor Braun, Sebastian Pokutta:
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set. Oper. Res. Lett. 42(5): 307-310 (2014) - [c5]Gábor Braun, Sebastian Pokutta, Yao Xie:
Info-greedy sequential adaptive compressed sensing. Allerton 2014: 858-865 - [c4]Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average Case Polyhedral Complexity of the Maximum Stable Set Problem. APPROX-RANDOM 2014: 515-530 - [i10]Gábor Braun, Sebastian Pokutta:
The matching polytope does not admit fully-polynomial size relaxation schemes. CoRR abs/1403.6710 (2014) - [i9]Gábor Braun, Sebastian Pokutta, Yao Xie:
Info-Greedy sequential adaptive compressed sensing. CoRR abs/1407.0731 (2014) - [i8]Gábor Braun, Cristóbal Guzmán, Sebastian Pokutta:
Lower Bounds on the Oracle Complexity of Nonsmooth Convex Optimization via Information Theory. CoRR abs/1407.5144 (2014) - [i7]Gábor Braun, Sebastian Pokutta, Daniel Zink:
LP and SDP inapproximability of combinatorial problems. CoRR abs/1410.8816 (2014) - 2013
- [c3]Gábor Braun, Sebastian Pokutta:
Common Information and Unique Disjointness. FOCS 2013: 688-697 - [i6]Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average case polyhedral complexity of the maximum stable set problem. CoRR abs/1311.4001 (2013) - [i5]Gábor Braun, Rahul Jain, Troy Lee, Sebastian Pokutta:
Information-theoretic approximations of the nonnegative rank. Electron. Colloquium Comput. Complex. TR13 (2013) - [i4]Gábor Braun, Sebastian Pokutta:
Common information and unique disjointness. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c2]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer
Approximation Limits of Linear Programs (Beyond Hierarchies). FOCS 2012: 480-489 - [c1]Gábor Braun, Sebastian Pokutta:
An Algebraic Approach to Symmetric Extended Formulations. ISCO 2012: 141-152 - [i3]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer:
Approximation Limits of Linear Programs (Beyond Hierarchies). CoRR abs/1204.0957 (2012) - [i2]Gábor Braun, Sebastian Pokutta:
An algebraic approach to symmetric extended formulations. CoRR abs/1206.6318 (2012) - [i1]Gábor Braun, Sebastian Pokutta:
A short proof for the polyhedrality of the Chvátal--Gomory closure of a compact convex set. CoRR abs/1207.4884 (2012) - 2011
- [j4]Gábor Braun, Lutz Strüngmann:
Breaking up Finite Automata Presentable torsion-Free Abelian Groups. Int. J. Algebra Comput. 21(8): 1463-1472 (2011) - [j3]Gábor Braun, Sebastian Pokutta:
Random half-integral polytopes. Oper. Res. Lett. 39(3): 204-207 (2011) - 2010
- [j2]Gábor Braun, Sebastian Pokutta:
Rank of random half-integral polytopes - extended abstract -. Electron. Notes Discret. Math. 36: 415-422 (2010)
2000 – 2009
- 2005
- [j1]Andreas Blass, Gábor Braun:
Random Orders and Gambler's Ruin. Electron. J. Comb. 12 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: