default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeszek Plaskota
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j39]Leszek Plaskota
, Pawel Siedlecki:
Worst case tractability of linear problems in the presence of noise: Linear information. J. Complex. 79: 101782 (2023)- [i6]Leszek Plaskota, Pawel Siedlecki:
Worst case tractability of linear problems in the presence of noise: linear information. CoRR abs/2303.16328 (2023) - 2022
- [j38]Leszek Plaskota, Pawel Samoraj:
Automatic approximation using asymptotically optimal adaptive interpolation. Numer. Algorithms 89(1): 277-302 (2022) - [i5]Leszek Plaskota, Pawel Przybylowicz, Lukasz T. Stepien:
Monte Carlo integration with adaptive variance reduction: an asymptotic analysis. CoRR abs/2206.03125 (2022) - 2020
- [j37]Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski:
On alternative quantization for doubly weighted approximation and integration over unbounded domains. J. Approx. Theory 256: 105433 (2020) - [j36]Leszek Plaskota, Pawel Siedlecki, Henryk Wozniakowski:
Absolute value information for IBC problems. J. Complex. 56 (2020) - [j35]Pawel M. Morkisz, Leszek Plaskota:
Complexity of approximating Hölder classes from information with varying Gaussian noise. J. Complex. 60: 101497 (2020) - [j34]Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski:
On efficient weighted integration via a change of variables. Numerische Mathematik 146(3): 545-570 (2020)
2010 – 2019
- 2019
- [i4]Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski:
On alternative quantization for doubly weighted approximation and integration over unbounded domains. CoRR abs/1907.04015 (2019) - 2017
- [j33]Frances Y. Kuo, Dirk Nuyens, Leszek Plaskota, Ian H. Sloan, Grzegorz W. Wasilkowski:
Infinite-dimensional integration and the multivariate decomposition method. J. Comput. Appl. Math. 326: 217-234 (2017) - 2016
- [j32]Frances Y. Kuo, Leszek Plaskota, Grzegorz W. Wasilkowski:
Optimal algorithms for doubly weighted approximation of univariate functions. J. Approx. Theory 201: 30-47 (2016) - [j31]Pawel M. Morkisz, Leszek Plaskota:
Approximation of piecewise Hölder functions from inexact information. J. Complex. 32(1): 122-136 (2016) - 2015
- [j30]Leszek Plaskota:
Automatic integration using asymptotically optimal adaptive Simpson quadrature. Numerische Mathematik 131(1): 173-198 (2015) - 2014
- [j29]Leszek Plaskota, Grzegorz W. Wasilkowski:
Efficient algorithms for multivariate and ∞-variate integration with exponential weight. Numer. Algorithms 67(2): 385-403 (2014) - [c3]Leszek Plaskota:
Continuous Problems: Optimality, Complexity, Tractability (Invited Talk). CASC 2014: 357-372 - 2013
- [j28]Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao:
An Adaptive Algorithm for Weighted Approximation of Singular Functions over R. SIAM J. Numer. Anal. 51(3): 1470-1493 (2013) - 2012
- [i3]Mark A. Kon, Leszek Plaskota:
On Some Integrated Approaches to Inference. CoRR abs/1212.1180 (2012) - 2011
- [j27]Thomas Müller-Gronbach, Leszek Plaskota, Wolfgang Ch. Schmid:
Guest Editors' Preface. J. Complex. 27(3-4): 263 (2011) - [j26]Leszek Plaskota, Grzegorz W. Wasilkowski:
Tractability of infinite-dimensional integration in the worst case and randomized settings. J. Complex. 27(6): 505-518 (2011)
2000 – 2009
- 2009
- [j25]Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao:
New averaging technique for approximating weighted integrals. J. Complex. 25(3): 268-291 (2009) - [e1]Thomas Müller-Gronbach, Leszek Plaskota, Joseph F. Traub:
Algorithms and Complexity for Continuous Problems, 20.09. - 25.09.2009. Dagstuhl Seminar Proceedings 09391, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i2]Thomas Müller-Gronbach, Leszek Plaskota, Joseph F. Traub:
09391 Abstracts Collection - Algorithms and Complexity for Continuous Problems. Algorithms and Complexity for Continuous Problems 2009 - 2008
- [j24]Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao:
The power of adaption for approximating functions with singularities. Math. Comput. 77(264): 2309-2338 (2008) - [j23]Leszek Plaskota, Grzegorz W. Wasilkowski:
Uniform Approximation of Piecewise r-Smooth and Globally Continuous Functions. SIAM J. Numer. Anal. 47(1): 762-785 (2008) - 2007
- [j22]Boleslaw Z. Kacewicz, Leszek Plaskota, Grzegorz W. Wasilkowski:
Issue dedicated to Professor Henryk Wozniakowski. J. Complex. 23(4-6): 421-422 (2007) - 2006
- [j21]Leszek Plaskota, Ian H. Sloan:
Guest Editors' preface. J. Complex. 22(5) (2006) - 2005
- [j20]Mark A. Kon, Leszek Plaskota:
Information-based nonlinear approximation: an average case setting. J. Complex. 21(2): 211-229 (2005) - [j19]Leszek Plaskota, Grzegorz W. Wasilkowski:
Adaption allows efficient integration of functions with unknown singularities. Numerische Mathematik 102(1): 123-144 (2005) - [c2]Mark A. Kon, Leszek Plaskota, Andrzej W. Przybyszewski:
Statistical Likelihood Representations of Prior Knowledge in Machine Learning. Artificial Intelligence and Applications 2005: 467-472 - [c1]Mark A. Kon, Leszek Plaskota, Andrzej W. Przybyszewski:
Machine Learning and Statistical MAP Methods. Intelligent Information Systems 2005: 441-445 - 2004
- [j18]Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski:
Optimal designs for weighted approximation and integration of stochastic processes on [0, infinity). J. Complex. 20(1): 108-131 (2004) - [j17]Leszek Plaskota, Klaus Ritter:
Guest Editors' Preface. J. Complex. 20(5): 592 (2004) - [j16]Piotr Gajda, Youming Li, Leszek Plaskota, Grzegorz W. Wasilkowski:
A Monte Carlo algorithm for weighted integration over Reald. Math. Comput. 73(246): 813-825 (2004) - [j15]Leszek Plaskota, Grzegorz W. Wasilkowski:
Smolyak's Algorithm for Integration and L1-Approximation of Multivariate Functions with Bounded Mixed Derivatives of Second Order. Numer. Algorithms 36(3): 229-246 (2004) - [i1]Leszek Plaskota:
Information-Based Nonlinear Approximation: An Average Case Setting. Algorithms and Complexity for Continuous Problems 2004 - 2002
- [j14]Leszek Plaskota, Klaus Ritter, Grzegorz W. Wasilkowski:
Average Case Complexity of Weighted Approximation and Integration over R+. J. Complex. 18(2): 517-544 (2002) - 2001
- [j13]Mark A. Kon, Leszek Plaskota:
Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach. J. Complex. 17(2): 345-365 (2001) - [j12]Leszek Plaskota, Grzegorz W. Wasilkowski:
The Exact Exponent of Sparse Grid Quadratures in the Weighted Case. J. Complex. 17(4): 840-849 (2001) - 2000
- [j11]Leszek Plaskota:
The exponent of discrepancy of sparse grids is at least 2.1933. Adv. Comput. Math. 12(1): 3-24 (2000) - [j10]Mark A. Kon, Leszek Plaskota:
Information complexity of neural networks. Neural Networks 13(3): 365-375 (2000)
1990 – 1999
- 1996
- [b1]Leszek Plaskota:
Noisy information and computational complexity. Cambridge University Press 1996, ISBN 978-0-521-55368-1, pp. I-XI, 1-308 - [j9]Leszek Plaskota:
How to Benefit from Noise. J. Complex. 12(2): 175-184 (1996) - [j8]Leszek Plaskota:
Worst Case Complexity of Problems with Random Information Noise. J. Complex. 12(4): 416-439 (1996) - 1995
- [j7]Leszek Plaskota:
Average Complexity for Linear Problems in a Model with Varying Information Noise. J. Complex. 11(2): 240-264 (1995) - 1993
- [j6]Boleslaw Z. Kacewicz, Leszek Plaskota:
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting. J. Complex. 9(1): 113-134 (1993) - [j5]Leszek Plaskota:
A Note on Varying Cardinality in the Average Case Setting. J. Complex. 9(4): 458-470 (1993) - 1992
- [j4]Leszek Plaskota:
Function approximation and integration on the wiener space with noisy data. J. Complex. 8(3): 301-323 (1992) - 1991
- [j3]Boleslaw Z. Kacewicz, Leszek Plaskota:
Noisy information for linear problems in the asymptotic setting. J. Complex. 7(1): 35-57 (1991) - 1990
- [j2]Leszek Plaskota:
On average case complexity of linear problems with noisy information. J. Complex. 6(2): 199-230 (1990)
1980 – 1989
- 1989
- [j1]Leszek Plaskota:
Asymptotic error for the global maximum of functions in s dimensions. J. Complex. 5(3): 369-378 (1989)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
