Grzegorz W. Wasilkowski
Affiliations:- University of Kentucky, Lexington, KY, USA
According to our database1,
Grzegorz W. Wasilkowski
authored at least 96 papers
between 1980 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on cs.uky.edu
On csauthors.net:
Bibliography
2023
2021
2020
Numerische Mathematik, 2020
ε-superposition and truncation dimensions in average and probabilistic settings for ∞-variate linear problems.
J. Complex., 2020
On alternative quantization for doubly weighted approximation and integration over unbounded domains.
J. Approx. Theory, 2020
2019
Numer. Algorithms, 2019
Truncation in average and worst case settings for special classes of ∞-variate functions.
Math. Comput. Simul., 2019
Embeddings for infinite-dimensional integration and L2-approximation with increasing smoothness.
J. Complex., 2019
2018
Efficient Implementations of the Multivariate Decomposition Method for Approximating Infinite-Variate Integrals.
SIAM J. Sci. Comput., 2018
2017
J. Comput. Appl. Math., 2017
Equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in L<sub>p</sub>.
J. Complex., 2017
Small superposition dimension and active set construction for multivariate integration under modest error demand.
J. Complex., 2017
2016
Very low truncation dimension for high dimensional integration under modest error demand.
J. Complex., 2016
On equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in L<sub>1</sub> or L<sub>∞</sub>.
J. Complex., 2016
J. Approx. Theory, 2016
2014
Efficient algorithms for multivariate and ∞-variate integration with exponential weight.
Numer. Algorithms, 2014
Tractability of approximation of ∞-variate functions with bounded mixed partial derivatives.
J. Complex., 2014
2013
SIAM J. Numer. Anal., 2013
On tractability of linear tensor product problems for <i>∞</i>∞-variate classes of functions.
J. Complex., 2013
Erratum to "Liberating the dimension for L2-approximation" [Journal of Complexity 28 (2012) 304-319].
J. Complex., 2013
2012
2011
J. Complex., 2011
Tractability of infinite-dimensional integration in the worst case and randomized settings.
J. Complex., 2011
2010
Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands.
J. Complex., 2010
2009
On the power of standard information for multivariate approximation in the worst case setting.
J. Approx. Theory, 2009
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting.
Found. Comput. Math., 2009
2008
SIAM J. Numer. Anal., 2008
Math. Comput., 2008
Multivariate L<sub>∞</sub> approximation in the worst case setting over reproducing kernel Hilbert spaces.
J. Approx. Theory, 2008
2007
The power of standard information for multivariate approximation in the randomized setting.
Math. Comput., 2007
2006
2005
A Piecewise Constant Algorithm for Weighted L<sub>1</sub> Approximation over Bounded or Unbounded Regions in R<sup>s</sup>.
SIAM J. Numer. Anal., 2005
Numerische Mathematik, 2005
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Worst Case Setting.
Found. Comput. Math., 2005
2004
Smolyak's Algorithm for Integration and <i>L</i><sub>1</sub>-Approximation of Multivariate Functions with Bounded Mixed Derivatives of Second Order.
Numer. Algorithms, 2004
On tractability of weighted integration over bounded and unbounded regions in Real<sup>s</sup>.
Math. Comput., 2004
Math. Comput., 2004
Optimal designs for weighted approximation and integration of stochastic processes on [0, infinity).
J. Complex., 2004
J. Approx. Theory, 2004
2002
Average Case Complexity of Weighted Approximation and Integration over R<sup>+</sup>.
J. Complex., 2002
J. Complex., 2002
2001
J. Complex., 2001
Found. Comput. Math., 2001
2000
Numer. Algorithms, 2000
1999
J. Complex., 1999
1997
1996
Average Case Complexity of Multivariate Integration and Function Approximation: An Overview.
J. Complex., 1996
1995
J. Parallel Distributed Comput., 1995
J. Complex., 1995
1994
The Computational Complexity of Differential and Integral Equations: An Information-Based Approach (Arthur G. Werschulz).
SIAM Rev., 1994
On Strong Tractability of Multivariate Problems.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994
1993
J. Complex., 1993
Algorithmica, 1993
1992
On a posteriori upper bounds for approximating linear functionals in a probabilistic setting.
J. Complex., 1992
1990
J. Complex., 1990
1989
On adaptive information with varying cardinality for linear problems with elliptically contoured measures.
J. Complex., 1989
1988
Proceedings of the Second International Conference on Computer Vision, 1988
Information-based complexity.
Computer science and scientific computing, Academic Press, ISBN: 978-0-12-697545-1, 1988
1987
J. Complex., 1987
1986
J. Complex., 1986
J. Complex., 1986
1985
1984
1983
Any Iteration for Polynomial Equations Using Linear Information has Infinite Complexity.
Theor. Comput. Sci., 1983
Inverse Function Problem.
J. Inf. Process. Cybern., 1983
1981
n-Evaluation Conjecture for Multipoint Iterations for the Solution of Scalar Nonlinear Equations.
J. ACM, 1981
1980
J. ACM, 1980