default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Thomas Rothvoß
aka: Thomas Rothvoss
University of Washington, Seattle, Department of Mathematics
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 104 matches
- 2024
- Sally Dong, Thomas Rothvoss:
The Extension Complexity of Polytopes with Bounded Integral Slack Matrices. IPCO 2024: 113-123 - Janardhan Kulkarni, Victor Reis, Thomas Rothvoss:
Optimal Online Discrepancy Minimization. STOC 2024: 1832-1840 - Afonso S. Bandeira, Sivakanth Gopi, Haotian Jiang, Kevin Lucca, Thomas Rothvoss:
A Geometric Perspective on the Injective Norm of Sums of Random Tensors. CoRR abs/2411.10633 (2024) - 2023
- Victor Reis, Thomas Rothvoss:
Vector balancing in Lebesgue spaces. Random Struct. Algorithms 62(3): 667-688 (2023) - Rainie Bozzai, Victor Reis, Thomas Rothvoss:
The Vector Balancing Constant for Zonotopes. FOCS 2023: 1292-1300 - Victor Reis, Thomas Rothvoss:
The Subspace Flatness Conjecture and Faster Integer Programming. FOCS 2023: 974-988 - Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From Approximate to Exact Integer Programming. IPCO 2023: 100-114 - Victor Reis, Thomas Rothvoss:
The Subspace Flatness Conjecture and Faster Integer Programming. CoRR abs/2303.14605 (2023) - Sally Dong, Thomas Rothvoss:
Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity. CoRR abs/2307.16159 (2023) - Janardhan Kulkarni, Victor Reis, Thomas Rothvoss:
Optimal Online Discrepancy Minimization. CoRR abs/2308.01406 (2023) - Rainie Bozzai, Thomas Rothvoss:
Stronger Coreset Bounds for Kernel Density Estimators via Chaining. CoRR abs/2310.08548 (2023) - 2022
- Thomas Rothvoss, Moritz Venzin:
Approximate $\mathrm {CVP}_{}$ in Time 20.802 n - Now in Any Norm! IPCO 2022: 440-453 - Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang:
On the Hardness of Scheduling With Non-Uniform Communication Delays. SODA 2022: 316-328 - Victor Reis, Thomas Rothvoss:
Approximate Carathéodory bounds via Discrepancy Theory. CoRR abs/2207.03614 (2022) - Laurel Heck, Victor Reis, Thomas Rothvoss:
The Vector Balancing Constant for Zonotopes. CoRR abs/2210.16460 (2022) - Daniel Dadush, Friedrich Eisenbrand, Thomas Rothvoss:
From approximate to exact integer programming. CoRR abs/2211.03859 (2022) - 2021
- Elaine Levey, Thomas Rothvoß:
A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies. SIAM J. Comput. 50(3) (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: 2958-2977 - Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. WAOA 2021: 224-233 - Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Sai Sandeep, Jakub Tarnawski, Yihao Zhang:
On the Hardness of Scheduling With Non-Uniform Communication Delays. CoRR abs/2105.00111 (2021) - Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jirí Sgall, Pavel Veselý:
Improved Analysis of Online Balanced Clustering. CoRR abs/2107.00145 (2021) - 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) - Thomas Rothvoss, Moritz Venzin:
Approximate CVP in time 20.802 n - now in any norm! CoRR abs/2110.02387 (2021) - 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
- Michel X. Goemans, Thomas Rothvoss:
Polynomiality for Bin Packing with a Constant Number of Item Types. J. ACM 67(6): 38:1-38:21 (2020) - Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang:
Scheduling with Communication Delays via LP Hierarchies and Clustering. FOCS 2020: 822-833 - Sami Davies, Thomas Rothvoss, Yihao Zhang:
A Tale of Santa Claus, Hypergraphs and Matroids. SODA 2020: 2748-2757 - Victor Reis, Thomas Rothvoss:
Linear Size Sparsifier and the Geometry of the Operator Norm Ball. SODA 2020: 2337-2348 - Sami Davies, Janardhan Kulkarni, Thomas Rothvoss, Jakub Tarnawski, Yihao Zhang:
Scheduling with Communication Delays via LP Hierarchies and Clustering. CoRR abs/2004.09682 (2020) - Victor Reis, Thomas Rothvoss:
Vector Balancing in Lebesgue Spaces. CoRR abs/2007.05634 (2020)
skipping 74 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-21 11:01 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint