Information-based complexity

Science, computational science, and computer science: at a crossroads

CSC '93 Proceedings of the 1993 ACM conference on Computer science

Science, computational science, and computer science: at a crossroads

Communications of the ACM

On numerical solutions to one-dimensional integration problems with applications to linear light sources

ACM Transactions on Graphics (TOG)

SIGACT news complexity theory column 31

ACM SIGACT News

Quantum summation with an application to integration

Journal of Complexity

Real computations with fake numbers

Journal of Complexity

Input-output identifiability of continuous-time linear systems

Journal of Complexity

Worst case complexity of weighted approximation and integration over Rd

Journal of Complexity

Linear vs standard information for scalar stochastic differential equations

Journal of Complexity

Tractability of integration in non-periodic and periodic weighted tensor product Hilbert spaces

Journal of Complexity

Direct estimation of linear functionals from indirect noisy observations

Journal of Complexity

Average case complexity of weighted approximation and integration over R+

Journal of Complexity

What is the complexity of volume calculation?

Journal of Complexity

Complexity of nonlinear two-point boundary-value problems

Journal of Complexity

Applicability of Smolyak's algorithms to certain banach spaces of multivariate functions

Journal of Complexity

Multilevel Monte Carlo Methods

LSSC '01 Proceedings of the Third International Conference on Large-Scale Scientific Computing-Revised Papers

On a problem in quantum summation

Journal of Complexity

Quantum integration in Sobolev classes

Journal of Complexity

Probabilistic and average linear widths of Sobolev space with Gaussian measure

Journal of Complexity

From Monte Carlo to quantum computation

Mathematics and Computers in Simulation - Special issue: 3rd IMACS seminar on Monte Carlo methods - MCM 2001

My dream quadrature rule

Journal of Complexity

Open problems for tractability of multivariate integration

Journal of Complexity

A study on the average case error of composite Newton-Cotes quadratures

The Korean Journal of Computational & Applied Mathematics

Integration error for multivariate functions from anisotropic classes

Journal of Complexity

Dimension-adaptive tensor-product quadrature

Computing

Worst case complexity of multivariate Feynman-Kac path integration

Journal of Complexity

Where does smoothness count the most for Fredholm equations of the second kind with noisy information?

Journal of Complexity

On the Computational Complexity of Consumer Decision Rules

Computational Economics

Quantum approximation I. Embeddings of finite-dimensional Lp spaces

Journal of Complexity

Optimal designs for weighted approximation and integration of stochastic processes on [0, ∞)

Journal of Complexity

An irregular grid method for high-dimensional free-boundary problems in finance

Future Generation Computer Systems - Special issue: Selected numerical algorithms

Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry

The power of various real-valued quantum queries

Journal of Complexity

Lower bound on complexity of optimization of continuous functions

Journal of Complexity

Asymptotic setting (revisited): analysis of a boundary-value problem and a relation to a classical approximation result

Journal of Complexity

Finite-order weights imply tractability of linear multivariate problems

Journal of Approximation Theory

Linear vs. nonlinear algorithms for linear problems

Journal of Complexity

Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure

Journal of Complexity

Linear widths of a multivariate function space equipped with a Gaussian measure

Journal of Approximation Theory

Information-based nonlinear approximation: an average case setting

Journal of Complexity

Classical and Quantum Complexity of the Sturm--Liouville Eigenvalue Problem

Quantum Information Processing

Learning smooth objects by probing

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry

Information-based complexity

Encyclopedia of Computer Science

Approximation on anisotropic Besov classes with mixed norms by standard information

Journal of Complexity

Monte Carlo approximation of weakly singular integral operators

Journal of Complexity

The randomized information complexity of elliptic PDE

Journal of Complexity

The Quantum Setting with Randomized Queries for Continuous Problems

Quantum Information Processing

Optimal approximation of elliptic problems by linear and nonlinear mappings I

Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004

On the complexity of parabolic initial-value problems with variable drift

Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004

Approximation characteristics for diagonal operators in different computational settings

Journal of Approximation Theory

