default search action
Arthur G. Werschulz
Person information
- affiliation: Fordham University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j32]Arthur G. Werschulz:
Complexity for a class of elliptic ordinary integro-differential equations. J. Complex. 81: 101820 (2024) - 2022
- [j31]Arthur G. Werschulz:
Complexity and tractability for a class of elliptic partial integro-differential equations. J. Complex. 69: 101603 (2022) - 2021
- [j30]Arthur G. Werschulz, Henryk Wozniakowski:
Tractability for Volterra problems of the second kind with convolution kernels. J. Complex. 64: 101525 (2021)
2010 – 2019
- 2019
- [j29]Arthur G. Werschulz, Henryk Wozniakowski:
Tractability of multivariate approximation over weighted standard Sobolev spaces. J. Complex. 53: 95-112 (2019) - 2017
- [j28]Arthur G. Werschulz, Henryk Wozniakowski:
A new characterization of (s, t)-weak tractability. J. Complex. 38: 68-79 (2017) - 2015
- [j27]Arthur G. Werschulz, Henryk Wozniakowski:
Tight Tractability Results for a Model Second-Order Neumann Problem. Found. Comput. Math. 15(4): 899-929 (2015)
2000 – 2009
- 2009
- [j26]Arthur G. Werschulz:
Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: The relation to the L2-approximation. J. Complex. 25(6): 568-600 (2009) - [r1]Joseph F. Traub, Arthur G. Werschulz:
Information-based Complexity and Information-based Optimization. Encyclopedia of Optimization 2009: 1603-1608 - 2007
- [j25]Arthur G. Werschulz, Henryk Wozniakowski:
Tractability of quasilinear problems I: General results. J. Approx. Theory 145(2): 266-285 (2007) - [j24]Arthur G. Werschulz:
A note on the complexity and tractability of the heat equation. J. Complex. 23(4-6): 553-559 (2007) - [j23]Arthur G. Werschulz, Henryk Wozniakowski:
Tractability of quasilinear problems II: Second-order elliptic problems. Math. Comput. 76(258): 745-776 (2007) - 2003
- [j22]Arthur G. Werschulz:
Where does smoothness count the most for Fredholm equations of the second kind with noisy information? J. Complex. 19(6): 758-798 (2003) - 2002
- [j21]Arthur G. Werschulz, Henryk Wozniakowski:
What Is the Complexity of Volume Calculation? J. Complex. 18(2): 660-678 (2002) - 2001
- [j20]Arthur G. Werschulz, Henryk Wozniakowski:
What Is the Complexity of Surface Integration? J. Complex. 17(2): 442-466 (2001) - [j19]Ian H. Sloan, Arthur G. Werschulz:
ANNOUNCEMENT: 2001 Best Paper Award Committee. J. Complex. 17(3): 495- (2001) - 2000
- [j18]Arthur G. Werschulz:
What Is the Complexity of Stieltjes Integration? J. Complex. 16(2): 377-389 (2000)
1990 – 1999
- 1999
- [j17]Arthur G. Werschulz:
Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems? J. Complex. 15(3): 360-384 (1999) - 1998
- [b2]Joseph F. Traub, Arthur G. Werschulz:
Complexity and information. Lezioni Lincee, Cambridge University Press 1998, ISBN 978-0-521-48005-5, pp. I-XII, 1-139 - 1997
- [j16]Arthur G. Werschulz:
The Complexity of Indefinite Elliptic Problems with Noisy Data. J. Complex. 13(4): 457-479 (1997) - 1996
- [j15]Arthur G. Werschulz:
The Complexity of Definite Elliptic Problems with Noisy Data. J. Complex. 12(4): 440-473 (1996) - 1995
- [j14]Arthur G. Werschulz:
The Complexity of Multivariate Elliptic Problems with Analytic Data. J. Complex. 11(1): 154-173 (1995) - [j13]Arthur G. Werschulz:
What Is the Complexity of Solution-Restricted Operator Equations? J. Complex. 11(4): 493-514 (1995) - 1994
- [j12]Arthur G. Werschulz:
The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data. J. Complex. 10(4): 367-383 (1994) - 1993
- [j11]Arthur G. Werschulz:
The Complexity of Two-Point Boundary-Value Problems with Analytic Data. J. Complex. 9(1): 154-170 (1993) - 1991
- [b1]Arthur G. Werschulz:
Computational complexity of differential and integral equations - an information-based approach. Oxford mathematical monographs, Oxford University Press 1991, ISBN 978-0-19-853589-8, pp. I-IX, 1-331 - [j10]Arthur G. Werschulz:
Optimal residual algorithms for linear operator equations. J. Complex. 7(2): 150-173 (1991) - [j9]Mark A. Kon, Klaus Ritter, Arthur G. Werschulz:
On the average case solvability of III-posed problems. J. Complex. 7(3): 220-224 (1991)
1980 – 1989
- 1989
- [j8]Arthur G. Werschulz:
Optimal algorithms for a problem of optimal control. J. Complex. 5(2): 144-181 (1989) - [j7]Arthur G. Werschulz:
Average case complexity of elliptic partial differential equations. J. Complex. 5(3): 306-330 (1989) - 1987
- [j6]Arthur G. Werschulz:
An information-based approach to III-posed problems. J. Complex. 3(3): 270-301 (1987) - 1985
- [j5]Arthur G. Werschulz:
Complexity of differential and integral equations. J. Complex. 1(2): 232-255 (1985) - 1981
- [j4]Arthur G. Werschulz:
On Maximal Order for Local and Global Numerical Problems. J. Comput. Syst. Sci. 23(1): 38-48 (1981)
1970 – 1979
- 1979
- [j3]Arthur G. Werschulz:
Computational complexity of one-step methods for a scalar autonomous differential equation. Computing 23(4): 345-355 (1979) - [j2]Arthur G. Werschulz:
Maximal Order and Order of Information for Numerical Quadrature. J. ACM 26(3): 527-537 (1979) - [j1]Arthur G. Werschulz:
Optimal Order for Approximation of Derivatives. J. Comput. Syst. Sci. 18(3): 213-217 (1979)
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-04-25 05:56 CEST 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: