Demo Data from EDBT 2026 / reviewers in the wild / expert
Rainie Bozzai
dblp:359/0818
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2023
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Combinatorics and discrete mathematics · 50% Computational geometry · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry › convex geometry
convex body |
0.7 | 1 | 2023 | The Vector Balancing Constant for Zonotopes · FOCS 2023 |
Combinatorics and discrete mathematics
discrepancy theory |
0.7 | 1 | 2023 | The Vector Balancing Constant for Zonotopes · FOCS 2023 |
Combinatorics and discrete mathematics › discrepancy theory
vector balancing |
0.7 | 1 | 2023 | The Vector Balancing Constant for Zonotopes · FOCS 2023 |
Computational geometry › polytopes
zonotopes |
0.7 | 1 | 2023 | The Vector Balancing Constant for Zonotopes · FOCS 2023 |
Methods — techniques the papers use, named apart from their topics
gaussian measure bounds · 0.7constructive coloring · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | The Vector Balancing Constant for ZonotopesabstractThe vector balancing constant $\operatorname{vb}(K, Q)$ of two symmetric convex bodies $K, Q$ is the minimum $r \geq 0$ so that any number of vectors from K can be balanced into an r scaling of Q. A question raised by Schechtman is whether for any zonotope $K \subseteq \mathbb{R}^{d}$ one has $\operatorname{vb}(K, K) \lesssim \sqrt{d}$. Intuitively, this asks whether a natural geometric generalization of Spencer’s Theorem (for which $K=B_{\infty}^{d}$) holds. We prove that for any zonotope $K \subseteq \mathbb{R}^{d}$ one has $\operatorname{vb}(K, K) \lesssim \sqrt{d} \log \log \log d$. Our main technical contribution is a tight lower bound on the Gaussian measure of any section of a normalized zonotope, generalizing Vaaler’s Theorem for cubes. We also prove that for two different normalized zonotopes K and Q one has $\operatorname{vb}(K, Q) \lesssim \sqrt{d \log d}$. All the bounds are constructive and the corresponding colorings can be computed in polynomial time. Rainie Bozzai, Victor Reis, Thomas Rothvoß |
FOCS | 1 |