Optimal approximation of SDE's with additive fractional noise

Journal of Complexity

Complexity of initial-value problems for ordinary differential equations of order k

Journal of Complexity

Optimal approximation of elliptic problems by linear and nonlinear mappings II

Journal of Complexity

Randomly shifted lattice rules for unbounded integrands

Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005

The quantum query complexity of elliptic PDE

Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005

Computability of Solutions of Operator Equations

Electronic Notes in Theoretical Computer Science (ENTCS)

Learning smooth shapes by probing

Computational Geometry: Theory and Applications

Tractability of quasilinear problems I: General results

Journal of Approximation Theory

Generalized tractability for multivariate problems Part I

Journal of Complexity

A survey of randomized algorithms for control synthesis and performance verification

Journal of Complexity

A lower bound on complexity of optimization on the Wiener space

Theoretical Computer Science

Note: A note on the complexity and tractability of the heat equation

Journal of Complexity

Simple Monte Carlo and the Metropolis algorithm

Journal of Complexity

On the complexity of the multivariate Sturm--Liouville eigenvalue problem

Journal of Complexity

Cubature formulas for function spaces with moderate smoothness

Journal of Complexity

Disintegration of Gaussian measures and average-case optimal algorithms

Journal of Complexity

Computation of local radius of information in SM-IBC identification of nonlinear systems

Journal of Complexity

Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms

Journal of Approximation Theory

Efficient estimation of option price and price sensitivities via structured database Monte Carlo (SDMC)

Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come

Complexity of Operators on Compact Sets

Electronic Notes in Theoretical Computer Science (ENTCS)

Notions of Probabilistic Computability on Represented Spaces

Electronic Notes in Theoretical Computer Science (ENTCS)

The randomized complexity of initial value problems

Journal of Complexity

Lattice rule algorithms for multivariate approximation in the average case setting

Journal of Complexity

Multivariate L∞ approximation in the worst case setting over reproducing kernel Hilbert spaces

Journal of Approximation Theory

The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods

Journal of Complexity

Linear information versus function evaluations for L2-approximation

Journal of Approximation Theory

Optimal adaptive solution of initial-value problems with unknown singularities

Journal of Complexity

Are unbounded linear operators computable on the average for Gaussian measures?

Journal of Complexity

Investigation of Examples of E-Education Environment for Scientific Collaboration and Distance Graduate Studies, Part 1

Informatica

Investigation of Examples of E-education Environment for Scientific Collaboration and Distance Graduate Studies. Part 2

Informatica

Rethinking Biased Estimation: Improving Maximum Likelihood and the Cramér–Rao Bound

Foundations and Trends in Signal Processing

Monotonicity and stratification

Proceedings of the 40th Conference on Winter Simulation

On the power of standard information for multivariate approximation in the worst case setting

Journal of Approximation Theory

New averaging technique for approximating weighted integrals

Journal of Complexity

Approximation of functions on the Sobolev space on the sphere in the average case setting

Journal of Complexity

On the tractability of linear tensor product problems in the worst case

Journal of Complexity

Randomized approximation of Sobolev embeddings, II

Journal of Complexity

Randomized approximation of Sobolev embeddings, III

Journal of Complexity

Linear average and stochastic n-widths of Besov embeddings on Lipschitz domains

Journal of Approximation Theory

On the approximation of smooth functions using generalized digital nets

Journal of Complexity

Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: The relation to the L2-approximation

Journal of Complexity

Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science

Linear widths of a multivariate function space equipped with a Gaussian measure

Journal of Approximation Theory

Finite-order weights imply tractability of linear multivariate problems

Journal of Approximation Theory

Approximation characteristics for diagonal operators in different computational settings

Journal of Approximation Theory

Approximation on anisotropic Besov classes with mixed norms by standard information

Journal of Complexity

Optimal approximation of elliptic problems by linear and nonlinear mappings I

Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004

On the complexity of parabolic initial-value problems with variable drift

Journal of Complexity - Special issue: Algorithms and complexity for continuous problems Schloss Dagstuhl, Germany, September 2004

