Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Arthur G. Werschulz" ( http://dblp.L3S.de/Authors/Arthur_G._Werschulz )

  Author page on DBLP  Author page in RDF  Community of Arthur G. Werschulz in ASPL-2

Publication years (Num. hits)
1979-1996 (15) 1997-2009 (12)
Publication types (Num. hits)
article(24) book(2) incollection(1)
Venues (Conferences, Journals, ...)
J. Complexity(19) J. Comput. Syst. Sci.(2) Encyclopedia of Optimization(1) J. ACM(1) Journal of Approximation Theor...(1) Math. Comput.(1)
Authors
Arthur G. Werschulz(27) Henryk Wozniakowski(4) J. F. Traub(1) Joseph F. Traub(1) Klaus Ritter(1) Mark A. Kon(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords
Results
Found 27 publication records. Showing 27 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Arthur G. Werschulz Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: The relation to the L2-approximation. Search on Bibsonomy J. Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1J. F. Traub, Arthur G. Werschulz Information-based Complexity and Information-based Optimization. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Information-based complexity, Information-based optimization, Real number model, High-dimensional integration, Mathematical finance, Linear programming, Nonlinear optimization, Curse of dimensionality
1Arthur G. Werschulz, Henryk Wozniakowski Tractability of quasilinear problems I: General results. Search on Bibsonomy Journal of Approximation Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz A note on the complexity and tractability of the heat equation. Search on Bibsonomy J. Complexity The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz, Henryk Wozniakowski Tractability of quasilinear problems II: Second-order elliptic problems. Search on Bibsonomy Math. Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Where does smoothness count the most for Fredholm equations of the second kind with noisy information? Search on Bibsonomy J. Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz, Henryk Wozniakowski What Is the Complexity of Volume Calculation? Search on Bibsonomy J. Complexity The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz, Henryk Wozniakowski What Is the Complexity of Surface Integration? Search on Bibsonomy J. Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz What Is the Complexity of Stieltjes Integration? Search on Bibsonomy J. Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems? Search on Bibsonomy J. Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Joseph F. Traub, Arthur G. Werschulz Complexity and information. Search on Bibsonomy 1998   RDF
1Arthur G. Werschulz The Complexity of Indefinite Elliptic Problems with Noisy Data. Search on Bibsonomy J. Complexity The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz The Complexity of Definite Elliptic Problems with Noisy Data. Search on Bibsonomy J. Complexity The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz What Is the Complexity of Solution-Restricted Operator Equations? Search on Bibsonomy J. Complexity The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz The Complexity of Multivariate Elliptic Problems with Analytic Data. Search on Bibsonomy J. Complexity The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data. Search on Bibsonomy J. Complexity The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz The Complexity of Two-Point Boundary-Value Problems with Analytic Data. Search on Bibsonomy J. Complexity The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Optimal residual algorithms for linear operator equations. Search on Bibsonomy J. Complexity The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Mark A. Kon, Klaus Ritter, Arthur G. Werschulz On the average case solvability of III-posed problems. Search on Bibsonomy J. Complexity The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Computational complexity of differential and integral equations - an information-based approach. Search on Bibsonomy 1991   RDF
1Arthur G. Werschulz Average case complexity of elliptic partial differential equations. Search on Bibsonomy J. Complexity The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Optimal algorithms for a problem of optimal control. Search on Bibsonomy J. Complexity The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz An information-based approach to III-posed problems. Search on Bibsonomy J. Complexity The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Complexity of differential and integral equations. Search on Bibsonomy J. Complexity The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz On Maximal Order for Local and Global Numerical Problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Maximal Order and Order of Information for Numerical Quadrature. Search on Bibsonomy J. ACM The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
1Arthur G. Werschulz Optimal Order for Approximation of Derivatives. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #27 of 27 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.