Leszek Plaskota

Orcid: 0000-0001-8704-0790

According to our database1, Leszek Plaskota authored at least 47 papers between 1989 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Worst case tractability of linear problems in the presence of noise: Linear information.
J. Complex., December, 2023

2022
Automatic approximation using asymptotically optimal adaptive interpolation.
Numer. Algorithms, 2022

Monte Carlo integration with adaptive variance reduction: an asymptotic analysis.
CoRR, 2022

2020
On efficient weighted integration via a change of variables.
Numerische Mathematik, 2020

Absolute value information for IBC problems.
J. Complex., 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
Infinite-dimensional integration and the multivariate decomposition method.
J. Comput. Appl. Math., 2017

2016
Approximation of piecewise Hölder functions from inexact information.
J. Complex., 2016

Optimal algorithms for doubly weighted approximation of univariate functions.
J. Approx. Theory, 2016

2015
Automatic integration using asymptotically optimal adaptive Simpson quadrature.
Numerische Mathematik, 2015

2014
Efficient algorithms for multivariate and ∞-variate integration with exponential weight.
Numer. Algorithms, 2014

Continuous Problems: Optimality, Complexity, Tractability (Invited Talk).
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013
An Adaptive Algorithm for Weighted Approximation of Singular Functions over R.
SIAM J. Numer. Anal., 2013

2012
On Some Integrated Approaches to Inference
CoRR, 2012

2011
Tractability of infinite-dimensional integration in the worst case and randomized settings.
J. Complex., 2011

Guest Editors' Preface.
J. Complex., 2011

2009
New averaging technique for approximating weighted integrals.
J. Complex., 2009

09391 Abstracts Collection - Algorithms and Complexity for Continuous Problems.
Proceedings of the Algorithms and Complexity for Continuous Problems, 20.09. - 25.09.2009, 2009

2008
Uniform Approximation of Piecewise r-Smooth and Globally Continuous Functions.
SIAM J. Numer. Anal., 2008

The power of adaption for approximating functions with singularities.
Math. Comput., 2008

2007
Issue dedicated to Professor Henryk Wozniakowski.
J. Complex., 2007

2006
Guest Editors' preface.
J. Complex., 2006

2005
Adaption allows efficient integration of functions with unknown singularities.
Numerische Mathematik, 2005

Information-based nonlinear approximation: an average case setting.
J. Complex., 2005

Machine Learning and Statistical MAP Methods.
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

A Monte Carlo algorithm for weighted integration over Real<sup>d</sup>.
Math. Comput., 2004

Optimal designs for weighted approximation and integration of stochastic processes on [0, infinity).
J. Complex., 2004

Guest Editors' Preface.
J. Complex., 2004

Information-Based Nonlinear Approximation: An Average Case Setting.
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
The Exact Exponent of Sparse Grid Quadratures in the Weighted Case.
J. Complex., 2001

Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach.
J. Complex., 2001

2000
Information complexity of neural networks.
Neural Networks, 2000

The exponent of discrepancy of sparse grids is at least 2.1933.
Adv. Comput. Math., 2000

1996
Worst Case Complexity of Problems with Random Information Noise.
J. Complex., 1996

How to Benefit from Noise.
J. Complex., 1996

Noisy information and computational complexity.
Cambridge University Press, ISBN: 978-0-521-55368-1, 1996

1995
Average Complexity for Linear Problems in a Model with Varying Information Noise.
J. Complex., 1995

1993
A Note on Varying Cardinality in the Average Case Setting.
J. Complex., 1993

The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting.
J. Complex., 1993

1992
Function approximation and integration on the wiener space with noisy data.
J. Complex., 1992

1991
Noisy information for linear problems in the asymptotic setting.
J. Complex., 1991

1990
On average case complexity of linear problems with noisy information.
J. Complex., 1990

1989
Asymptotic error for the global maximum of functions in s dimensions.
J. Complex., 1989


  Loading...