Leszek Plaskota
Orcid: 0000-0001-8704-0790
According to our database1,
Leszek Plaskota
authored at least 47 papers
between 1989 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Worst case tractability of linear problems in the presence of noise: Linear information.
J. Complex., December, 2023
2022
Numer. Algorithms, 2022
CoRR, 2022
2020
Numerische Mathematik, 2020
Complexity of approximating Hölder classes from information with varying Gaussian noise.
J. Complex., 2020
On alternative quantization for doubly weighted approximation and integration over unbounded domains.
J. Approx. Theory, 2020
2017
J. Comput. Appl. Math., 2017
2016
J. Complex., 2016
J. Approx. Theory, 2016
2015
Numerische Mathematik, 2015
2014
Efficient algorithms for multivariate and ∞-variate integration with exponential weight.
Numer. Algorithms, 2014
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014
2013
SIAM J. Numer. Anal., 2013
2012
2011
Tractability of infinite-dimensional integration in the worst case and randomized settings.
J. Complex., 2011
2009
Proceedings of the Algorithms and Complexity for Continuous Problems, 20.09. - 25.09.2009, 2009
2008
SIAM J. Numer. Anal., 2008
Math. Comput., 2008
2007
2006
2005
Numerische Mathematik, 2005
J. Complex., 2005
Proceedings of the Intelligent Information Processing and Web Mining, 2005
Statistical Likelihood Representations of Prior Knowledge in Machine Learning.
Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, 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
Math. Comput., 2004
Optimal designs for weighted approximation and integration of stochastic processes on [0, infinity).
J. Complex., 2004
Proceedings of the Algorithms and Complexity for Continuous Problems, 26. September, 2004
2002
Average Case Complexity of Weighted Approximation and Integration over R<sup>+</sup>.
J. Complex., 2002
2001
J. Complex., 2001
Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach.
J. Complex., 2001
2000
Adv. Comput. Math., 2000
1996
Noisy information and computational complexity.
Cambridge University Press, ISBN: 978-0-521-55368-1, 1996
1995
J. Complex., 1995
1993
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting.
J. Complex., 1993
1992
J. Complex., 1992
1991
1990
J. Complex., 1990
1989
J. Complex., 1989