Title	Publication Date	Language	Citations
Editorial Board	2018/04/01	English
Asymptotically tight worst case complexity bounds for initial-value problems with nonadaptive information	2018/08/01	English
On the Petras algorithm for verified integration of piecewise analytic functions	2017/04/01	English
Editorial Board	2016/12/01	English
Editorial Board (continued)	2016/12/01	English
Dmitriy Bilyk and Feng Dai are the winners of the 2023 Joseph F. Traub Prize for Achievement in Information-Based Complexity	2023/08/01	English
Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data		English
A duality approach to regularized learning problems in Banach spaces	2024/04/01	English
Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient	2024/04/01	English
Tamed-adaptive Euler-Maruyama approximation for SDEs with superlinearly growing and piecewise continuous drift, superlinearly growing and locally Hölder continuous diffusion		English
High-order lifting for polynomial Sylvester matrices	2024/02/01	English
Editorial Board	2024/02/01	English
Optimal recovery and generalized Carlson inequality for weights with symmetry properties	2024/04/01	English
Linear Monte Carlo quadrature with optimal confidence intervals		English
Homogeneous algorithms and solvable problems on cones		English
Linear implicit approximations of invariant measures of semi-linear SDEs with non-globally Lipschitz coefficients		English
Heuristic approaches to obtain low-discrepancy point sets via subset selection		English
Editorial Board		English
Nonasymptotic analysis of robust regression with modified Huber's loss	2023/06/01	English
On Huber's contaminated model	2023/08/01	English
Worst case tractability of linear problems in the presence of noise: Linear information	2023/12/01	English
Information-based complexity young researcher award	2023/04/01	English
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	2023/04/01	English
Best Paper Award of the Journal of Complexity	2023/04/01	English
Editorial Board	2023/04/01	English
Enhancing the applicability of Chebyshev-like method		English
A unified treatment of tractability for approximation problems defined on Hilbert spaces		English
David Krieg is the winner of the 2024 Joseph F. Traub Prize for Achievement in Information-Based Complexity		English
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy		English
Editorial Board	2023/12/01	English