yusuke1997/dblp-id-title huggingface dataset:
Deterministic sampling of sparse trigonometric polynomials
Enlarging the domain of starting points for Newton's method under center conditions on the first Fréchet-derivative
Tractability of infinite-dimensional integration in the worst case and randomized settings
The Discrepancy and Gain Coefficients of Scrambled Digital Nets
New explicit-in-dimension estimates for the cardinality of high-dimensional hyperbolic crosses and approximation of functions having mixed smoothness
New lower bound estimates for quadratures of bounded analytic functions
Learning rate of distribution regression with dependent samples
A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions
Intractability results for integration in tensor product spaces
Test complexity of generic polynomials
A note about EC-(s, t)-weak tractability of multivariate approximation with analytic Korobov kernels
Special Issue on the Complexity of Multivariate Problems
Approximating smooth and sparse functions by deep neural networks: Optimal approximation rates and saturation
On the power of standard information for tractability for L 2 -approximation in the average case setting
On the convergence of gradient descent for robust functional linear regression
Some informational requirements for convergence
Recognizing Global Occurrence of Local Properties
Exponential lower bounds for finding Brouwer fix points
A note on concatenation of quasi-Monte Carlo and plain Monte Carlo rules in high dimensions
Z 8 -Kerdock codes and pseudorandom binary sequences
Nonparametric regression using needlet kernels for spherical data
New bounds on the minimal dispersion
Erratum to "Liberating the dimension for L2-approximation" [Journal of Complexity 28 (2012) 304-319]
Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time
Linear Monte Carlo quadrature with optimal confidence intervals
Random-prime-fixed-vector randomised lattice-based algorithm for high-dimensional integration
Computation of Affine Covariants of Quadratic Bivariate Differential Systems
The curse of dimensionality for the L p -discrepancy with finite p
P R != NC R
Kolmogorov widths of intersections of finite-dimensional balls
Nominations for 2021 Joseph F. Traub Information-Based Complexity Young Researcher Award
Optimal recovery of Besov classes of generalized smoothness and Sobolev classes on the sphere
Complexity and tractability for a class of elliptic partial integro-differential equations
Variational Principles in Curve Design
Multi-level Monte Carlo algorithms for infinite-dimensional integration on R N
On the distance to the zero set of a homogeneous polynomial
On the Complexity of Approximating Extremal Determinants in Matrices
Computing zeta functions of large polynomial systems over finite fields
The Fast Generalized Parker-Traub Algorithm for Inversion of Vandermonde and Related Matrices
Complexity of approximating Hölder classes from information with varying Gaussian noise
Randomized complexity of parametric integration and the role of adaption II. Sobolev spaces
Average n -Widths of the Wiener Space in the L infinity -Norm
Exponential convergence of adaptive quarklet approximation
Finding a Cluster of Zeros of Univariate Polynomials
An optimal recovery view of Walsh's equiconvergence theorem
Weaker convergence criteria for Traub's method
Optimization approaches to quadrature: New characterizations of Gaussian quadrature on the line and quadrature with few nodes on plane algebraic curves, on the plane and in higher dimensions
Probabilistic analysis of a differential equation for linear programming
2003 Information-Based Complexity Prize Committee
s -Numbers in information-based complexity
Probabilistic complexity analysis for linear problems in bounded domains
On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property
The Real Dimension Problem Is NPR-Complete
General convergence theorems for iterative processes and applications to the Weierstrass root-finding method
A deterministic algorithm for inverting a polynomial matrix
Recovery of derivatives for functions defined on the semiaxis
Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
Shu Tezuka, Joos Heintz, Bart Kuijpers, and Andrés Rojas Paredes Share the 2013 Best Paper Award
Tractability of linear problems defined over Hilbert spaces
Effectively open real functions
On regularized polynomial functional regression
Improved Error Bounds for Lattice Rules
Bounds for discrepancies in the Hamming space
Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
On recovering the Radon-Nikodym derivative under the big data assumption
Thomas Jahn, Tino Ullrich and Felix Voigtlaender are the Winners of the 2023 Best Paper Award of the Journal of Complexity
Computing over the Reals with Addition and Order: Higher Complexity Classes
Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: The relation to the L 2 -approximation
Learning from Hints
Local quadrature formulas on the sphere
On positive positive-definite functions and Bochner's Theorem
On the weakening of the convergence of Newton's method using recurrent functions
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Support Vector Machines are Universally Consistent
The smoothing effect of the ANOVA decomposition
Essentially optimal computation of the inverse of generic polynomial matrices
Uniqueness of the singular points of vector fields on Riemannian manifolds under the gamma -condition
Fast multivariate multi-point evaluation revisited
On a class of linear regression methods
Heuristic approaches to obtain low-discrepancy point sets via subset selection
Approximation in periodic Gevrey spaces
Quasi-regression
Łojasiewicz inequalities with explicit exponents for smallest singular value functions
Five- and six-dimensional lattice rules generated by structured matrices
Novel results for the anisotropic sparse grid quadrature
Noisy Chinese remaindering in the Lee norm
Complexity of Local Solution of Multivariate Integral Equations
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award
Error bounds for the integration of singular functions using equidistributed sequences
Decision Problems in Quadratic Function Fields of High Genus
Almost optimal solution of initial-value problems by randomized and quantum algorithms
Hyperbolic cross approximation in infinite dimensions
The exact information-based complexity of smooth convex minimization
On the tractability of linear tensor product problems in the worst case
On the information complexity for integration in subspaces of the Wiener algebra
Oracle inequalities for support vector machines that are based on random entropy numbers
Quantum approximation I. Embeddings of finite-dimensional L p spaces
On average case errors in numerical analysis
The randomized complexity of indefinite integration
Amortized multi-point evaluation of multivariate polynomials
An overlapping additive Schwarz preconditioner for interpolation on the unit sphere with spherical radial basis functions
On the power generator and its multivariate analogue
Sampling numbers of smoothness classes via ℓ 1 -minimization
On lower bounds for the L 2 -discrepancy
A lower bound for the topological complexity of poly( D, n )
Dynamics and architecture for neural computation
Discrepancy based model selection in statistical inverse problems
Discontinuity Detection and Thresholding-A Stochastic Approach
Complexity of oscillatory integration for univariate Sobolev spaces
Complexity Estimates for Representations of Schmu"dgen Type
On the Kolmogorov complexity of functions of finite smoothness
A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem
On the L 2 -Discrepancy for Anchored Boxes
Borell's inequality and mean width of random polytopes via discrete inequalities
Preasymptotics and asymptotics of approximation numbers of anisotropic Sobolev embeddings
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness
On the discrepancy of generalized Niederreiter sequences
Convergence analysis of iteratively regularized Landweber iteration with uniformly convex constraints in Banach spaces
Data structures and algorithms for approximate string matching
New general convergence theory for iterative processes and its applications to Newton-Kantorovich type theorems
Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements
On the evaluation of the Eigenvalues of a banded toeplitz block matrix
Statistical complexity of the power method for markov chains
An optimization of Chebyshev's method
On explicit order 1.5 approximations with varying coefficients: The case of super-linear diffusion coefficients
Asymptotic error of algorithms for solving nonlinear problems
On the Expected Number of Shadow Vertices of the Convex Hull of Random Points
Optimal learning rates for distribution regression
Weighted approximation by entire functions interpolating at finitely or infinitely many points on the real line
On the optimality of the trigonometric system
Randomized approximation of Sobolev embeddings, II
Bounds for the sampling discretization error and their applications to the universal sampling discretization
Minimal dispersion on the cube and the torus
Monte Carlo Complexity of Global Solution of Integral Equations
On the power of two-point based sampling
On the existence of generally convergent algorithms
Adaptive parameter choice for one-sided finite difference schemes and its application in diabetes technology
Approximating a function by choosing a covering of its domain and ? points from its range
Information-based complexity young researcher award
There Exists a Linear Problem with Infinite Combinatory Complexity
A topological view on algebraic computation models
Asymptotic error for the global maximum of functions in s dimensions
Complexity of Finding Irreducible Components of a Semialgebraic Set
Instances of computational optimal recovery: Refined approximability models
Characterizing Valiant's algebraic complexity classes
Analysis of regularized least squares for functional linear regression model
Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration
Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands
Normal Boolean functions
Adaptive Huber trace regression with low-rank matrix parameter via nonconvex regularization
The covering number for some Mercer kernel Hilbert spaces
A note on tractability of multivariate analytic problems
Embeddings for infinite-dimensional integration and L2-approximation with increasing smoothness
Partial Fraction Decomposition in (z) and Simultaneous Newton Iteration for Factorization in C[z]
The parallel complexity of function approximation
Best and random approximation of a convex body by a polytope
Complexity Theory for Lie-Group Solvers
A note on isotropic discrepancy and spectral test of lattice point sets
Solvable integration problems and optimal sample size selection
On the average case solvability of III-posed problems
A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications
Lower bound for the number of nodes of cubature formulae on the unit ball
Interpolation lattices for hyperbolic cross trigonometric polynomials
Uniform recovery of high-dimensional Cr-functions
Special issue on cryptography and coding theory
The BMO-discrepancy suffers from the curse of dimensionality
Consistency of randomized integration methods
On the approximate calculation of multiple integrals
Skewness of a randomized quasi-Monte Carlo estimate
Tractability using periodized generalized Faure sequences
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness
Minimal dispersion of large volume boxes in the cube
Quasi-Monte Carlo and ε-truncation dimension in ANOVA spaces
Approximation complexity of additive random fields
On the construction of optimal cubature formulae which use integrals over hyperspheres
2005 Information-Based Complexity Young Researcher Award Committee
On the Parallel Complexity of the Polynomial Ideal Membership Problem
Winners of the 2016 Best Paper Award
A new simple homotopy algorithm for linear programming I
Optimal randomized quadrature for weighted Sobolev and Besov classes with the Jacobi weight on the ball
Analytic reparametrization of semi-algebraic sets
Best Paper Award
Complexity of linear ill-posed problems in Hilbert space
On the oracle complexity of smooth strongly convex minimization
On Numerical Solution of Poincaré Problem for Oceanic Circulations
The Exponent of Discrepancy Is at Least 1.0669
New Prize for Achievement in Information-Based Complexity
Weighted sampling recovery of functions with mixed smoothness
Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
Linear algorithms for recovering linear functionals from jittered information
Exponential convergence-tractability of general linear problems in the average case setting
Sampling and entropy numbers in the uniform norm
Topological complexity of a root finding algorithm
A component-by-component approach to efficient numerical integration over products of spheres
An Analog Characterization of the Grzegorczyk Hierarchy
Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
L ∞ -Approximation in Korobov spaces with exponential weights
Product Gauss quadrature rules vs. cubature rules in the meshless local Petrov-Galerkin method
Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
Some theoretical aspects of generalised quadrature methods
Numerical properties of generalized discrepancies on spheres of arbitrary dimension
On the optimal solution of large eigenpair problems
ε-superposition and truncation dimensions in average and probabilistic settings for ∞-variate linear problems
On the linear complexity profile of some new explicit inversive pseudorandom numbers
Computing Discrepancies of Smolyak Quadrature Rules
Finding a longest common subsequence between a run-length-encoded string and an uncompressed string
On the Complexity of Self-Validating Numerical Integration and Approximation of Functions with Singularities
Complexity of functions: Some questions, conjectures, and results
Linear complexity of binary generalized cyclotomic sequences over GF(q)
The minimal radius of Galerkin information for the problem of numerical differentiation
Fast Lagrange-Newton transformations
Polynomial-time algorithms for generation of prime implicants
On tractability of linear tensor product problems for ∞ ∞-variate classes of functions
Takashi Goda is the winner of the 2025 Joseph F. Traub Prize for Achievement in Information-Based Complexity
Achieving the Ergodically Optimal Convergence Rate for a One-Dimensional Minimization Problem
Improved dispersion bounds for modified Fibonacci lattices
Function values are enough for L 2 -approximation: Part II
The area of empty axis-parallel boxes amidst 2-dimensional lattice points
The Gelfand widths of l p -balls for 0p<=1
Some Complexity Results for Zero Finding for Univariate Functions
Learning rates for regularized classifiers using multivariate polynomial kernels
On the complexity of a unified convergence analysis for iterative methods
Algorithmic analysis of irrational rotations in a single neuron model
Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
On the number of multiplications needed to invert a monic power series over fields of characteristic two
Uniform Distribution, Discrepancy, and Reproducing Kernel Hilbert Spaces
EC-(s, t)-weak tractability of multivariate linear problems in the average case setting
Optimal sampling points in reproducing kernel Hilbert spaces
What Is the Complexity of Volume Calculation?
Weakly Computable Real Numbers
On lower bounds for integration of multivariate permutation-invariant functions
How anisotropic mixed smoothness affects the decay of singular numbers for Sobolev embeddings
Random problems
On integration methods based on scrambled nets of arbitrary size
Smale's point estimate theory for Newton's method on Lie groups
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality
A clock synchronization problem with random delays
Random non-cupping revisited
Numerical weighted integration of functions having mixed smoothness
Quantum integration in Sobolev classes
Deep learning from strongly mixing observations: Sparse-penalized regularization and minimax optimality
On the worst-case error of least squares algorithms for L2-approximation with high probability
Complexity of integer quasiconvex polynomial optimization
Lifting and recombination techniques for absolute factorization
On Viterbi-like algorithms and their application to Reed-Muller codes
Complexity for a class of elliptic ordinary integro-differential equations
Mixed settings for linear problems
Dagstuhl Invited Papers
A note on the CBC-DBD construction of lattice rules with general positive weights
Counting Affine Roots of Polynomial Systems via Pointed Newton Polytopes
Quantum lower bounds by entropy numbers
Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information
On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree
On the power of neural networks for solving hard problems
Sampling numbers and function spaces
Online regularized learning algorithm for functional data
A short biography of Harald Niederreiter
P != NC over the p-adic numbers
On the approximation of smooth functions using generalized digital nets
Convergence rates of support vector machines regression for functional data
Spatially adaptive sparse grids for high-dimensional data-driven problems
Covering numbers, Vapnik-ervonenkis classes and bounds for the star-discrepancy
On the complexity of Schmu"dgen's Positivstellensatz
Tensor-product approximation to operators and functions in high dimensions
Polynomial differential equations compute all real computable functions on computable compact intervals
On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints
2001 Best Paper Award
On the (non)-existence of some cubature formulas: gaps between a theory and its applications
Hardness of discrepancy computation and ε-net verification in high dimension
Some Complexity Results for Polynomial Ideals
CBS constants for multilevel splitting of graph-Laplacian and application to preconditioning of discontinuous Galerkin systems
Complexity of approximation with relative error criterion in worst, average, and probabilistic settings
The geometry of III-conditioning
Verifying Topological Indices for Higher-Order Rank Deficiencies
On the complexity of the multivariate Sturm-Liouville eigenvalue problem
A Note on Testing the Resultant
Optimal recovery and generalized Carlson inequality for weights with symmetry properties
Convergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifolds
The communication complexity of several problems in matrix computation
Computing with polynomial ordinary differential equations
Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data
Asymptotic Behavior of Automatic Quadrature
Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions
Monte-Carlo algorithms for the planar multiterminal network reliability problem
Solving bivariate systems using Rational Univariate Representations
Witnesses for Boolean Matrix Multiplication and for Transitive Closure
Approximation of analytic functions in Korobov spaces
Recovering Linear Operators from Inaccurate Data
Worst Case Complexity of Problems with Random Information Noise
Monte Carlo approximation of weakly singular integral operators
Numerical study of pressure distribution in entrance pipe flow
A Note on the Complexity of Solving Poisson's Equation for Spaces of Bounded Mixed Derivatives
On the cardinality of lower sets and universal discretization
On multiplication in finite fields
Marcinkiewicz-Zygmund measures on manifolds
A Note on Varying Cardinality in the Average Case Setting
Exact cubature for a class of functions of maximum effective dimension
Jonathan Siegel is the winner of the 2025 Joseph F. Traub Information-Based Complexity Young Researcher Award
Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
On the decomposition of an NFSR into the cascade connection of an NFSR into an LFSR
The use of higher order finite difference schemes is not dangerous
A metric result for special sequences related to the Halton sequences
Some Speed-Ups and Speed Limits for Real Algebraic Geometry
A note on a theorem of Blum, Shub, and Smale
On the Secant method
(s, t)-weak tractability of Euler and Wiener integrated processes
Effective differential Nullstellensatz for ordinary DAE systems with constant coefficients
Do numerical orbits of chaotic dynamical processes represent true orbits?
2017 Joseph F. Traub Prize for Achievement in Information-Based Complexity
Simple Monte Carlo and the Metropolis algorithm
On the complexity of loading shallow neural networks
Central limit theorems for multilevel Monte Carlo methods
On a problem in quantum summation
Disintegration of Gaussian measures and average-case optimal algorithms
On Boundary Value Problems for the Hyperbolic Case
Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics
Improved upper bounds on the star discrepancy of ( t , m , s )-nets and ( t , s )-sequences
Computational Complexity over thep-adic Numbers
Notes on lattice rules
Tractability and Strong Tractability of Linear Multivariate Problems
On the delta->0 Limit in Probabilistic Complexity
Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness
Tractability of approximation of ∞-variate functions with bounded mixed partial derivatives
1999 Prize for Achievement in Information-Based Complexity
Some s-numbers of embeddings in function spaces with polynomial weights
Editor's Foreword: Dagstuhl Invited Papers
Where Does Smoothness Count the Most for Two-Point Boundary-Value Problems?
Delayed Curse of Dimension for Gaussian Integration
The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data
Asymptotic analysis in multivariate worst case approximation with Gaussian kernels
On the Kolmogorov Complexity of Arbitrary Objects
On the convergence of newton's method
Ismagilov Type Theorems for Linear, Gel?fand and Bernstein n -Widths
On the robustness of regularized pairwise learning methods based on kernels
Integration error for multivariate functions from anisotropic classes
The randomized information complexity of elliptic PDE
In memory of Nikolai Sergeevich Bakhvalov (1934-2005)
Computational complexity of tissue-like P systems
On the complexity of the bondage and reinforcement problems
Complexity of approximately solved problems
Optimal recovery of isotropic classes of twice-differentiable multivariate functions
On the power of standard information for tractability for L ∞ approximation of periodic functions in the worst case setting
Lyapunov Exponents versus Expansivity and Sensitivity in Cellular Automata
On tractability of approximation in special function spaces