Leszek Plaskota

52 papers B 1Journal 45Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Special Issue of the Journal of Complexity. J. Complex. Josef Dick, Michael Gnewuch, Erich Novak, Leszek Plaskota, Jan Vybíral
2025	J	`jnl`	Noisy nonlinear information and entropy numbers. CoRR David Krieg, Erich Novak, Leszek Plaskota, Mario Ullrich
2023	J	`jnl`	Worst case tractability of linear problems in the presence of noise: Linear information. J. Complex. Leszek Plaskota, Pawel Siedlecki
2023	J	`jnl`	Worst case tractability of linear problems in the presence of noise: linear information. CoRR Leszek Plaskota, Pawel Siedlecki
2022	J	`jnl`	Automatic approximation using asymptotically optimal adaptive interpolation. Numer. Algorithms Leszek Plaskota, Pawel Samoraj
2022	J	`jnl`	Monte Carlo integration with adaptive variance reduction: an asymptotic analysis. CoRR Leszek Plaskota, Pawel Przybylowicz, Lukasz T. Stepien
2020	J	`jnl`	Absolute value information for IBC problems. J. Complex. Leszek Plaskota, Pawel Siedlecki, Henryk Wozniakowski
2020	J	`jnl`	Complexity of approximating Hölder classes from information with varying Gaussian noise. J. Complex. Pawel M. Morkisz, Leszek Plaskota
2020	J	`jnl`	On alternative quantization for doubly weighted approximation and integration over unbounded domains. J. Approx. Theory Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski
2020	J	`jnl`	On efficient weighted integration via a change of variables. Numerische Mathematik Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski
2019	J	`jnl`	On alternative quantization for doubly weighted approximation and integration over unbounded domains. CoRR Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski
2017	J	`jnl`	Infinite-dimensional integration and the multivariate decomposition method. J. Comput. Appl. Math. Frances Y. Kuo, Dirk Nuyens, Leszek Plaskota, Ian H. Sloan, Grzegorz W. Wasilkowski
2016	J	`jnl`	Approximation of piecewise Hölder functions from inexact information. J. Complex. Pawel M. Morkisz, Leszek Plaskota
2016	J	`jnl`	Optimal algorithms for doubly weighted approximation of univariate functions. J. Approx. Theory Frances Y. Kuo, Leszek Plaskota, Grzegorz W. Wasilkowski
2015	J	`jnl`	Automatic integration using asymptotically optimal adaptive Simpson quadrature. Numerische Mathematik Leszek Plaskota
2014	B	`conf`	Continuous Problems: Optimality, Complexity, Tractability (Invited Talk). CASC Leszek Plaskota
2014	J	`jnl`	Efficient algorithms for multivariate and ∞-variate integration with exponential weight. Numer. Algorithms Leszek Plaskota, Grzegorz W. Wasilkowski
2013	J	`jnl`	An Adaptive Algorithm for Weighted Approximation of Singular Functions over R. SIAM J. Numer. Anal. Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao
2012	J	`jnl`	On Some Integrated Approaches to Inference CoRR Mark A. Kon, Leszek Plaskota
2011	J	`jnl`	Guest Editors' Preface. J. Complex. Thomas Müller-Gronbach, Leszek Plaskota, Wolfgang Ch. Schmid
2011	J	`jnl`	Tractability of infinite-dimensional integration in the worst case and randomized settings. J. Complex. Leszek Plaskota, Grzegorz W. Wasilkowski
2009	—	`conf`	09391 Abstracts Collection - Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems Thomas Müller-Gronbach, Leszek Plaskota, Joseph F. Traub
2009	—	`ed.`	Algorithms and Complexity for Continuous Problems, 20.09. - 25.09.2009 Algorithms and Complexity for Continuous Problems Thomas Müller-Gronbach, Leszek Plaskota, Joseph F. Traub
2009	J	`jnl`	New averaging technique for approximating weighted integrals. J. Complex. Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao
2008	J	`jnl`	The power of adaption for approximating functions with singularities. Math. Comput. Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao
2008	J	`jnl`	Uniform Approximation of Piecewise r-Smooth and Globally Continuous Functions. SIAM J. Numer. Anal. Leszek Plaskota, Grzegorz W. Wasilkowski
2007	J	`jnl`	Issue dedicated to Professor Henryk Wozniakowski. J. Complex. Boleslaw Z. Kacewicz, Leszek Plaskota, Grzegorz W. Wasilkowski
2006	J	`jnl`	Guest Editors' preface. J. Complex. Leszek Plaskota, Ian H. Sloan
2005	J	`jnl`	Adaption allows efficient integration of functions with unknown singularities. Numerische Mathematik Leszek Plaskota, Grzegorz W. Wasilkowski
2005	J	`jnl`	Information-based nonlinear approximation: an average case setting. J. Complex. Mark A. Kon, Leszek Plaskota
2005	—	`conf`	Machine Learning and Statistical MAP Methods. Intelligent Information Systems Mark A. Kon, Leszek Plaskota, Andrzej W. Przybyszewski
2005	—	`conf`	Statistical Likelihood Representations of Prior Knowledge in Machine Learning. Artificial Intelligence and Applications Mark A. Kon, Leszek Plaskota, Andrzej W. Przybyszewski
2004	J	`jnl`	A Monte Carlo algorithm for weighted integration over Real Math. Comput. Piotr Gajda, Youming Li, Leszek Plaskota, Grzegorz W. Wasilkowski
2004	J	`jnl`	Guest Editors' Preface. J. Complex. Leszek Plaskota, Klaus Ritter
2004	—	`conf`	Information-Based Nonlinear Approximation: An Average Case Setting. Algorithms and Complexity for Continuous Problems Leszek Plaskota
2004	J	`jnl`	Optimal designs for weighted approximation and integration of stochastic processes on [0, infinity). J. Complex. Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski
2004	J	`jnl`	Smolyak's Algorithm for Integration and Numer. Algorithms Leszek Plaskota, Grzegorz W. Wasilkowski
2002	J	`jnl`	Average Case Complexity of Weighted Approximation and Integration over R J. Complex. Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski
2001	J	`jnl`	Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach. J. Complex. Mark A. Kon, Leszek Plaskota
2001	J	`jnl`	The Exact Exponent of Sparse Grid Quadratures in the Weighted Case. J. Complex. Leszek Plaskota, Grzegorz W. Wasilkowski
2000	J	`jnl`	Information complexity of neural networks. Neural Networks Mark A. Kon, Leszek Plaskota
2000	J	`jnl`	The exponent of discrepancy of sparse grids is at least 2.1933. Adv. Comput. Math. Leszek Plaskota
1996	J	`jnl`	How to Benefit from Noise. J. Complex. Leszek Plaskota
1996	—	`book`	Noisy information and computational complexity. Leszek Plaskota
1996	J	`jnl`	Worst Case Complexity of Problems with Random Information Noise. J. Complex. Leszek Plaskota
1995	J	`jnl`	Average Complexity for Linear Problems in a Model with Varying Information Noise. J. Complex. Leszek Plaskota
1993	J	`jnl`	A Note on Varying Cardinality in the Average Case Setting. J. Complex. Leszek Plaskota
1993	J	`jnl`	The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. J. Complex. Boleslaw Z. Kacewicz, Leszek Plaskota
1992	J	`jnl`	Function approximation and integration on the wiener space with noisy data. J. Complex. Leszek Plaskota
1991	J	`jnl`	Noisy information for linear problems in the asymptotic setting. J. Complex. Boleslaw Z. Kacewicz, Leszek Plaskota
1990	J	`jnl`	On average case complexity of linear problems with noisy information. J. Complex. Leszek Plaskota
1989	J	`jnl`	Asymptotic error for the global maximum of functions in s dimensions. J. Complex. Leszek Plaskota