 | 2009 |
|---|
| 23 |       | J. F. Traub,
Arthur G. Werschulz:
Information-based Complexity and Information-based Optimization.
Encyclopedia of Optimization 2009: 1603-1608 |
| 2007 |
|---|
| 22 | | Arthur G. Werschulz:
A note on the complexity and tractability of the heat equation.
J. Complexity 23(4-6): 553-559 (2007) |
| 21 | | Arthur G. Werschulz,
Henryk Wozniakowski:
Tractability of quasilinear problems I: General results.
Journal of Approximation Theory 145(2): 266-285 (2007) |
| 2003 |
|---|
| 20 | | Arthur G. Werschulz:
Where does smoothness count the most for Fredholm equations of the second kind with noisy information?
J. Complexity 19(6): 758-798 (2003) |
| 2002 |
|---|
| 19 | | Arthur G. Werschulz,
Henryk Wozniakowski:
What Is the Complexity of Volume Calculation?
J. Complexity 18(2): 660-678 (2002) |
| 2001 |
|---|
| 18 | | Arthur G. Werschulz,
Henryk Wozniakowski:
What Is the Complexity of Surface Integration?
J. Complexity 17(2): 442-466 (2001) |
| 2000 |
|---|
| 17 | | Arthur G. Werschulz:
What Is the Complexity of Stieltjes Integration?
J. Complexity 16(2): 377-389 (2000) |
| 1999 |
|---|
| 16 | | Arthur G. Werschulz:
Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems?
J. Complexity 15(3): 360-384 (1999) |
| 1997 |
|---|
| 15 | | Arthur G. Werschulz:
The Complexity of Indefinite Elliptic Problems with Noisy Data.
J. Complexity 13(4): 457-479 (1997) |
| 1996 |
|---|
| 14 | | Arthur G. Werschulz:
The Complexity of Definite Elliptic Problems with Noisy Data.
J. Complexity 12(4): 440-473 (1996) |
| 1995 |
|---|
| 13 | | Arthur G. Werschulz:
The Complexity of Multivariate Elliptic Problems with Analytic Data.
J. Complexity 11(1): 154-173 (1995) |
| 12 | | Arthur G. Werschulz:
What Is the Complexity of Solution-Restricted Operator Equations?
J. Complexity 11(4): 493-514 (1995) |
| 1994 |
|---|
| 11 | | Arthur G. Werschulz:
The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data.
J. Complexity 10(4): 367-383 (1994) |
| 1993 |
|---|
| 10 | | Arthur G. Werschulz:
The Complexity of Two-Point Boundary-Value Problems with Analytic Data.
J. Complexity 9(1): 154-170 (1993) |
| 1991 |
|---|
| 9 | | Arthur G. Werschulz:
Optimal residual algorithms for linear operator equations.
J. Complexity 7(2): 150-173 (1991) |
| 8 | | Mark A. Kon,
Klaus Ritter,
Arthur G. Werschulz:
On the average case solvability of III-posed problems.
J. Complexity 7(3): 220-224 (1991) |
| 1989 |
|---|
| 7 | | Arthur G. Werschulz:
Optimal algorithms for a problem of optimal control.
J. Complexity 5(2): 144-181 (1989) |
| 6 | | Arthur G. Werschulz:
Average case complexity of elliptic partial differential equations.
J. Complexity 5(3): 306-330 (1989) |
| 1987 |
|---|
| 5 | | Arthur G. Werschulz:
An information-based approach to III-posed problems.
J. Complexity 3(3): 270-301 (1987) |
| 1985 |
|---|
| 4 | | Arthur G. Werschulz:
Complexity of differential and integral equations.
J. Complexity 1(2): 232-255 (1985) |
| 1981 |
|---|
| 3 |  | Arthur G. Werschulz:
On Maximal Order for Local and Global Numerical Problems.
J. Comput. Syst. Sci. 23(1): 38-48 (1981) |
| 1979 |
|---|
| 2 | | Arthur G. Werschulz:
Maximal Order and Order of Information for Numerical Quadrature.
J. ACM 26(3): 527-537 (1979) |
| 1 | | Arthur G. Werschulz:
Optimal Order for Approximation of Derivatives.
J. Comput. Syst. Sci. 18(3): 213-217 (1979) |
