Title	Publication Date	Language	Citations
Fast discrete algorithms for sparse Fourier expansions of high dimensional functions	2010/02/01	English	21
Construction of sliced (nearly) orthogonal Latin hypercube designs	2014/06/01	English	21
The curse of dimensionality for numerical integration on general domains	2019/02/01	English	21
Complexity Estimates for the Schmüdgen Positivstellensatz	1996/06/01	English	21
A Constructive Approach to Strong Tractability Using Quasi-Monte Carlo Algorithms	2002/09/01	English	21
Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes	1996/06/01	English	21
The curse of dimensionality for numerical integration of smooth functions II	2014/04/01	English	21
Lattice rule algorithms for multivariate approximation in the average case setting	2008/04/01	English	21
On the randomized solution of initial value problems	2011/06/01	English	20
Normal Boolean functions	2004/04/01	English	20
The Complexity and Effectiveness of Prediction Algorithms	1994/09/01	English	20
Fast CBC construction of randomly shifted lattice rules achievingO(n−1+δ)convergence for unbounded integrands overRsin weighted spaces with POD weights	2014/08/01	English	20
Simple Monte Carlo and the Metropolis algorithm	2007/08/01	English	20
Computation of local radius of information in SM-IBC identification of nonlinear systems	2007/08/01	English	20
On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree	2002/06/01	English	20
Hilbert's Nullstellensatz Is in the Polynomial Hierarchy	1996/12/01	English	20
Sampling discretization and related problems	2022/08/01	English	20
An upper bound on the minimal dispersion	2018/04/01	English	20
Novel results for the anisotropic sparse grid quadrature	2018/08/01	English	20
Complexity of integer quasiconvex polynomial optimization	2005/08/01	English	20
On lower complexity bounds for large-scale smooth convex optimization	2015/02/01	English	20
On the expressiveness and decidability of o-minimal hybrid systems	2005/08/01	English	20
Optimal lower bounds for cubature error on the sphere S2	2005/12/01	English	20
Polynomial differential equations compute all real computable functions on computable compact intervals	2007/06/01	English	20
On the Koksma–Hlawka inequality	2013/04/01	English	20
Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands	2010/04/01	English	19
Non-convergence of stochastic gradient descent in the training of deep neural networks	2021/06/01	English	19
Level permutation method for constructing uniform designs under the wrap-aroundL2-discrepancy	2014/02/01	English	19
Deterministic sampling of sparse trigonometric polynomials	2011/04/01	English	19
Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration	2000/03/01	English	19