Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Erich Novak
2010 – today
- 2012
[j40]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski: Thomas Daun, Leszek Plaskota, Greg W. Wasilkowski Win the 2011 Best Paper Award. J. Complexity 28(5-6): 519 (2012)- 2011
[j39]Aicke Hinrichs, Erich Novak, Henryk Wozniakowski: The curse of dimensionality for the class of monotone functions and for the class of convex functions. Journal of Approximation Theory 163(8): 955-965 (2011)
[j38]Erich Novak, Henryk Wozniakowski: Lower bounds for the complexity of linear functionals in the randomized setting. J. Complexity 27(1): 1-22 (2011)
[j37]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski: Aicke Hinrichs, Simon Foucart, Alain Pajor, Holger Rauhut, Tino Ullrich win the 2010 Best Paper Award. J. Complexity 27(6): 501 (2011)- 2010
[j36]Stephan Dahlke, Erich Novak, Winfried Sickel: Optimal approximation of elliptic problems by linear and nonlinear mappings IV: Errors in L2 and other norms. J. Complexity 26(1): 102-124 (2010)
2000 – 2009
- 2009
[j35]Erich Novak, Henryk Wozniakowski: Approximation of infinitely differentiable multivariate functions is intractable. J. Complexity 25(4): 398-404 (2009)
[j34]Erich Novak, Ian H. Sloan, Joseph F. Traub, Henryk Wozniakowski: Changes to the Editorial Board. J. Complexity 25(6): 510 (2009)- 2008
[j33]Aicke Hinrichs, Erich Novak, Jan Vybíral: Linear information versus function evaluations for L2-approximation. Journal of Approximation Theory 153(1): 97-107 (2008)- 2007
[j32]Stephan Dahlke, Erich Novak, Winfried Sickel: Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames. J. Complexity 23(4-6): 614-648 (2007)
[j31]Peter Mathé, Erich Novak: Simple Monte Carlo and the Metropolis algorithm. J. Complexity 23(4-6): 673-696 (2007)
[j30]Aicke Hinrichs, Erich Novak: Cubature formulas for symmetric measures in higher dimensions with few points. Math. Comput. 76(259): 1357-1372 (2007)- 2006
[j29]
[j28]Stephan Dahlke, Erich Novak, Winfried Sickel: Optimal approximation of elliptic problems by linear and nonlinear mappings I. J. Complexity 22(1): 29-49 (2006)
[j27]Stephan Dahlke, Erich Novak, Winfried Sickel: Optimal approximation of elliptic problems by linear and nonlinear mappings II. J. Complexity 22(4): 549-603 (2006)- 2005
[e1]Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub (Eds.): Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004. Dagstuhl Seminar Proceedings 04401, IBFI, Schloss Dagstuhl, Germany 2005- 2004
[j26]Erich Novak, Ian H. Sloan, Henryk Wozniakowski: Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers. Foundations of Computational Mathematics 4(2): 121-156 (2004)
[j25]Erich Novak, Harald Pfeiffer: Coin Tossing Algorithms for Integral Equations and Tractability. Monte Carlo Meth. and Appl. 10(3-4): 491-498 (2004)
[c4]Stephan Dahlke, Erich Novak, Winfried Sickel: Optimal Approximation of Elliptic Problems II: Wavelet Methods. Algorithms and Complexity for Continuous Problems 2004
[c3]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
[c2]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
[c1]Erich Novak, Stephan Dahlke, Winfried Sickel: Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings. Algorithms and Complexity for Continuous Problems 2004- 2003
[j24]- 2001
[j23]
[j22]
[j21]Erich Novak, Henryk Wozniakowski: Intractability Results for Integration and Discrepancy. J. Complexity 17(2): 388-441 (2001)- 2000
[j20]
[j19]Volker Barthelmann, Erich Novak, Klaus Ritter: High dimensional polynomial interpolation on sparse grids. Adv. Comput. Math. 12(4): 273-288 (2000)
[j18]Erich Novak, Henryk Wozniakowski: Complexity of Linear Problems with a Fixed Output Basis. J. Complexity 16(1): 333-362 (2000)
1990 – 1999
- 1999
[j17]Ronald Cools, Erich Novak, Klaus Ritter: Smolyak's Construction of Cubature Formulas of Arbitrary Trigonometric Degree. Computing 62(2): 147-162 (1999)
[j16]Erich Novak: Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials. J. Complexity 15(3): 299-316 (1999)
[j15]Erich Novak, Henryk Wozniakowski: On the Cost of Uniform and Nonuniform Algorithms. Theor. Comput. Sci. 219(1-2): 301-318 (1999)- 1997
[j14]
[j13]Erich Novak, Ian H. Sloan, Henryk Wozniakowski: Tractability of Tensor Product Linear Operators. J. Complexity 13(4): 387-418 (1997)- 1996
[j12]Carsten Katscher, Erich Novak, Knut Petras: Quadrature Formulas for Multivariate Convex Functions. J. Complexity 12(1): 5-16 (1996)
[j11]
[j10]Erich Novak, Ingo Roschmann: Numerical Integration of Peak Functions. J. Complexity 12(4): 358-379 (1996)
[j9]Erich Novak, Henryk Wozniakowski: Topological Complexity of Zero-Finding. J. Complexity 12(4): 380-400 (1996)- 1995
[j8]- 1993
[j7]Erich Novak, Klaus Ritter: Some Complexity Results for Zero Finding for Univariate Functions. J. Complexity 9(1): 15-40 (1993)- 1992
[j6]Erich Novak: Optimal linear randomized methods for linear operators in Hilbert spaces. J. Complexity 8(1): 22-36 (1992)
[j5]Erich Novak, Henryk Wozniakowski: Relaxed verification for continuous problems. J. Complexity 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. Complexity 5(1): 60-79 (1989)
[j3]Mark A. Kon, Erich Novak: On the adaptive and continuous information problems. J. Complexity 5(3): 345-362 (1989)
[j2]- 1986
[j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:59 CEST by the dblp team



