Thomas Rothvoß

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Harishchandra Ramadas

> Home > Persons > Thomas Rothvoß

Publications

2017
[c29]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/HobergRRY17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/HobergRRY17
Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang:
Number Balancing is as Hard as Minkowski's Theorem and Shortest Vector. IPCO 2017: 254-266
[c27]
- view
  authority control:
- export record
  dblp key:
  - conf/ipco/LevyRR17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipco/LevyRR17
Avi Levy, Harishchandra Ramadas, Thomas Rothvoss:
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. IPCO 2017: 380-391
2016
[i23]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/LevyRR16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/LevyRR16
Avi Levy, Harishchandra Ramadas, Thomas Rothvoss:
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method. CoRR abs/1611.08752 (2016)
[i22]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/HobergRRY16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/HobergRRY16
Rebecca Hoberg, Harishchandra Ramadas, Thomas Rothvoss, Xin Yang:
Number Balancing is as hard as Minkowski's Theorem and Shortest Vector. CoRR abs/1611.08757 (2016)

a service of

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.