yusuke1997/dblp-id-title huggingface dataset:
Hammersley point sets and inverse of star-discrepancy
Dynamics of a higher-order family of iterative methods
Universal discretization
Festschrift for Joseph F. Traub
A Theory of Complexity for Continuous Time Systems
Integral operators generated by multi-scale kernels
Trade-offs between Communication Throughput and Parallel Time
Topological Complexity of Zero Finding with Algebraic Operations
Local adaption for approximation and minimization of univariate functions
Polynomial function and derivative approximation of Sinc data
Announcement: Best Paper Award
On the necessity of low-effective dimension
Our Silver Anniversary
Complexity of Integral Equations and Relations to s-Numbers
The Minimal Cost of Approximating Linear Operators Using Perturbed Information-The Asymptotic Setting
Average sampling and space-frequency localized frames on bounded domains
Optimal importance sampling for the approximation of integrals
Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach
Error linear complexity measures for multisequences
On the Isomorphism of Fractional Factorial Designs
2002 Best Paper Award Committee
A remark on the numerical integration of harmonic functions in the plane
Are unbounded linear operators computable on the average for Gaussian measures?
Kantorovich's Theorem on Newton's Method in Riemannian Manifolds
Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award
Approximate Zeros and Condition Numbers
Hilbert's Nullstellensatz Is in the Polynomial Hierarchy
The covering number in learning theory
On adaptive information with varying cardinality for linear problems with elliptically contoured measures
Average case (s, t)-weak tractability of non-homogeneous tensor product problems
Extremal distributions of discrepancy functions
An encyclopaedia of cubature formulas
Sampling discretization and related problems
Intractability Results for Integration and Discrepancy
Algorithms and complexity for functions on general domains
Dmitriy Bilyk and Feng Dai are the winners of the 2023 Joseph F. Traub Prize for Achievement in Information-Based Complexity
A condition-based algorithm for solving polyhedral feasibility problems
A note on the existence of sequences with small star discrepancy
The Real Number Model in Numerical Analysis
Distributional properties of d -FCSR sequences
PREFACE: Festschrift for Zvi Galil
On the packing functions of some linear sets of Lebesgue measure zero
Gaussian polytopes: A cumulant-based approach
On the complexity of parabolic initial-value problems with variable drift
Changes to the Editorial Board
Quantum Summation with an Application to Integration
Constructions of normal numbers with infinite digit sets
Tractability for Volterra problems of the second kind with convolution kernels
Deterministic multi-level algorithms for infinite-dimensional integration on R N
New Brownian bridge construction in quasi-Monte Carlo methods for computational finance
A Gröbner Free Alternative for Polynomial System Solving
An explicit solution to Post's Problem over the reals
Statistical complexity of dominant eigenvector calculation
Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case
Online outcome weighted learning with general loss functions
Ideals in constructive Banach algebra theory
Fast Rectangular Matrix Multiplication and Applications
Generalized adaptive versus nonadaptive recovery from noisy information
Dmitriy Bilyk, Lutz Kämmerer, Stefan Kunis, Daniel Potts, Volodya Temlyakov and Rui Yu share the 2012 Best Paper Award
Enhancing the applicability of Chebyshev-like method
Barnsley's scheme for the fractal encoding of images
Nonlinear tensor product approximation of functions
Free-knot spline approximation of stochastic processes
ANNOUNCEMENT: 2001 Best Paper Award Committee
Online gradient descent algorithms for functional data learning
Function approximation with zonal function networks with activation functions analogous to the rectified linear unit functions
Announcement: Best Paper Award Committee 1999
Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
A revisit on Nesterov acceleration for linear ill-posed problems
Semi-algebraic Complexity of Quotients and Sign Determination of Remainders
On the complexity of computing quadrature formulas for marginal distributions of SDEs
On the existence of optimal affine methods for approximating linear functionals
On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation
Information-Based Complexity and Nonparametric Worst-Case System Identification
Lower bounds for the complexity of linear functionals in the randomized setting
Average Widths of W r H omega in C(R)
Average Saving Effects in Enumerative Methods for Solving Knapsack Problems
Stably Ergodic Dynamical Systems and Partial Hyperbolicity
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
On the asymptotic behavior of the projective rescaling algorithm for linear programming
Regularized reduced-rank regression for structured output prediction
Influence of the regularity of the test functions for weak convergence in numerical discretization of SPDEs
Analog computers and recursive functions over the reals
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
Simple characterizations of exponential tractability for linear multivariate problems
Solving linear programs with finite precision: II. Algorithms
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
Deterministic constructions of compressed sensing matrices
A numerical algorithm for zero counting, I: Complexity and accuracy
Optimal complexity recovery of band- and energy-limited signals
A note on equivalence of anchored and ANOVA spaces; lower bounds
Regularized collocation method for Fredholm integral equations of the first kind
Discretization effects in statistical inverse problems
On oracle factoring of integers
Use of algebraically independent numbers for zero recognition of polynomial terms
Approximation in a continuous model of computing
Oblivious keyword search
The asymptotic normalized linear complexity of multisequences
Simplified Lower Bounds for Polynomials with Algebraic Coefficients
Sharp asymptotics of the metric entropy for ellipsoids
On the Representation of Band Limited Functions Using Finitely Many Bits
Average case complexity of linear multivariate problems II. Applications
A Multi-step Algorithm for Hankel Matrices
David Krieg is the winner of the 2024 Joseph F. Traub Prize for Achievement in Information-Based Complexity
A quasi-Monte Carlo data compression algorithm for machine learning
Two P -complete problems in the theory of the reals
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density
A path integral approach to data structure evolution
Information Complexity of Multivariate Fredholm Integral Equations in Sobolev Classes
B-spline quasi-interpolant representations and sampling recovery of functions with mixed smoothness
A new semilocal convergence theorem for the Weierstrass method for finding zeros of a polynomial simultaneously
Interpolation by decomposable univariate polynomials
Functional linear regression with Huber loss
A role of lower semicontinuous functions in the combinatorial complexity of geometric problems
Fast CBC construction of randomly shifted lattice rules achieving O(n -1+δ ) convergence for unbounded integrands over R 5 in weighted spaces with POD weights
Super-polynomial convergence and tractability of multivariate integration for infinitely times differentiable functions
Weaker conditions for the convergence of Newton's method
Matrix and tensor rigidity and L p -approximation
A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
An algebraic proof of the real number PCP theorem
Probabilistic diophantine approximation and the distribution of Halton-Kronecker sequences
Integration and Approximation Based on Scramble Sampling in Arbitrary Dimensions
The effective dimension and quasi-Monte Carlo integration
Integral operators on the sphere generated by positive definite smooth kernels
Parallel information-based complexity
Tensor power sequences and the approximation of tensor product operators
Tamed-adaptive Euler-Maruyama approximation for SDEs with superlinearly growing and piecewise continuous drift, superlinearly growing and locally Hölder continuous diffusion
Systems of rational polynomial equations have polynomial size approximate zeros on the average
Estimates for Piecewise Quadric Approximations of Implicitly Defined Manifolds
On adaptive and nonadaptive stochastic and deterministic algorithms
Quasi-Monte Carlo Simulation of Diffusion
On the number of minima of a random polynomial
A continuous characterization of PSPACE using polynomial ordinary differential equations
Information based complexity for high dimensional sparse functions
A high-efficiency fourth-order iterative method for nonlinear equations: Convergence and computational gains
Real recursive functions and their hierarchy
On embeddings of weighted tensor product Hilbert spaces
Approximation by neural networks and learning theory
ANNOUNCEMENT: 2000 Best Paper Award
Prize for Achievement in Information-Based Complexity
Binary Segmentation for Multivariate Polynomials
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
A stochastic analog to Chebyshev centers and optimal average case algorithms
Nominations for 2022 Joseph F. Traub Information-Based Complexity Young Researcher Award
Optimal cubature in Besov spaces with dominating mixed smoothness on the unit square
Approximate Pythagoras numbers on ⁎-algebras over C
Linear implicit approximations of invariant measures of semi-linear SDEs with non-globally Lipschitz coefficients
A hierarchy of Turing degrees of divergence bounded computable real numbers
The Price of Pessimism for Multidimensional Quadrature
When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals?
Computational Complexity of Fixed Points and Intersection Points
Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights
Time-Space Tradeoffs in Algebraic Complexity Theory
sigma-Perfect splines and their application to optimal recovery problems
Optimal Approximation on Sd
Randomness and universal machines
Approximation of additive random fields based on standard information: Average case and probabilistic settings
A Note on Non-complete Problems in NPImage
Modular composition via factorization
Linear vs Standard Information for Scalar Stochastic Differential Equations
Efficient Monte Carlo simulation for integral functionals of Brownian motion
A simplified iteratively regularized projection method for nonlinear ill-posed problems
P=NP for some structures over the binary words
On blocked resolution IV designs containing clear two-factor interactions
Algorithmic and complexity issues of robot motion in an uncertain environment
Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
Complexities of Winning Strategies in Diophantine Games
Weyl and Bernstein numbers of embeddings of Sobolev spaces with dominating mixed smoothness
Stolarsky's invariance principle for projective spaces
Tractability of linear ill-posed problems in Hilbert space
Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
On weighted Hilbert spaces and integration of functions of infinitely many variables
A new characterization of (s, t)-weak tractability
Weighted quadrature formulas and approximation by zonal function networks on the sphere
Relaxation of Product Markov Chains on Product Spaces
Deadlock avoidance for systolic communication
Average complexity for linear operators over bounded domains
Tractability of Tensor Product Linear Operators
Generalized polar varieties: geometry and algorithms
David Krieg is the winner of the 2020 Joseph F. Traub Information-Based Complexity Young Researcher Award
Constructing good higher order polynomial lattice rules with modulus of reduced degree
On non-polynomial lower error bounds for adaptive strong approximation of SDEs
Random approximation of Sobolev embeddings
Calculation of the Quality Parameter of Digital Nets and Application to Their Construction
A softly optimal Monte Carlo algorithm for solving bivariate polynomial systems over the integers
Bin packing with divisible item sizes
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
On Huber's contaminated model
On Optimization of Direct Methods of Solving Weakly Singular Integral Equations
On optimality of Krylov's information when solving linear operator equations
Mixed-level column augmented uniform designs
Approximation of high-dimensional kernel matrices by multilevel circulant matrices
On optimal algorithms for problems defined on groups
Fibonacci sets and symmetrization in discrepancy theory
Quantum Complexity of Integration
Entropy numbers of convex hulls in Banach spaces and applications
The Microstructure of ( t, m, s )-Nets
A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
Optimal recovery of linear operators from information of random functions
Mixture discrepancy for quasi-random point sets
Liberating the dimension
Smoothed analysis of kappa(A)
Weighted Tensor Product Algorithms for Linear Multivariate Problems
An Alternating-Direction Sinc-Galerkin method for elliptic problems
Accelerated convergence of error quantiles using robust randomized quasi Monte Carlo methods
The maximum rate of convergence for the approximation of the fractional Lévy area at a single point
On the linear complexity for multidimensional sequences
Estimating the ground state energy of the Schrödinger equation for convex potentials
An elementary proof of a lower bound for the inverse of the star discrepancy
On zero finding methods of higher order from data at one point
Effective continuities on effective topological spaces
Weak-norm posterior contraction rate of the 4DVAR method for linear severely ill-posed problems
Homogeneous algorithms and solvable problems on cones
Bernd Carl, Aicke Hinrichs, and Philipp Rudolph share the 2014 Best Paper Award
Journal of Complexity Best Paper Award
Newtonian graphs for families of complex polynomials
Thomas Müller-Gronbach, Klaus Ritter and Larisa Yaroslavtseva share the 2015 Best Paper Award
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
Short Proofs Using Compact Representations of Algebraic Integers
On the structure of digital explicit nonlinear and inversive pseudorandom number generators
2002 Prize for Achievement in Information-Based Complexity
Quasi-polynomial tractability of linear problems in the average case setting
On the star discrepancy of sequences in the unit interval
Complexity of parametric initial value problems in Banach spaces
The Jackson inequality and widths of function classes in L 2 ([0, 1], x 2v+1 )
A note on parallel and alternating time
Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
On expansion of algebraic functions in power and Puiseux series, II
Robust pairwise learning with Huber loss
Shape from Shadows: A Hilbert Space Setting
Quasi-GCD computations
Announcement: IBC award 2022 and the nomination deadline 2023
Sampling schemes and recovery algorithms for functions of few coordinate variables
Dense computability structures
Deterministic computation of the characteristic polynomial in the time of matrix multiplication
On solving univariate sparse polynomials in logarithmic time
On lower complexity bounds for large-scale smooth convex optimization
Optimal recovery of integral operators and its applications
Asymptotic behavior of average L p -discrepancies
The existence of good extensible rank-1 lattices
On the Power of Adaption
Metropolis, Simulated Annealing, and Iterated Energy Transformation Algorithms: Theory and Experiments
On the complexity of extending the convergence ball of Wang's method for finding a zero of a derivative
Average Case Complexity of Multivariate Integration and Function Approximation: An Overview
Mario Ullrich Wins the 2015 Joseph F. Traub Information-Based Complexity Young Researcher Award
Widths of embeddings in function spaces
Topological Complexity with Continuous Operations
The Infinite-Dimensional Widths and Optimal Recovery of Generalized Besov Classes
Lower bounds for wrap-around L 2 -discrepancy and constructions of symmetrical uniform designs
On the Petras algorithm for verified integration of piecewise analytic functions
Optimal precision in the presence of uncertainty
Complexity of verification and computation for IBC problems
Brakhage's Implicit Iteration Method and the Information Complexity of Equations with Operators Having Closed Range
Rademacher learning rates for iterated random functions
On the Davenport-Mahler bound
An upper bound on the minimal dispersion
Approximation of piecewise Hölder functions from inexact information
Two- and three-level lower bounds for mixture L 2 -discrepancy and construction of uniform designs by threshold accepting
On the global error of Itô-Taylor schemes for strong approximation of scalar stochastic differential equations
Complexity of the derivative-free solution of systems of IVPs with unknown singularity hypersurface
Real Number Models under Various Sets of Operations
A note on the complexity and tractability of the heat equation
A variant of Atanassov's method for (t, s)-sequences and (t, e, s)-sequences
Discrete allocation mechanisms: Dimensional requirements for resource-allocation mechanisms when desired outcomes are unbounded
Modeling Optimal Effective Bandwidth of Page-Mode Memory for Stream-Oriented Computations
The rate of convergence for sparse and low-rank quantile trace regression
Mario Hefter Wins the 2016 Joseph F. Traub Information-Based Complexity Young Researcher Award
New Members of the Editorial Board
Optimization of Active Algorithms for Recovery of Monotonic Functions from Hölder's Class
On polynomial-time property for a class of randomized quadratures
How to minimize the cost of iterative methods in the presence of perturbations
The Complexity of Indefinite Elliptic Problems with Noisy Data
Construction of uniform designs via an adjusted threshold accepting algorithm
Optimal linear randomized methods for linear operators in Hilbert spaces
Level permutation method for constructing uniform designs under the wrap-around L 2 -discrepancy
Highly nonlinear mappings
Announcement: 2001 Prize for Achievement in Information-Based Complexity
On the distance to the zero-set of a polynomial
Approximation and optimization on the Wiener space
Condition numbers of random matrices
Discrepancy with respect to convex polygons
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices
EC-( t 1 , t 2 )-tractability of approximation in weighted Korobov spaces in the worst case setting
A lower bound for the discrepancy of a random point set
Randomly shifted lattice rules for unbounded integrands
The radii of sections of origin-symmetric convex bodies and their applications
On the complexity of the multiplication of matrices of small formats
Linear recurrences with polynomial coefficients
A robust Kantorovich's theorem on the inexact Newton method with relative residual error tolerance
About Widths of Wiener Space in the L q -Norm
Wavelet para-bases and sampling numbers in function spaces on domains
Estimates for the entropy numbers of embedding operators of function spaces on sets with tree-like structure: Some limiting cases
An unfeasibility view of neural network learning
On Randomized Semi-algebraic Test Complexity
Direct Estimation of Linear Functionals from Indirect Noisy Observations
In Memory of Joseph F. Traub (1932-2015)
Structuring causal trees
The randomized complexity of initial value problems
Explicit error bounds for lazy reversible Markov chain Monte Carlo
Complexity Estimates for the Schmu"dgen Positivstellensatz
Noisy information for linear problems in the asymptotic setting
Some personal things about Joseph Traub
Low-energy points on the sphere and the real projective plane
Probabilistic satisfiability
Kolmogorov Width of Classes of Smooth Functions on the Sphere S d-1
n -Widths, Faber Expansion, and Computation of Analytic Functions
The expectation and variance of the joint linear complexity of random periodic multisequences
On the complexity of Putinar-Vasilescu's Positivstellensatz
A note on the trade-off between sampling and quantization in signal processing
Uniform weak tractability
Lower bounds for integration and recovery in L 2
Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements
On the linear independence of shifted powers
Liberating the dimension for function approximation: Standard information
Liberating the dimension for L 2 -approximation
On the optimality of Krylov information
Derandomization of the Euler scheme for scalar stochastic differential equations
Complexity and effective dimension of discrete Lévy areas
Quasi-Monte Carlo algorithms for unbounded, weighted integration problems
The Complexity of Multivariate Elliptic Problems with Analytic Data
The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
2005 Best Paper Award Committee
Optimal algorithms: Tools for mathematical modeling
The Optimal Discretization of Stochastic Differential Equations
Energy and discrepancy of rotationally invariant determinantal point processes in high dimensional spheres
Fast multiplication of a recursive block Toeplitz matrix by a vector and its application
On optimal recovery in L2
Kronecker's and Newton's Approaches to Solving: A First Comparison
Ultrastability of n th minimal errors
Tractability results for the weighted star-discrepancy
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples
Points on manifolds with asymptotically optimal covering radius
On upper and lower bounds for pathwise approximation of scalar SDEs with reflection
Optimal residual algorithms for linear operator equations
The Fine Structure of the n -Widths of H p -Spaces in L q (-1, 1)
Average case tractability of non-homogeneous tensor product problems
An intrinsic homotopy for intersecting algebraic varieties
Estimates of efficiency for two methods of stable numerical summation of smooth functions
On the randomized solution of initial value problems
Vector greedy algorithms
Complexity of certain nonlinear two-point BVPs with Neumann boundary conditions
Average dimension and ?-widths of classes of functions on the whole line
On the dispersion of sparse grids
VLSI-sorting evaluated under the linear model
Discretized Tikhonov-Phillips regularization for a naturally linearized parameter identification problem
Stochastic perturbations and smooth condition numbers
A generative model for fBm with deep ReLU neural networks
Approximation of linear functionals on a banach space with a Gaussian measure
Weighted discrepancy and numerical integration in function spaces
Lower error bounds for the stochastic gradient descent optimization algorithm: Sharp convergence rates for slowly and fast decaying learning rates
Equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in L p
Two-step Newton methods
The curse of dimensionality for numerical integration of smooth functions II
Complexity of differential and integral equations
Center conditions on high order derivatives in the semilocal convergence of Newton's method
Guest editors' preface: Issue dedicated to Professor Frank Stenger
Searching for extensible Korobov rules
Quasi-polynomial tractability
Complexity of parametric integration in various smoothness classes
Tractability of Integration in Non-periodic and Periodic Weighted Tensor Product Hilbert Spaces