default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Reis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Victor Reis:
Vector Balancing and Integer Programming. University of Washington, USA, 2024- [c7]Arun Jambulapati, Victor Reis, Kevin Tian:
Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory. SODA 2024: 5169-5208 - [c6]Janardhan Kulkarni
, Victor Reis, Thomas Rothvoss:
Optimal Online Discrepancy Minimization. STOC 2024: 1832-1840 - 2023
- [j1]Victor Reis, Thomas Rothvoss:
Vector balancing in Lebesgue spaces. Random Struct. Algorithms 62(3): 667-688 (2023) - [c5]Victor Reis, Thomas Rothvoss:
The Subspace Flatness Conjecture and Faster Integer Programming. FOCS 2023: 974-988 - [c4]Rainie Bozzai, Victor Reis, Thomas Rothvoss:
The Vector Balancing Constant for Zonotopes. FOCS 2023: 1292-1300 - [i12]Victor Reis, Thomas Rothvoss:
The Subspace Flatness Conjecture and Faster Integer Programming. CoRR abs/2303.14605 (2023) - [i11]Arun Jambulapati, Victor Reis, Kevin Tian:
Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory. CoRR abs/2305.08434 (2023) - [i10]Janardhan Kulkarni, Victor Reis, Thomas Rothvoss:
Optimal Online Discrepancy Minimization. CoRR abs/2308.01406 (2023) - 2022
- [c3]Haotian Jiang, Victor Reis:
A Tighter Relation Between Hereditary Discrepancy and Determinant Lower Bound. SOSA 2022: 308-313 - [c2]Daniel Dadush, Haotian Jiang, Victor Reis:
A new framework for matrix discrepancy: partial coloring bounds via mirror descent. STOC 2022: 649-658 - [i9]Victor Reis, Thomas Rothvoss:
Approximate Carathéodory bounds via Discrepancy Theory. CoRR abs/2207.03614 (2022) - [i8]Laurel Heck, Victor Reis, Thomas Rothvoss:
The Vector Balancing Constant for Zonotopes. CoRR abs/2210.16460 (2022) - 2021
- [i7]Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff:
Tight bounds on the Fourier growth of bounded functions on the hypercube. CoRR abs/2107.06309 (2021) - [i6]Haotian Jiang, Victor Reis:
A Tighter Relation Between Hereditary Discrepancy and Determinant Lower Bound. CoRR abs/2108.07945 (2021) - [i5]Daniel Dadush, Haotian Jiang, Victor Reis:
A New Framework for Matrix Discrepancy: Partial Coloring Bounds via Mirror Descent. CoRR abs/2111.03171 (2021) - [i4]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. TR21 (2021) - 2020
- [c1]Victor Reis, Thomas Rothvoss:
Linear Size Sparsifier and the Geometry of the Operator Norm Ball. SODA 2020: 2337-2348 - [i3]Victor Reis, Thomas Rothvoss:
Vector Balancing in Lebesgue Spaces. CoRR abs/2007.05634 (2020) - [i2]Victor Reis:
Balancing Polynomials in the Chebyshev Norm. CoRR abs/2009.05692 (2020)
2010 – 2019
- 2019
- [i1]Victor Reis, Thomas Rothvoss:
Linear Size Sparsifier and the Geometry of the Operator Norm Ball. CoRR abs/1907.02145 (2019)
Coauthor Index
aka: Thomas Rothvoss
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 2025-01-09 13:04 CET 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:
