| Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems M Gnewuch, A Srivastav, C Winzen Journal of Complexity 25 (2), 115-127, 2009 | 56 | 2009 |
| Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy M Gnewuch Journal of Complexity 24 (2), 154-172, 2008 | 52 | 2008 |
| Quasi-polynomial tractability M Gnewuch, H Woźniakowski Journal of Complexity 27 (3-4), 312-330, 2011 | 51 | 2011 |
| Calculation of discrepancy measures and applications C Doerr, M Gnewuch, M Wahlström A Panorama of Discrepancy Theory, 621-678, 2014 | 43 | 2014 |
| Infinite-dimensional integration on weighted Hilbert spaces M Gnewuch Mathematics of Computation 81 (280), 2175-2205, 2012 | 43 | 2012 |
| On weighted Hilbert spaces and integration of functions of infinitely many variables M Gnewuch, S Mayer, K Ritter Journal of Complexity 30 (2), 29-47, 2014 | 42 | 2014 |
| Optimal randomized multilevel algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition J Baldeaux, M Gnewuch SIAM Journal on Numerical Analysis 52 (3), 1128-1155, 2014 | 39 | 2014 |
| Bounds and constructions for the star-discrepancy via δ-covers B Doerr, M Gnewuch, A Srivastav Journal of Complexity 21 (5), 691-709, 2005 | 39 | 2005 |
| A new randomized algorithm to approximate the star discrepancy based on threshold accepting M Gnewuch, M Wahlström, C Winzen SIAM Journal on Numerical Analysis 50 (2), 781-807, 2012 | 31 | 2012 |
| Infinite-dimensional integration in weighted Hilbert spaces: Anchored decompositions, optimal deterministic algorithms, and higher-order convergence J Dick, M Gnewuch Foundations of Computational Mathematics 14 (5), 1027-1077, 2014 | 28 | 2014 |
| Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition J Dick, M Gnewuch Journal of Approximation Theory 184, 111-145, 2014 | 23 | 2014 |
| On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence M Gnewuch Journal of Complexity 25 (4), 312-317, 2009 | 23 | 2009 |
| Component-by-component construction of low-discrepancy point sets of small size B Doerr, M Gnewuch, P Kritzer, F Pillichshammer Monte Carlo Methods and Applications 14 (2), 129-149, 2008 | 23 | 2008 |
| Entropy, randomization, derandomization, and discrepancy M Gnewuch Monte Carlo and quasi-Monte Carlo methods 2010, 43-78, 2012 | 22 | 2012 |
| Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces M Gnewuch Journal of Complexity 28 (1), 2-17, 2012 | 21 | 2012 |
| Algorithmic construction of low-discrepancy point sets via dependent randomized rounding B Doerr, M Gnewuch, M Wahlström Journal of Complexity 26 (5), 490-507, 2010 | 20 | 2010 |
| Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding B Doerr, M Gnewuch Monte Carlo and Quasi-Monte Carlo Methods 2006, 299-312, 2008 | 20 | 2008 |
| Lower error bounds for randomized multilevel and changing dimension algorithms M Gnewuch Monte Carlo and Quasi-Monte Carlo Methods 2012, 399-415, 2013 | 19 | 2013 |
| Bounds for the Average -Extreme and the -Extreme Discrepancy M Gnewuch the electronic journal of combinatorics 12 (1), R54, 2005 | 17 | 2005 |
| Generalized tractability for multivariate problems Part I: Linear tensor product problems and linear information M Gnewuch, H Woźniakowski Journal of Complexity 23 (2), 262-295, 2007 | 16 | 2007 |
Benjamin DoerrProfessor at Ecole Polytechnique, France; senior researcher at Max Planck Institute for InformaticsVerified email at mpi-inf.mpg.de
