Search the dblp DataBase
Erich Novak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Stephan Dahlke, Erich Novak, Winfried Sickel
Optimal Approximation of Elliptic Problems II: Wavelet Methods. [Citation Graph (0, 0)][DBLP]
Algorithms and Complexity for Continuous Problems, 2004, pp:- [Conf] - Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub
04401 Summary - Algorithms and Complexity for Continuous Problems. [Citation Graph (0, 0)][DBLP]
Algorithms and Complexity for Continuous Problems, 2004, pp:- [Conf] - Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub
04401 Abstracts Collection - Algorithms and Complexity for Continuous. [Citation Graph (0, 0)][DBLP]
Algorithms and Complexity for Continuous Problems, 2004, pp:- [Conf] - Erich Novak, Stephan Dahlke, Winfried Sickel
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings. [Citation Graph (0, 0)][DBLP]
Algorithms and Complexity for Continuous Problems, 2004, pp:- [Conf] - Ronald Cools, Erich Novak, Klaus Ritter
Smolyak's Construction of Cubature Formulas of Arbitrary Trigonometric Degree. [Citation Graph (0, 0)][DBLP]
Computing, 1999, v:62, n:2, pp:147-162 [Journal] - Erich Novak, Ian H. Sloan, Henryk Wozniakowski
Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers. [Citation Graph (0, 0)][DBLP]
Foundations of Computational Mathematics, 2004, v:4, n:2, pp:121-156 [Journal] - Stephan Dahlke, Erich Novak, Winfried Sickel
Optimal approximation of elliptic problems by linear and nonlinear mappings I. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2006, v:22, n:1, pp:29-49 [Journal] - Stefan Heinrich, Erich Novak
GUEST EDITORS' PREFACE. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2001, v:17, n:2, pp:305-0 [Journal] - Stefan Heinrich, Erich Novak
On a problem in quantum summation. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2003, v:19, n:1, pp:1-18 [Journal] - Carsten Katscher, Erich Novak, Knut Petras
Quadrature Formulas for Multivariate Convex Functions. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1996, v:12, n:1, pp:5-16 [Journal] - Mark A. Kon, Erich Novak
On the adaptive and continuous information problems. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1989, v:5, n:3, pp:345-362 [Journal] - Thomas Müller-Gronbach, Erich Novak, Knut Petras
Special issue. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2006, v:22, n:1, pp:3- [Journal] - Erich Novak
On average case errors in numerical analysis. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1986, v:2, n:3, pp:229-238 [Journal] - Erich Novak
Quantum Complexity of Integration. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2001, v:17, n:1, pp:2-16 [Journal] - Erich Novak
Average-case results for zero finding. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1989, v:5, n:4, pp:489-501 [Journal] - Erich Novak
Optimal linear randomized methods for linear operators in Hilbert spaces. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1992, v:8, n:1, pp:22-36 [Journal] - Erich Novak
The Real Number Model in Numerical Analysis. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1995, v:11, n:1, pp:57-73 [Journal] - Erich Novak
On the Power of Adaption. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1996, v:12, n:3, pp:199-237 [Journal] - Erich Novak
Editor's Foreword: Dagstuhl Invited Papers. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1997, v:13, n:4, pp:386-0 [Journal] - Erich Novak
Intractability Results for Positive Quadrature Formulas and Extremal Problems for Trigonometric Polynomials. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1999, v:15, n:3, pp:299-316 [Journal] - Erich Novak, Klaus Ritter
A stochastic analog to Chebyshev centers and optimal average case algorithms. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1989, v:5, n:1, pp:60-79 [Journal] - Erich Novak, Klaus Ritter
Some Complexity Results for Zero Finding for Univariate Functions. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1993, v:9, n:1, pp:15-40 [Journal] - Erich Novak, Ingo Roschmann
Numerical Integration of Peak Functions. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1996, v:12, n:4, pp:358-379 [Journal] - Erich Novak, Ian H. Sloan, Henryk Wozniakowski
Tractability of Tensor Product Linear Operators. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1997, v:13, n:4, pp:387-418 [Journal] - Erich Novak, Henryk Wozniakowski
Complexity of Linear Problems with a Fixed Output Basis. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2000, v:16, n:1, pp:333-362 [Journal] - Erich Novak, Henryk Wozniakowski
Intractability Results for Integration and Discrepancy. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2001, v:17, n:2, pp:388-441 [Journal] - Erich Novak, Henryk Wozniakowski
Relaxed verification for continuous problems. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1992, v:8, n:2, pp:124-152 [Journal] - Erich Novak, Henryk Wozniakowski
Topological Complexity of Zero-Finding. [Citation Graph (0, 0)][DBLP]
J. Complexity, 1996, v:12, n:4, pp:380-400 [Journal] - Stephan Dahlke, Erich Novak, Winfried Sickel
Optimal approximation of elliptic problems by linear and nonlinear mappings II. [Citation Graph (0, 0)][DBLP]
J. Complexity, 2006, v:22, n:4, pp:549-603 [Journal] - Erich Novak, Henryk Wozniakowski
On the Cost of Uniform and Nonuniform Algorithms. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1999, v:219, n:1-2, pp:301-318 [Journal]
High dimensional integration. [Citation Graph (, )][DBLP]
High dimensional polynomial interpolation on sparse grids. [Citation Graph (, )][DBLP]
Search in 0.030secs, Finished in 0.032secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002