Monte Carlo approximation of weakly singular integral operators

Journal of Complexity

The randomized information complexity of elliptic PDE

Journal of Complexity

Exact error estimates and optimal randomized algorithms for integration

NMA'06 Proceedings of the 6th international conference on Numerical methods and applications

Multi-level Monte Carlo algorithms for infinite-dimensional integration on RN

Journal of Complexity

The approximation characteristic of diagonal matrix in probabilistic setting

Journal of Complexity

Adaptive Itô-Taylor algorithm can optimally approximate the Itô integrals of singular functions

Journal of Computational and Applied Mathematics

Tractability through increasing smoothness

Journal of Complexity

Liberating the dimension

Journal of Complexity

Dimension-wise integration of high-dimensional functions with applications to finance

Journal of Complexity

Spatially adaptive sparse grids for high-dimensional data-driven problems

Journal of Complexity

A decision-theoretic formalism for belief-optimal reasoning

PerMIS '09 Proceedings of the 9th Workshop on Performance Metrics for Intelligent Systems

Optimal recovery of isotropic classes of twice-differentiable multivariate functions

Journal of Complexity

Estimating the average of a Lipschitz-continuous function from one sample

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I

Lower bounds for the complexity of linear functionals in the randomized setting

Journal of Complexity

Liberating the dimension for function approximation

Journal of Complexity

Ubiquity symposium: What is the Right Computational Model for Continuous Scientific Problems?

Ubiquity

An Interview with Joseph F. Traub

Ubiquity

Experimental evidence of application of direct and inverse operators in complex processes

Pattern Recognition and Image Analysis

Liberating the dimension for function approximation: Standard information

Journal of Complexity

Tractability of infinite-dimensional integration in the worst case and randomized settings

Journal of Complexity

Optimal cubature formulas for tensor products of certain classes of functions

Journal of Complexity

Tractability results for weighted Banach spaces of smooth functions

Journal of Complexity

Numerical analysis on a quantum computer

LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing

Optimally adaptive integration of univariate lipschitz functions

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics

Ultrastability of nth minimal errors

Journal of Complexity

Brief Unfalsified model parametrization based on frequency domain noise information

Automatica (Journal of IFAC)

Book review

Automatica (Journal of IFAC)

Optimal induced-norm and set membership state smoothing and filtering for linear systems with bounded disturbances

Automatica (Journal of IFAC)

Worst-case conditional system identification in a general class of norms

Automatica (Journal of IFAC)

Stable Evaluation of Gaussian Radial Basis Function Interpolants

SIAM Journal on Scientific Computing

On Dimension-independent Rates of Convergence for Function Approximation with Gaussian Kernels

SIAM Journal on Numerical Analysis

Full length article: Optimal recovery of twice differentiable functions based on symmetric splines

Journal of Approximation Theory

Average case tractability of non-homogeneous tensor product problems

Journal of Complexity

Adaptive parameter choice for one-sided finite difference schemes and its application in diabetes technology

Journal of Complexity

Computable Approximations of Reals: An Information-Theoretic Analysis

Fundamenta Informaticae

Full length article: Continuous algorithms in adaptive sampling recovery

Journal of Approximation Theory

Full length article: Sampling numbers of periodic Sobolev spaces with a Gaussian measure in the average case setting

Journal of Approximation Theory

On tractability of linear tensor product problems for ∞-variate classes of functions

Journal of Complexity

Uniform weak tractability

Journal of Complexity

Cloud computing in cryptography and steganography

Cybernetics and Systems Analysis

The cost of deterministic, adaptive, automatic algorithms: Cones, not balls

Journal of Complexity

Quasi-polynomial tractability of linear problems in the average case setting

Journal of Complexity

Optimal solution of a class of non-autonomous initial-value problems with unknown singularities

Journal of Computational and Applied Mathematics

Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm

Applied Numerical Mathematics

Approximation of analytic functions in Korobov spaces

Journal of Complexity

Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions

Journal of Complexity

Approximation numbers of Sobolev embeddings-Sharp constants and tractability

Journal of Complexity