default search action
Erich Novak
Person information
- affiliation: Friedrich Schiller University of Jena, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j105]Erich Novak, Friedrich Pillichshammer:
Intractability results for integration in tensor product spaces. J. Complex. 86: 101901 (2025) - [j104]Erich Novak, Kateryna Pozharska, Mathias Sonnleitner, Michaela Szölgyenyi, Henryk Wozniakowski:
Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 86: 101902 (2025) - [j103]Erich Novak, Mario Ullrich, Jan Vybíral:
Stefan Heinrich is the Winner of the 2024 Best Paper Award of the Journal of Complexity. J. Complex. 86: 101905 (2025) - 2024
- [j102]Robert J. Kunsch, Erich Novak, Marcin Wnuk:
Randomized approximation of summable sequences - adaptive and non-adaptive. J. Approx. Theory 304: 106056 (2024) - [j101]David Krieg, Erich Novak, Mathias Sonnleitner, Michaela Szölgyenyi, Henryk Wozniakowski:
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 80: 101805 (2024) - [j100]Erich Novak:
Changes of the Editorial Board. J. Complex. 80: 101806 (2024) - [j99]Erich Novak:
Thomas Jahn, Tino Ullrich and Felix Voigtlaender are the Winners of the 2023 Best Paper Award of the Journal of Complexity. J. Complex. 82: 101834 (2024) - [j98]Erich Novak:
David Krieg is the winner of the 2024 Joseph F. Traub Prize for Achievement in Information-Based Complexity. J. Complex. 83: 101857 (2024) - [i15]Erich Novak, Friedrich Pillichshammer:
The Lp-discrepancy for finite p>1 suffers from the curse of dimensionality. CoRR abs/2403.07961 (2024) - [i14]Erich Novak, Friedrich Pillichshammer:
Intractability results for integration in tensor product spaces. CoRR abs/2404.17163 (2024) - [i13]Erich Novak, Friedrich Pillichshammer:
Conditions for tractability of the weighted Lp-discrepancy and integration in non-homogeneous tensor product spaces. CoRR abs/2405.12729 (2024) - [i12]David Krieg
, Erich Novak, Mario Ullrich:
On the power of adaption and randomization. CoRR abs/2406.07108 (2024) - 2023
- [j97]Erich Novak:
Journal of Complexity Best Paper Award. J. Complex. 75: 101723 (2023) - [j96]Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Changes of the Editorial Board. J. Complex. 75: 101728 (2023) - [j95]Alexey A. Khartov, David Krieg, Erich Novak, Michaela Szölgyenyi, Henryk Wozniakowski:
Information-based complexity young researcher award. J. Complex. 75: 101729 (2023) - [j94]Erich Novak:
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 75: 101730 (2023) - [j93]Erich Novak:
Best Paper Award of the Journal of Complexity. J. Complex. 75: 101731 (2023) - [j92]Erich Novak:
Dmitriy Bilyk and Feng Dai are the winners of the 2023 Joseph F. Traub Prize for Achievement in Information-Based Complexity. J. Complex. 77: 101756 (2023) - [j91]Erich Novak, Friedrich Pillichshammer
The curse of dimensionality for the Lp-discrepancy with finite p. J. Complex. 79: 101769 (2023) - [j90]Erich Novak:
Changes of the Editorial Board. J. Complex. 79: 101792 (2023) - [i11]Erich Novak, Friedrich Pillichshammer:
The curse of dimensionality for the Lp-discrepancy with finite p. CoRR abs/2303.01787 (2023) - [i10]Erich Novak:
Optimal Algorithms for Numerical Integration: Recent Results and Open Problems. CoRR abs/2307.06787 (2023) - [i9]Robert J. Kunsch, Erich Novak, Marcin Wnuk:
Randomized approximation of summable sequences - adaptive and non-adaptive. CoRR abs/2308.01705 (2023) - 2022
- [j89]Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Changes of the Editorial Board. J. Complex. 68: 101623 (2022) - [j88]Erich Novak:
Michaela Szölgyenyi is the winner of the 2021 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 68: 101624 (2022) - [j87]Erich Novak:
Nominations for 2022 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 68: 101625 (2022) - [j86]Erich Novak:
Best Paper Award of the Journal of Complexity. J. Complex. 69: 101640 (2022) - [j85]Erich Novak, Joscha Prochno, Mario Ullrich:
Approximation and Geometry in High Dimensions. J. Complex. 71: 101661 (2022) - [j84]Erich Novak:
Announcement: IBC award 2022 and the nomination deadline 2023. J. Complex. 71: 101669 (2022) - [j83]Aicke Hinrichs, David Krieg
Lower bounds for integration and recovery in L2. J. Complex. 72: 101662 (2022) - [j82]David Krieg
Recovery of Sobolev functions restricted to iid sampling. Math. Comput. 91(338): 2715-2738 (2022) - 2021
- [j81]Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
Changes of the Editorial Board. J. Complex. 62: 101533 (2021) - [j80]Erich Novak:
David Krieg is the winner of the 2020 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 62: 101535 (2021) - [j79]Erich Novak:
Nominations for 2021 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 62: 101536 (2021) - [j78]Aicke Hinrichs, David Krieg
Lower bounds for the error of quadrature formulas for Hilbert spaces. J. Complex. 65: 101544 (2021) - [j77]Erich Novak:
V. N. Temlyakov, M. Ullrich and T. Ullrich are the winners of the 2021 Joseph F. Traub Prize for Achievement in Information-Based Complexity. J. Complex. 65: 101581 (2021) - [i8]David Krieg, Erich Novak, Mathias Sonnleitner:
Recovery of Sobolev functions restricted to iid sampling. CoRR abs/2108.02055 (2021) - [i7]Aicke Hinrichs, David Krieg, Erich Novak, Jan Vybíral:
Lower bounds for integration and recovery in L2. CoRR abs/2108.11853 (2021) - 2020
- [j76]Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Ian H. Sloan
Editorial board announcements. J. Complex. 59: 101492 (2020) - [j75]Erich Novak:
Heping Wang and Guiqiao Xu are the winners of the IBC Award 2020. J. Complex. 59: 101493 (2020) - [j74]Erich Novak:
Algorithms and complexity for functions on general domains. J. Complex. 61: 101458 (2020) - [i6]Aicke Hinrichs, David Krieg, Erich Novak, Jan Vybíral:
Lower Bounds for the Error of Quadrature Formulas for Hilbert Spaces. CoRR abs/2004.00274 (2020)
2010 – 2019
- 2019
- [j73]Robert J. Kunsch
Solvable integration problems and optimal sample size selection. J. Complex. 53: 40-67 (2019) - [j72]Shun Zhang
Optimal Quadrature Formulas for the Sobolev Space $$H^1$$ H 1. J. Sci. Comput. 78(1): 274-289 (2019) - [i5]Erich Novak:
Algorithms and Complexity for Functions on General Domains. CoRR abs/1908.05943 (2019) - 2018
- [j71]Erich Novak:
2018 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2018. J. Complex. 44: 30 (2018) - [j70]Joseph Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Ian H. Sloan, Grzegorz W. Wasilkowski, Henryk Wozniakowski:
New Members of the Editorial Board. J. Complex. 44: iii (2018) - [j69]Erich Novak:
Takashi Goda and Larisa Yaroslavtseva share the 2017 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 44: iv (2018) - [j68]Josef Dick, Aicke Hinrichs, Erich Novak, Klaus Ritter, Ian H. Sloan
Changes of the Editorial Board. J. Complex. 46: iii (2018) - 2017
- [j67]Erich Novak, Mario Ullrich
Complexity of oscillatory integrals on the real line. Adv. Comput. Math. 43(3): 537-553 (2017) - [j66]David Krieg
A Universal Algorithm for Multivariate Integration. Found. Comput. Math. 17(4): 895-916 (2017) - [j65]Aicke Hinrichs, Erich Novak, Mario Ullrich
Product rules are optimal for numerical integration in classical smoothness spaces. J. Complex. 38: 39-49 (2017) - [j64]Erich Novak:
Mario Hefter Wins the 2016 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 39: v (2017) - [j63]Erich Novak:
2017 Joseph F. Traub Information-Based Complexity Young Researcher Award: Nomination deadline: Sept. 30 2017. J. Complex. 39: vi (2017) - [j62]Erich Novak:
Winners of the 2016 Best Paper Award. J. Complex. 40: vii (2017) - [j61]Erich Novak:
2017 Joseph F. Traub Prize for Achievement in Information-Based Complexity. J. Complex. 41: v (2017) - 2016
- [j60]Erich Novak, Henryk Wozniakowski:
Tractability of multivariate problems for standard and linear information in the worst case setting: Part I. J. Approx. Theory 207: 177-192 (2016) - [j59]Erich Novak, Klaus Ritter, Ian H. Sloan
The Future of the Journal of Complexity. J. Complex. 32(1): v (2016) - [j58]Erich Novak:
Mario Ullrich Wins the 2015 Joseph F. Traub Information-Based Complexity Young Researcher Award. J. Complex. 32(1): vi (2016) - [j57]Erich Novak:
Thomas Müller-Gronbach, Klaus Ritter and Larisa Yaroslavtseva share the 2015 Best Paper Award. J. Complex. 34: v (2016) - [j56]Erich Novak:
Nominations for 2016 Information-Based Complexity Young Researcher Award. J. Complex. 34: vii (2016) - 2015
- [j55]Erich Novak, Mario Ullrich
Complexity of oscillatory integration for univariate Sobolev spaces. J. Complex. 31(1): 15-41 (2015) - [j54]Erich Novak, Ian H. Sloan
Tino Ullrich Wins the 2014 Information-Based Complexity Young Researcher Award. J. Complex. 31(2): v (2015) - [j53]Erich Novak, Klaus Ritter, Ian H. Sloan
Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award. J. Complex. 31(3): v (2015) - [j52]Erich Novak, Henryk Wozniakowski:
In memory of Nikolai Sergeevich Bakhvalov (1934-2005). J. Complex. 31(4): 495 (2015) - [j51]Erich Novak, Klaus Ritter, Ian H. Sloan
Joseph F. Traub, the Founding Editor of the Journal of Complexity, dies at 83. J. Complex. 31(6): v (2015) - 2014
- [j50]Aicke Hinrichs, Erich Novak, Mario Ullrich
On weak tractability of the Clenshaw-Curtis Smolyak algorithm. J. Approx. Theory 183: 31-44 (2014) - [j49]Erich Novak, Ian H. Sloan
Christoph Aistleitner Wins the 2013 Information-Based Complexity Young Researcher Award. J. Complex. 30(1): v (2014) - [j48]Aicke Hinrichs, Andreas Neuenkirch
Guest Editors' Preface. J. Complex. 30(2): 1 (2014) - [j47]Aicke Hinrichs, Erich Novak, Mario Ullrich
The curse of dimensionality for numerical integration of smooth functions II. J. Complex. 30(2): 117-143 (2014) - [j46]Erich Novak, Ian H. Sloan
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award. J. Complex. 30(3): v (2014) - [j45]Erich Novak, Ian H. Sloan
Frances Kuo Wins the 2014 Information-Based Complexity Prize. J. Complex. 30(4): v (2014) - [j44]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski:
Announcement. J. Complex. 30(5): v (2014) - [j43]Aicke Hinrichs, Erich Novak, Mario Ullrich
The curse of dimensionality for numerical integration of smooth functions. Math. Comput. 83(290): 2853-2863 (2014) - [c1]Erich Novak:
Some Results on the Complexity of Numerical Integration. MCQMC 2014: 161-183 - 2012
- [b1]Thomas Müller-Gronbach, Erich Novak, Klaus Ritter:
Monte Carlo-Algorithmen. Springer-Lehrbuch, Springer 2012, ISBN 978-3-540-89140-6, pp. I-IX, 1-324 - [j42]Erich Novak, Ian H. Sloan
Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award. J. Complex. 28(5-6): 519 (2012) - 2011
- [j41]Aicke Hinrichs, Erich Novak, Henryk Wozniakowski:
The curse of dimensionality for the class of monotone functions and for the class of convex functions. J. Approx. Theory 163(8): 955-965 (2011) - [j40]Erich Novak, Henryk Wozniakowski:
Lower bounds for the complexity of linear functionals in the randomized setting. J. Complex. 27(1): 1-22 (2011) - [j39]Erich Novak, Ian H. Sloan
Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award. J. Complex. 27(6): 501 (2011) - 2010
- [j38]Stephan Dahlke, Erich Novak, Winfried Sickel:
Optimal approximation of elliptic problems by linear and nonlinear mappings IV: Errors in L2 and other norms. J. Complex. 26(1): 102-124 (2010)
2000 – 2009
- 2009
- [j37]Erich Novak, Henryk Wozniakowski:
Approximation of infinitely differentiable multivariate functions is intractable. J. Complex. 25(4): 398-404 (2009) - [j36]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski:
Changes to the Editorial Board. J. Complex. 25(6): 510 (2009) - 2008
- [j35]Aicke Hinrichs, Erich Novak, Jan Vybíral
Linear information versus function evaluations for L2-approximation. J. Approx. Theory 153(1): 97-107 (2008) - 2007
- [j34]Stephan Dahlke, Erich Novak, Winfried Sickel:
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames. J. Complex. 23(4-6): 614-648 (2007) - [j33]Peter Mathé
Simple Monte Carlo and the Metropolis algorithm. J. Complex. 23(4-6): 673-696 (2007) - [j32]Aicke Hinrichs, Erich Novak:
Cubature formulas for symmetric measures in higher dimensions with few points. Math. Comput. 76(259): 1357-1372 (2007) - 2006
- [j31]Thomas Müller-Gronbach, Erich Novak, Knut Petras:
Special issue. J. Complex. 22(1): 3 (2006) - [j30]Stephan Dahlke, Erich Novak, Winfried Sickel:
Optimal approximation of elliptic problems by linear and nonlinear mappings I. J. Complex. 22(1): 29-49 (2006) - [j29]Stephan Dahlke, Erich Novak, Winfried Sickel:
Optimal approximation of elliptic problems by linear and nonlinear mappings II. J. Complex. 22(4): 549-603 (2006) - 2005
- [e1]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004. Dagstuhl Seminar Proceedings 04401, IBFI, Schloss Dagstuhl, Germany 2005 [contents] - 2004
- [j28]Erich Novak, Ian H. Sloan
Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers. Found. Comput. Math. 4(2): 121-156 (2004) - [j27]Erich Novak, Harald Pfeiffer:
Coin Tossing Algorithms for Integral Equations and Tractability. Monte Carlo Methods Appl. 10(3-4): 491-498 (2004) - [i4]Stephan Dahlke, Erich Novak, Winfried Sickel:
Optimal Approximation of Elliptic Problems II: Wavelet Methods. Algorithms and Complexity for Continuous Problems 2004 - [i3]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub:
04401 Summary - Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems 2004 - [i2]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub:
04401 Abstracts Collection - Algorithms and Complexity for Continuous. Algorithms and Complexity for Continuous Problems 2004 - [i1]Erich Novak, Stephan Dahlke, Winfried Sickel:
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings. Algorithms and Complexity for Continuous Problems 2004 - 2003
- [j26]Stefan Heinrich, Erich Novak:
On a problem in quantum summation. J. Complex. 19(1): 1-18 (2003) - 2001
- [j25]Erich Novak:
Quantum Complexity of Integration. J. Complex. 17(1): 2-16 (2001) - [j24]Stefan Heinrich, Erich Novak:
GUEST EDITORS' PREFACE. J. Complex. 17(2): 305- (2001) - [j23]Erich Novak, Henryk Wozniakowski:
Intractability Results for Integration and Discrepancy. J. Complex. 17(2): 388-441 (2001) - [j22]Ronald Cools
Spherical Product Algorithms and the Integration of Smooth Functions with One Singular Point. SIAM J. Numer. Anal. 39(4): 1132-1145 (2001) - 2000
- [j21]Erich Novak:
High dimensional integration. Adv. Comput. Math. 12(1): 1-2 (2000) - [j20]Volker Barthelmann, Erich Novak, Klaus Ritter:
High dimensional polynomial interpolation on sparse grids. Adv. Comput. Math. 12(4): 273-288 (2000) - [j19]Erich Novak, Henryk Wozniakowski:
Complexity of Linear Problems with a Fixed Output Basis. J. Complex. 16(1): 333-362 (2000)
1990 – 1999
- 1999
- [j18]Ronald Cools
Smolyak's Construction of Cubature Formulas of Arbitrary Trigonometric Degree. Computing 62(2): 147-162 (1999) - [j17]Erich Novak:
Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials. J. Complex. 15(3): 299-316 (1999) - [j16]Erich Novak, Henryk Wozniakowski:
On the Cost of Uniform and Nonuniform Algorithms. Theor. Comput. Sci. 219(1-2): 301-318 (1999) - 1997
- [j15]Erich Novak:
Editor's Foreword: Dagstuhl Invited Papers. J. Complex. 13(4): 386- (1997) - [j14]Erich Novak, Ian H. Sloan
Tractability of Tensor Product Linear Operators. J. Complex. 13(4): 387-418 (1997) - 1996
- [j13]Carsten Katscher, Erich Novak, Knut Petras:
Quadrature Formulas for Multivariate Convex Functions. J. Complex. 12(1): 5-16 (1996) - [j12]Erich Novak:
On the Power of Adaption. J. Complex. 12(3): 199-237 (1996) - [j11]Erich Novak, Ingo Roschmann:
Numerical Integration of Peak Functions. J. Complex. 12(4): 358-379 (1996) - [j10]Erich Novak, Henryk Wozniakowski:
Topological Complexity of Zero-Finding. J. Complex. 12(4): 380-400 (1996) - 1995
- [j9]Erich Novak:
The Real Number Model in Numerical Analysis. J. Complex. 11(1): 57-73 (1995) - 1994
- [j8]Erich Novak:
Information-Based Complexity (By Joseph F. Traub, G. W. Wasilkowski, and H. Woiniakowski). SIAM Rev. 36(3): 514-515 (1994) - 1993
- [j7]Erich Novak, Klaus Ritter:
Some Complexity Results for Zero Finding for Univariate Functions. J. Complex. 9(1): 15-40 (1993) - 1992
- [j6]Erich Novak:
Optimal linear randomized methods for linear operators in Hilbert spaces. J. Complex. 8(1): 22-36 (1992) - [j5]Erich Novak, Henryk Wozniakowski:
Relaxed verification for continuous problems. J. Complex. 8(2): 124-152 (1992)
1980 – 1989
- 1989
- [j4]Erich Novak, Klaus Ritter:
A stochastic analog to Chebyshev centers and optimal average case algorithms. J. Complex. 5(1): 60-79 (1989) - [j3]Mark A. Kon, Erich Novak:
On the adaptive and continuous information problems. J. Complex. 5(3): 345-362 (1989) - [j2]Erich Novak:
Average-case results for zero finding. J. Complex. 5(4): 489-501 (1989) - 1986
- [j1]Erich Novak:
On average case errors in numerical analysis. J. Complex. 2(3): 229-238 (1986)
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-11-19 20: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: