Reports

• T. Bajbar and S. Behrends. How fast do coercive polynomials grow?, 2017.

• M. Behr and A. Munk. Minimax estimation in linear models with unknown finite alphabet design, 2017.

• O. Ernst, B. Sprungk, and L. Tamellini. On Expansions and Nodes for Sparse Grid Collocation of Lognormal Elliptic PDEs, IMATI Report Series 19(2) 2019.

• V. Hartmann and D. Schuhmacher. Semi-discrete optimal transport - the case p=1, 2017.

• M. Hasannasab, S. Neumayer, G. Plonka, S. Setzer, G. Steidl, and J. Geppert. Frame Soft Shrinkage as Proximity Operator, 2019.

• G. Plonka and V. Pototskaia. Application of the AAK theory for sparse approximation of exponential sums, 2016.

• Y. Simayi. Weak convergence of the sequential empirical copula processes under long-range dependence, Stat. Inference Stoch. Process., 2018.