Leszek Plaskota

653 total citations
43 papers, 396 citations indexed

About

Leszek Plaskota is a scholar working on Numerical Analysis, Applied Mathematics and Computational Theory and Mathematics. According to data from OpenAlex, Leszek Plaskota has authored 43 papers receiving a total of 396 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Numerical Analysis, 20 papers in Applied Mathematics and 14 papers in Computational Theory and Mathematics. Recurrent topics in Leszek Plaskota's work include Mathematical Approximation and Integration (27 papers), Mathematical functions and polynomials (13 papers) and Iterative Methods for Nonlinear Equations (7 papers). Leszek Plaskota is often cited by papers focused on Mathematical Approximation and Integration (27 papers), Mathematical functions and polynomials (13 papers) and Iterative Methods for Nonlinear Equations (7 papers). Leszek Plaskota collaborates with scholars based in Poland, United States and Germany. Leszek Plaskota's co-authors include Grzegorz W. Wasilkowski, G.W. Wasilkowski, Mark Kon, Henryk Woźniakowski, Bolesław Kacewicz, Klaus Ritter, Dirk Nuyens, Ian H. Sloan, Frances Y. Kuo and Peter Kritzer and has published in prestigious journals such as Journal of Computational Physics, Mathematics of Computation and Neural Networks.

In The Last Decade

Leszek Plaskota

41 papers receiving 369 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Leszek Plaskota Poland 10 222 143 103 84 61 43 396
Grzegorz W. Wasilkowski United States 14 432 1.9× 213 1.5× 101 1.0× 102 1.2× 123 2.0× 35 534
Peter Kritzer Austria 12 414 1.9× 154 1.1× 82 0.8× 94 1.1× 84 1.4× 60 455
Arthur G. Werschulz United States 10 171 0.8× 104 0.7× 137 1.3× 111 1.3× 20 0.3× 61 339
Ðinh Dũng Vietnam 13 313 1.4× 192 1.3× 111 1.1× 180 2.1× 69 1.1× 48 502
Bolesław Kacewicz Poland 12 130 0.6× 37 0.3× 152 1.5× 63 0.8× 68 1.1× 46 487
S. Mohammad Hosseini Iran 12 284 1.3× 82 0.6× 77 0.7× 44 0.5× 17 0.3× 44 522
Aicke Hinrichs Germany 12 219 1.0× 151 1.1× 53 0.5× 66 0.8× 57 0.9× 57 404
D. B. Hunter United Kingdom 10 122 0.5× 184 1.3× 81 0.8× 26 0.3× 73 1.2× 28 466
Mario Ullrich Austria 12 186 0.8× 104 0.7× 38 0.4× 48 0.6× 27 0.4× 25 282
Tino Ullrich Germany 17 391 1.8× 538 3.8× 87 0.8× 187 2.2× 45 0.7× 45 799

Countries citing papers authored by Leszek Plaskota

Since Specialization
Citations

This map shows the geographic impact of Leszek Plaskota's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Leszek Plaskota with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Leszek Plaskota more than expected).

Fields of papers citing papers by Leszek Plaskota

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Leszek Plaskota. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Leszek Plaskota. The network helps show where Leszek Plaskota may publish in the future.

Co-authorship network of co-authors of Leszek Plaskota

This figure shows the co-authorship network connecting the top 25 collaborators of Leszek Plaskota. A scholar is included among the top collaborators of Leszek Plaskota based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Leszek Plaskota. Leszek Plaskota is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Plaskota, Leszek, et al.. (2023). Worst case tractability of linear problems in the presence of noise: Linear information. Journal of Complexity. 79. 101782–101782. 1 indexed citations
2.
Plaskota, Leszek, et al.. (2021). Automatic approximation using asymptotically optimal adaptive interpolation. Numerical Algorithms. 89(1). 277–302.
3.
Plaskota, Leszek, et al.. (2020). Complexity of approximating Hölder classes from information with varying Gaussian noise. Journal of Complexity. 60. 101497–101497. 2 indexed citations
4.
Plaskota, Leszek, et al.. (2019). Absolute value information for IBC problems. Journal of Complexity. 56. 101427–101427. 1 indexed citations
5.
Kuo, Frances Y., Dirk Nuyens, Leszek Plaskota, Ian H. Sloan, & G.W. Wasilkowski. (2015). Infinite-dimensional integration and the multivariate decomposition\n method. arXiv (Cornell University). 8 indexed citations
6.
Plaskota, Leszek, et al.. (2015). Approximation of piecewise Hölder functions from inexact information. Journal of Complexity. 32(1). 122–136. 5 indexed citations
7.
Plaskota, Leszek & G.W. Wasilkowski. (2011). Tractability of infinite-dimensional integration in the worst case and randomized settings. Journal of Complexity. 27(6). 505–518. 35 indexed citations
8.
Kon, Mark & Leszek Plaskota. (2005). Information-based nonlinear approximation: an average case setting. Journal of Complexity. 21(2). 211–229. 7 indexed citations
9.
Plaskota, Leszek, Klaus Ritter, & Grzegorz W. Wasilkowski. (2003). Optimal designs for weighted approximation and integration of stochastic processes on [0,∞). Journal of Complexity. 20(1). 108–131. 8 indexed citations
10.
Plaskota, Leszek, Klaus Ritter, & Grzegorz W. Wasilkowski. (2002). Average Case Complexity of Weighted Approximation and Integration over R+. Journal of Complexity. 18(2). 517–544. 13 indexed citations
11.
Kon, Mark & Leszek Plaskota. (2001). Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach. Journal of Complexity. 17(2). 345–365. 8 indexed citations
12.
Plaskota, Leszek. (1998). Average CaseL∞-Approximation in the Presence of Gaussian Noise. Journal of Approximation Theory. 93(3). 501–515. 2 indexed citations
13.
Plaskota, Leszek. (1996). Worst Case Complexity of Problems with Random Information Noise. Journal of Complexity. 12(4). 416–439. 13 indexed citations
14.
Plaskota, Leszek. (1996). How to Benefit from Noise. Journal of Complexity. 12(2). 175–184. 7 indexed citations
15.
Plaskota, Leszek. (1995). Average Complexity for Linear Problems in a Model with Varying Information Noise. Journal of Complexity. 11(2). 240–264. 1 indexed citations
16.
Plaskota, Leszek. (1993). Optimal Approximation of Linear Operators Based on Noisy Data on Functionals. Journal of Approximation Theory. 73(1). 93–105. 4 indexed citations
17.
Plaskota, Leszek. (1993). A Note on Varying Cardinality in the Average Case Setting. Journal of Complexity. 9(4). 458–470. 5 indexed citations
18.
Kacewicz, Bolesław & Leszek Plaskota. (1993). The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. Journal of Complexity. 9(1). 113–134. 1 indexed citations
19.
Kacewicz, Bolesław & Leszek Plaskota. (1991). Noisy information for linear problems in the asymptotic setting. Journal of Complexity. 7(1). 35–57. 4 indexed citations
20.
Plaskota, Leszek. (1990). On average case complexity of linear problems with noisy information. Journal of Complexity. 6(2). 199–230. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026