| Noisy information and computational complexity L Plaskota Cambridge University Press 95 (55), 1996 | 185 | 1996 |
| Information complexity of neural networks MA Kon, L Plaskota Neural Networks 13 (3), 365-375, 2000 | 58 | 2000 |
| Tractability of infinite-dimensional integration in the worst case and randomized settings L Plaskota, GW Wasilkowski Journal of Complexity 27 (6), 505-518, 2011 | 52 | 2011 |
| A new algorithm and worst case complexity for Feynman–Kac path integration L Plaskota, GW Wasilkowski, H Woźniakowski Journal of Computational Physics 164 (2), 335-353, 2000 | 42 | 2000 |
| Information-based nonlinear approximation: an average case setting M Kon, L Plaskota Journal of Complexity 21 (2), 211-229, 2005 | 36 | 2005 |
| Adaption allows efficient integration of functions with unknown singularities L Plaskota, GW Wasilkowski Numerische Mathematik 102, 123-144, 2005 | 31 | 2005 |
| The power of adaption for approximating functions with singularities L Plaskota, G Wasilkowski, Y Zhao Mathematics of computation 77 (264), 2309-2338, 2008 | 27 | 2008 |
| Neural networks, radial basis functions, and complexity MA Kon, L Plaskota, A Cohen, C Rabut, L Schumaker Proceedings of Bialowieza Conference on Statistical Physics, 122-145, 1997 | 21 | 1997 |
| Infinite-dimensional integration and the multivariate decomposition method FY Kuo, D Nuyens, L Plaskota, IH Sloan, GW Wasilkowski Journal of Computational and Applied Mathematics 326, 217-234, 2017 | 20 | 2017 |
| On the minimal cost of approximating linear problems based on information with deterministic noise BZ Kacewicz, L Plaskota Numerical functional analysis and optimization 11 (5-6), 511-528, 1990 | 20 | 1990 |
| Monte Carlo and Quasi-Monte Carlo Methods 2010 L Plaskota, H Woźniakowski Springer Science & Business Media, 2012 | 19 | 2012 |
| Worst case complexity of problems with random information noise L Plaskota Journal of Complexity 12 (4), 416-439, 1996 | 18 | 1996 |
| The power of adaptive algorithms for functions with singularities L Plaskota, GW Wasilkowski Journal of fixed point theory and applications 6, 227-248, 2009 | 17 | 2009 |
| The exponent of discrepancy of sparse grids is at least 2.1933 L Plaskota Advances in Computational Mathematics 12, 3-24, 2000 | 16 | 2000 |
| Uniform approximation of piecewise r-smooth and globally continuous functions L Plaskota, GW Wasilkowski SIAM journal on numerical analysis 47 (1), 762-785, 2009 | 15 | 2009 |
| Complexity of neural network approximation with limited information: a worst case approach M Kon, L Plaskota journal of complexity 17 (2), 345-365, 2001 | 15 | 2001 |
| Function approximation and integration on the Wiener space with noisy data L Plaskota Journal of Complexity 8 (3), 301-323, 1992 | 14 | 1992 |
| On average case complexity of linear problems with noisy information L Plaskota Journal of Complexity 6 (2), 199-230, 1990 | 14 | 1990 |
| Automatic integration using asymptotically optimal adaptive Simpson quadrature L Plaskota Numerische Mathematik 131, 173-198, 2015 | 13 | 2015 |
| Average case complexity of weighted approximation and integration over R+ L Plaskota, K Ritter, GW Wasilkowski journal of complexity 18 (2), 517-544, 2002 | 13 | 2002 |
