Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Leszek Plaskota
2010 – today
- 2012
[i1]- 2011
- [j26]Thomas Müller-Gronbach, Leszek Plaskota, Wolfgang Ch. Schmid: Guest Editors' Preface. J. Complexity 27(3-4): 263 (2011)
- [j25]Leszek Plaskota, Grzegorz W. Wasilkowski: Tractability of infinite-dimensional integration in the worst case and randomized settings. J. Complexity 27(6): 505-518 (2011)
2000 – 2009
- 2009
- [j24]Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao: New averaging technique for approximating weighted integrals. J. Complexity 25(3): 268-291 (2009)
- 2008
- [j23]Leszek Plaskota, Grzegorz W. Wasilkowski, Yaxi Zhao: The power of adaption for approximating functions with singularities. Math. Comput. 77(264): 2309-2338 (2008)
- [j22]Leszek Plaskota, Grzegorz W. Wasilkowski: Uniform Approximation of Piecewise r-Smooth and Globally Continuous Functions. SIAM J. Numerical Analysis 47(1): 762-785 (2008)
- 2007
- [j21]Boleslaw Z. Kacewicz, Leszek Plaskota, Grzegorz W. Wasilkowski: Issue dedicated to Professor Henryk Wozniakowski. J. Complexity 23(4-6): 421-422 (2007)
- 2006
- [j20]
- 2005
- [j19]Mark A. Kon, Leszek Plaskota: Information-based nonlinear approximation: an average case setting. J. Complexity 21(2): 211-229 (2005)
- [c3]Mark A. Kon, Leszek Plaskota, Andrzej W. Przybyszewski: Statistical Likelihood Representations of Prior Knowledge in Machine Learning. Artificial Intelligence and Applications 2005: 467-472
- [c2]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. Complexity 20(1): 108-131 (2004)
- [j17]
- [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. Numerical Algorithms 36(3): 229-246 (2004)
- [c1]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. Complexity 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. Complexity 17(2): 345-365 (2001)
- [j12]Leszek Plaskota, Grzegorz W. Wasilkowski: The Exact Exponent of Sparse Grid Quadratures in the Weighted Case. J. Complexity 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]
- [j8]Leszek Plaskota: Worst Case Complexity of Problems with Random Information Noise. J. Complexity 12(4): 416-439 (1996)
- 1995
- [j7]Leszek Plaskota: Average Complexity for Linear Problems in a Model with Varying Information Noise. J. Complexity 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. Complexity 9(1): 113-134 (1993)
- [j5]Leszek Plaskota: A Note on Varying Cardinality in the Average Case Setting. J. Complexity 9(4): 458-470 (1993)
- 1992
- [j4]Leszek Plaskota: Function approximation and integration on the wiener space with noisy data. J. Complexity 8(3): 301-323 (1992)
- 1991
- [j3]Boleslaw Z. Kacewicz, Leszek Plaskota: Noisy information for linear problems in the asymptotic setting. J. Complexity 7(1): 35-57 (1991)
- 1990
- [j2]Leszek Plaskota: On average case complexity of linear problems with noisy information. J. Complexity 6(2): 199-230 (1990)
1980 – 1989
- 1989
- [j1]Leszek Plaskota: Asymptotic error for the global maximum of functions in s dimensions. J. Complexity 5(3): 369-378 (1989)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-04 00:33 CET by the dblp team