VLDB 2026 Research / reviewers in the wild / expert
Zarko Randelovic
dblp:304/2691
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0002-0893-0347ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | On the number of F -arithmetic expressions in n distinct variables
Ivan Stosic, Zarko Randelovic, Ivan Damnjanovic 0002 |
Discret. Appl. Math. | 2 |
| 2021 | Inequalities on Projected VolumesabstractIn this paper we study the following geometric problem: given $2^n-1$ real numbers $x_A$ indexed by the nonempty subsets $A\subset \{1,\dots,n\}$, is it possible to construct a body $T\subset \mathbb{R}^n$ such that $x_A=|T_A|$, where $|T_A|$ is the $|A|$-dimensional volume of the projection of $T$ onto the subspace spanned by the axes in $A$? As it is more convenient to take logarithms, we denote by $\psi_n$ the set of all vectors $x$ for which there is a body $T$ such that $x_A=\log |T_A|$ for all $A$. Bollobás and Thomason showed that $\psi_n$ is contained in the polyhedral cone defined by the class of “uniform cover inequalities.” Tan and Zeng conjectured that the convex hull $\operatorname{conv}(\psi_n)$ is equal to the cone given by the uniform cover inequalities. We prove that this conjecture is “nearly” right: the closed convex hull $\overline{\operatorname{conv}}(\psi_n)$ is equal to the cone given by the uniform cover inequalities. However, perhaps surprisingly, we also show that $\operatorname{conv}(\psi_n)$ is not closed for $n\ge 4$, thus disproving the conjecture. Imre Leader, Zarko Randelovic, Eero Räty |
SIAM J. Discret. Math. | 2 |