The following pages link to Leszek Plaskota (Q209585):
Displayed 50 items.
- Item:Q209585 (redirect page) (← links)
- Item:Q209585 (redirect page) (← links)
- Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight (Q466863) (← links)
- Automatic integration using asymptotically optimal adaptive simpson quadrature (Q495532) (← links)
- Tractability of infinite-dimensional integration in the worst case and randomized settings (Q647921) (← links)
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\) (Q700174) (← links)
- Smolyak's algorithm for integration and \(L_1\)-approximation of multivariate functions with bounded mixed derivatives of second order (Q701927) (← links)
- Noisy information for linear problems in the asymptotic setting (Q806961) (← links)
- Optimal algorithms for doubly weighted approximation of univariate functions (Q892175) (← links)
- Approximation of piecewise Hölder functions from inexact information (Q895991) (← links)
- New averaging technique for approximating weighted integrals (Q1023278) (← links)
- Function approximation and integration on the Wiener space with noisy data (Q1201160) (← links)
- Average case \(L_\infty\)-approximation in the presence of Gaussian noise (Q1266109) (← links)
- A note on varying cardinality in the average case setting (Q1330147) (← links)
- The exact exponent of sparse grid quadratures in the weighted case (Q1347862) (← links)
- Information-based nonlinear approximation: an average case setting (Q1772685) (← links)
- Optimal approximation of linear operators based on noisy data on functionals (Q1801571) (← links)
- Asymptotic error for the global maximum of functions in s dimensions (Q1824570) (← links)
- Optimal designs for weighted approximation and integration of stochastic processes on \([0,\infty)\) (Q1883588) (← links)
- Average complexity for linear problems in a model with varying information noise (Q1893075) (← links)
- The exponent of discrepancy of sparse grids is at least 2. 1933 (Q1968619) (← links)
- Infinite-dimensional integration and the multivariate decomposition method (Q2012602) (← links)
- Automatic approximation using asymptotically optimal adaptive interpolation (Q2066201) (← links)
- On alternative quantization for doubly weighted approximation and integration over unbounded domains (Q2182918) (← links)
- Complexity of approximating Hölder classes from information with varying Gaussian noise (Q2192676) (← links)
- On efficient weighted integration via a change of variables (Q2209530) (← links)
- Absolute value information for IBC problems (Q2283126) (← links)
- Worst case complexity of problems with random information noise (Q2365416) (← links)
- The minimal cost of approximating linear operators using perturbed information -- the asymptotic setting (Q2365845) (← links)
- The power of adaptive algorithms for functions with singularities (Q2431380) (← links)
- How to benefit from noise (Q2565196) (← links)
- Adaption allows efficient integration of functions with unknown singularities (Q2574952) (← links)
- On average case complexity of linear problems with noisy information (Q2638754) (← links)
- An Adaptive Algorithm for Weighted Approximation of Singular Functions over $\mathbb{R}$ (Q2845599) (← links)
- Continuous Problems: Optimality, Complexity, Tractability (Invited Talk) (Q2879339) (← links)
- Noisy Information: Optimality, Complexity, Tractability (Q2926215) (← links)
- The power of adaption for approximating functions with singularities (Q3055072) (← links)
- On the minimal cost of approximating linear problems based on information with deterministic noise (Q3474221) (← links)
- (Q3745638) (← links)
- Optimal linear information in the problem of reconstructing the global maximum of a real function (Q3762084) (← links)
- Termination Conditions for Approximating Linear Problems with Noisy Information (Q4031576) (← links)
- Noisy Information and Computational Complexity (Q4229815) (← links)
- (Q4389411) (← links)
- A Monte Carlo algorithm for weighted integration over $\mathbb {R}^d$ (Q4452162) (← links)
- (Q4549522) (← links)
- On Linear Versus Nonlinear Approximation in the Average Case Setting (Q4611839) (← links)
- (Q4717958) (← links)
- Noisy Information and Computational Complexity (Q5198928) (← links)
- Uniform Approximation of Piecewise r-Smooth and Globally Continuous Functions (Q5305953) (← links)
- A new algorithm and worst case complexity for Feynman-Kac path integration. (Q5926791) (← links)