1. An Information-Based Approach to III-Posed Problems Werschulz, Arthur G. 1986 Reports Computer science
3. Complexity and tractability of the heat equation Werschulz, Arthur G. 2006 Reports Computer science
4. Complexity of Indefinite Elliptic Problems Werschulz, Arthur G. 1983 Reports Computer scienceMathematics
5. Complexity or Differential and Integral Equations Werschulz, Arthur G. 1985 Reports Computer scienceMathematics
6. Counterexamples in Optimal Quadrature Werschulz, Arthur G. 1983 Reports Computer scienceMathematics
9. Information-based complexity and information-based optimization Traub, Joseph F.; Werschulz, Arthur G. 1999 Reports Computer science
10. Is Gauss quadrature optimal for analytic functions? Kowalski, M. A.; Werschulz, Arthur G.; Wozniakowski, Henryk 1983 Reports Computer scienceMathematics
12. Surface Approximation May Be Easier Than Surface Integration Werschulz, Arthur G.; Wozniakowski, Henryk 2001 Reports Computer science
13. The complexity of definite elliptic problems with noisy data Werschulz, Arthur G. 1996 Reports Computer science
14. The Complexity of Fredholm Equations of the Second Kind: Noisy Information About Everything Werschulz, Arthur G. 2004 Reports Computer science
15. The complexity of indefinite elliptic problems with noisy data Werschulz, Arthur G. 1997 Reports Computer science
16. The Complexity of Multivariate Elliptic Problems with Analytic Data Werschulz, Arthur G. 1994 Reports Computer science
17. The Complexity of the Poisson Problem for Spaces of Bounded Mixed Derivatives Werschulz, Arthur G. 1995 Reports Computer science
18. The Complexity of Two-Point Boundary-Value Problems With Piecewise Analytic Data Werschulz, Arthur G. 1993 Reports Computer science
19. Tractability of multivariate approximation over a weighted unanchored Sobolev space: Smoothness sometimes hurts Werschulz, Arthur G.; Wozniakowski, Henryk 2008 Reports Computer science
20. Tractability of Quasilinear Problems. I: General Results Werschulz, Arthur G.; Wozniakowski, Henryk 2005 Reports Computer science
21. Tractability of quasilinear problems. II: Second-order elliptic problems Werschulz, Arthur G.; Wozniakowski, Henryk 2005 Reports Computer science
22. Tractability of the Fredholm problem of the second kind Werschulz, Arthur G.; Wozniakowski, Henryk 2010 Reports Computer science
23. Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: Relation to L2-approximation Werschulz, Arthur G. 2007 Reports Computer science
25. What Is the Complexity of Related Elliptic, Parabolic, and Hyperbolic Problems? Werschulz, Arthur G. 1983 Reports Computer scienceMathematics
26. What Is the Complexity of Solution-Restricted Operator Equations? Werschulz, Arthur G. 1995 Reports Computer science
27. What Is the Complexity of Stieltjes Integration? Werschulz, Arthur G. 1998 Reports Computer science
28. What is the complexity of surface integration? Wozniakowski, Henryk; Werschulz, Arthur G. 1999 Reports Computer science
29. What is the Complexity of the Fredholm Problem of the Second Kind? Werschulz, Arthur G. 1984 Reports Computer science
30. What is the complexity of volume calculation? Werschulz, Arthur G.; Wozniakowski, Henryk 2000 Reports Computer science
31. Where Does Smoothness Count the Most For Fredholm Equations of the Second Kind With Noisy Information? Werschulz, Arthur G. 2001 Reports Computer science
32. Where does smoothness count the most for two-point boundary-value problems? Werschulz, Arthur G. 1997 Reports Computer science