default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Gnewuch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Michael Gnewuch, Aicke Hinrichs, Klaus Ritter, Robin Rüßmann
:
Infinite-dimensional integration and L2-approximation on Hermite spaces. J. Approx. Theory 300: 106027 (2024)- [j31]Michael Gnewuch:
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy. J. Complex. 83: 101855 (2024) - [i16]Michael Gnewuch:
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy. CoRR abs/2401.00801 (2024) - [i15]Michael Gnewuch, Josef Dick, Lev Markhasin, Winfried Sickel:
QMC integration based on arbitrary (t,m,s)-nets yields optimal convergence rates on several scales of function spaces. CoRR abs/2409.12879 (2024) - [i14]Michael Gnewuch, Kumar Harsha, Marcin Wnuk:
Data Compression using Rank-1 Lattices for Parameter Estimation in Machine Learning. CoRR abs/2409.13453 (2024) - 2023
- [i13]Kumar Harsha, Michael Gnewuch, Marcin Wnuk:
Infinite-Variate L2-Approximation with Nested Subspace Sampling. CoRR abs/2301.13177 (2023) - [i12]Michael Gnewuch, Aicke Hinrichs, Klaus Ritter, Robin Rüßmann:
Infinite-dimensional integration and L2-approximation on Hermite spaces. CoRR abs/2304.01754 (2023) - [i11]Jasmin Fiedler, Michael Gnewuch, Christian Weiß:
New Bounds for the Extreme and the Star Discrepancy of Double-Infinite Matrices. CoRR abs/2305.04686 (2023) - [i10]Michael Gnewuch, Peter Kritzer, Art B. Owen, Zexin Pan:
Computable error bounds for quasi-Monte Carlo using points with non-negative local discrepancy. CoRR abs/2309.04209 (2023) - [i9]Dmitriy Bilyk, Michael Gnewuch, Jan Vybíral, Larisa Yaroslavtseva, Kumar Harsha:
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 23351). Dagstuhl Reports 13(8): 106-128 (2023) - 2022
- [j30]Michael Gnewuch, Mario Hefter, Aicke Hinrichs, Klaus Ritter:
Countable tensor products of Hermite spaces and spaces of Gaussian kernels. J. Complex. 71: 101654 (2022) - 2021
- [j29]Benjamin Doerr, Michael Gnewuch:
On negative dependence properties of Latin hypercube samples and scrambled nets. J. Complex. 67: 101589 (2021) - [j28]Michael Gnewuch, Hendrik Pasing, Christian Weiß:
A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy. Math. Comput. 90(332): 2873-2898 (2021) - [i8]Michael Gnewuch, Nils Hebbinghaus:
Discrepancy Bounds for a Class of Negatively Dependent Random Points Including Latin Hypercube Samples. CoRR abs/2102.04451 (2021) - [i7]Benjamin Doerr, Michael Gnewuch:
On Negative Dependence Properties of Latin Hypercube Samples and Scrambled Nets. CoRR abs/2104.10799 (2021) - [i6]Michael Gnewuch, Mario Hefter, Aicke Hinrichs, Klaus Ritter:
Countable Tensor Products of Hermite Spaces and Spaces of Gaussian Kernels. CoRR abs/2110.05778 (2021) - 2020
- [j27]Michael Gnewuch, Marcin Wnuk:
Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration. J. Approx. Theory 251: 105342 (2020) - [j26]Marcin Wnuk, Michael Gnewuch:
Note on pairwise negative dependence of randomly shifted and jittered rank-1 lattices. Oper. Res. Lett. 48(4): 410-414 (2020) - [i5]Marcin Wnuk, Michael Gnewuch:
Randomized sparse grid algorithms for multivariate integration on Haar-Wavelet spaces. CoRR abs/2001.08558 (2020)
2010 – 2019
- 2019
- [j25]Michael Gnewuch, Mario Hefter, Aicke Hinrichs, Klaus Ritter, Grzegorz W. Wasilkowski:
Embeddings for infinite-dimensional integration and L2-approximation with increasing smoothness. J. Complex. 54 (2019) - 2017
- [j24]Michael Gnewuch, Mario Hefter, Aicke Hinrichs, Klaus Ritter:
Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration. J. Approx. Theory 222: 8-39 (2017) - [j23]Michael Gnewuch, Mario Hefter, Aicke Hinrichs, Klaus Ritter, Grzegorz W. Wasilkowski:
Equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in Lp. J. Complex. 40: 78-99 (2017) - 2015
- [j22]Michael Gnewuch, Frances Y. Kuo, Harald Niederreiter, Henryk Wozniakowski:
Guest Editors' Preface. J. Complex. 31(3): vi (2015) - 2014
- [j21]Josef Dick, Michael Gnewuch:
Infinite-Dimensional Integration in Weighted Hilbert Spaces: Anchored Decompositions, Optimal Deterministic Algorithms, and Higher-Order Convergence. Found. Comput. Math. 14(5): 1027-1077 (2014) - [j20]Josef Dick, Michael Gnewuch:
Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition. J. Approx. Theory 184: 111-145 (2014) - [j19]Michael Gnewuch, Sebastian Mayer, Klaus Ritter:
On weighted Hilbert spaces and integration of functions of infinitely many variables. J. Complex. 30(2): 29-47 (2014) - [j18]Jan Baldeaux, Michael Gnewuch:
Optimal Randomized Multilevel Algorithms for Infinite-Dimensional Integration on Function Spaces with ANOVA-Type Decomposition. SIAM J. Numer. Anal. 52(3): 1128-1155 (2014) - 2012
- [j17]Michael Gnewuch:
Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces. J. Complex. 28(1): 2-17 (2012) - [j16]Michael Gnewuch:
Infinite-dimensional integration on weighted Hilbert spaces. Math. Comput. 81(280): 2175-2205 (2012) - [j15]Michael Gnewuch, Magnus Wahlström, Carola Winzen:
A New Randomized Algorithm to Approximate the Star Discrepancy Based on Threshold Accepting. SIAM J. Numer. Anal. 50(2): 781-807 (2012) - [i4]Michael Gnewuch:
Lower Error Bounds for Randomized Multilevel and Changing Dimension Algorithms. CoRR abs/1209.1808 (2012) - 2011
- [j14]Michael Gnewuch, Henryk Wozniakowski:
Quasi-polynomial tractability. J. Complex. 27(3-4): 312-330 (2011) - [i3]Michael Gnewuch, Magnus Wahlström, Carola Winzen:
A Randomized Algorithm Based on Threshold Accepting to Approximate the Star Discrepancy. CoRR abs/1103.2102 (2011) - 2010
- [j13]Benjamin Doerr, Michael Gnewuch, Magnus Wahlström:
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding. J. Complex. 26(5): 490-507 (2010)
2000 – 2009
- 2009
- [j12]Michael Gnewuch, Henryk Wozniakowski:
Generalized Tractability for Multivariate Problems Part II: Linear Tensor Product Problems, Linear Information, and Unrestricted Tractability. Found. Comput. Math. 9(4): 431-460 (2009) - [j11]Michael Gnewuch, Anand Srivastav, Carola Winzen:
Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems. J. Complex. 25(2): 115-127 (2009) - [j10]Michael Gnewuch:
On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence. J. Complex. 25(4): 312-317 (2009) - [j9]Giray Ökten, Michael Gnewuch:
Correction of a proof in "A probabilistic result on the discrepancy of a hybrid-Monte Carlo sequence and applications". Monte Carlo Methods Appl. 15(2): 169-172 (2009) - [i2]Michael Gnewuch:
Discrepancy Bounds for Mixed Sequences. Algorithms and Complexity for Continuous Problems 2009 - [i1]Michael Gnewuch:
Weighted L_2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces. Algorithms and Complexity for Continuous Problems 2009 - 2008
- [j8]Michael Gnewuch:
Construction of Minimal Bracketing Covers for Rectangles. Electron. J. Comb. 15(1) (2008) - [j7]Michael Gnewuch:
Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy. J. Complex. 24(2): 154-172 (2008) - [j6]Benjamin Doerr, Michael Gnewuch, Peter Kritzer, Friedrich Pillichshammer:
Component-by-component construction of low-discrepancy point sets of small size. Monte Carlo Methods Appl. 14(2): 129-149 (2008) - 2007
- [j5]Michael Gnewuch, Henryk Wozniakowski:
Generalized tractability for multivariate problems Part I: Linear tensor product problems and linear information. J. Complex. 23(2): 262-295 (2007) - [j4]Michael Gnewuch, René Lindloh, Reinhold Schneider, Anand Srivastav:
Cubature formulas for function spaces with moderate smoothness. J. Complex. 23(4-6): 828-850 (2007) - [c1]Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann:
A rigorous view on neutrality. IEEE Congress on Evolutionary Computation 2007: 2591-2597 - 2006
- [j3]Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus:
Discrepancy of Symmetric Products of Hypergraphs. Electron. J. Comb. 13(1) (2006) - 2005
- [j2]Michael Gnewuch:
Bounds for the Average Lp-Extreme and the L∞-Extreme Discrepancy. Electron. J. Comb. 12 (2005) - [j1]Benjamin Doerr, Michael Gnewuch, Anand Srivastav:
Bounds and constructions for the star-discrepancy via ?-covers. J. Complex. 21(5): 691-709 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
