OOIR: Observatory of International Research

Papers

(The median citation count of Journal of Complexity is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-11-01 to 2025-11-01.)

Article	Citations
On the approximation of vector-valued functions by volume sampling	37
A continuous characterization of PSPACE using polynomial ordinary differential equations	28
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems	23
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities	22
Optimal recovery and volume estimates	20
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples	20
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits	19
Central Limit Theorem for (t,s)-sequences in base 2	17
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	16
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time	15
A simplified iteratively regularized projection method for nonlinear ill-posed problems	14
On regularized polynomial functional regression	13
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	11
Approximation in periodic Gevrey spaces	11
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	9
On the expected number of real roots of polynomials and exponential sums	8
Editorial Board	8
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	8
A duality approach to regularized learning problems in Banach spaces	7
Online regularized learning algorithm for functional data	7
On the complexity of orbit word problems	7
Computing zeta functions of large polynomial systems over finite fields	6
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy	6
An unfeasibility view of neural network learning	6
Direct estimates for adaptive time-stepping finite element methods	6

Editorial Board	6
Editorial Board	6
Approximate equality for two sums of roots	6
On the computation of rational solutions of underdetermined systems over a finite field	6
On negative dependence properties of Latin hypercube samples and scrambled nets	5
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality	5
Editorial Board	5
Optimal recovery and generalized Carlson inequality for weights with symmetry properties	5
Online outcome weighted learning with general loss functions	5
On the cardinality of lower sets and universal discretization	5
Skewness of a randomized quasi-Monte Carlo estimate	5
Editorial Board	5
On the complexity of a unified convergence analysis for iterative methods	5
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations	5
Countable tensor products of Hermite spaces and spaces of Gaussian kernels	4
The area of empty axis-parallel boxes amidst 2-dimensional lattice points	4
Editorial Board	4
Complexity for a class of elliptic ordinary integro-differential equations	4
On the power of standard information for tractability for L2-approximation in the average case setting	4
Approximation by quasi-interpolation operators and Smolyak's algorithm	4
Lower bounds for integration and recovery in L2	4
Takashi Goda is the winner of the 2025 Joseph F. Traub Prize for Achievement in Information-Based Complexity	4
Editorial Board	4
Optimal pointwise sampling for L2 approximation	4
On oracle factoring of integers	4
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness	4
A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class	4
Best Paper Award of the Journal of Complexity	4
Homogeneous algorithms and solvable problems on cones	3
Selected aspects of tractability analysis	3
Numerical weighted integration of functions having mixed smoothness	3
Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems	3
Spectral flatness and the volume of intersections of p-ellipsoids	3
A two-point Newton-like method of optimal fourth order convergence for systems of nonlinear equations	3
Thomas Jahn, Tino Ullrich and Felix Voigtlaender are the Winners of the 2023 Best Paper Award of the Journal of Complexity	3
Editorial Board	3
Tamed-adaptive Euler-Maruyama approximation for SDEs with superlinearly growing and piecewise continuous drift, superlinearly growing and locally Hölder continuous diffusion	3
On the number of solutions to a random instance of the permuted kernel problem	3
Changes of the Editorial Board	3
Changes of the Editorial Board	3
Amortized multi-point evaluation of multivariate polynomials	3
On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property	3
Integrability of weak mixed first-order derivatives and convergence rates of scrambled digital nets	3
Optimal recovery of linear operators from information of random functions	3
New bounds on the minimal dispersion	3
Editorial Board	3
Editorial Board	3
Minimal dispersion of large volume boxes in the cube	3
Announcement: IBC award 2022 and the nomination deadline 2023	2
Enhancing the applicability of Chebyshev-like method	2

A quasi-Monte Carlo data compression algorithm for machine learning	2
Expected multivolumes of random amoebas	2
Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case	2
On the power of standard information for tractability for L∞ approximation of periodic functions in the worst case setting	2
Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs	2
Computing Riemann–Roch spaces via Puiseux expansions	2
Convergence analysis of iteratively regularized Landweber iteration with uniformly convex constraints in Banach spaces	2
Weighted mesh algorithms for general Markov decision processes: Convergence and tractability	2
Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives	2
Weaker convergence criteria for Traub's method	2
Matrix and tensor rigidity and L-approximation	2
Information-based complexity young researcher award	2
A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions	2
Fast interpolation of multivariate polynomials with sparse exponents	2
Heuristic approaches to obtain low-discrepancy point sets via subset selection	2
Sharp estimates for the covering numbers of the Weierstrass fractal kernel	2
Changes of the Editorial Board	2
Convergence rates of support vector machines regression for functional data	2
On the complexity of convergence for high order iterative methods	2
Fast amortized multi-point evaluation	2
Influence of numerical discretizations on hitting probabilities for linear stochastic parabolic systems	1
Deterministic computation of the characteristic polynomial in the time of matrix multiplication	1
Hammersley Point Sets and Inverse of Star-Discrepancy	1
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density	1
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
On the convergence of gradient descent for robust functional linear regression	1
Functional linear regression with Huber loss	1
The BMO-discrepancy suffers from the curse of dimensionality	1
Bounds for the sampling discretization error and their applications to the universal sampling discretization	1
Tractability of approximation in the weighted Korobov space in the worst-case setting — a complete picture	1
A strongly monotonic polygonal Euler scheme	1
An ultra-weak space-time variational formulation for the Schrödinger equation	1
Editorial Board	1
On the relation of the spectral test to isotropic discrepancy and L-approximation in Sobolev spaces	1
Changes of the Editorial Board	1
On Newton's method for solving generalized equations	1
Minimal dispersion on the cube and the torus	1
Nuclear embeddings in general vector-valued sequence spaces with an application to Sobolev embeddings of function spaces on quasi-bounded domains	1
Sampling discretization and related problems	1
A generative model for fBm with deep ReLU neural networks	1
No existence of a linear algorithm for the one-dimensional Fourier phase retrieval	1
Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
Improved bounds on the gain coefficients for digital nets in prime power base	1
On the information complexity for integration in subspaces of the Wiener algebra	1
Worst case tractability of linear problems in the presence of noise: Linear information	1
Optimal subsampling for least absolute relative error estimators with massive data	1
On the complexity of Putinar–Vasilescu's Positivstellensatz	1
Changes of the Editorial Board	1
Nonparametric conditional U-statistics on Lie groups with measurement errors	1
Kernel multigrid on manifolds	1
Approximate Pythagoras numbers on ⁎-algebras over C	1
Editorial Board	1
The minimal radius of Galerkin information for the problem of numerical differentiation	1
Sharp lower bounds on the manifold widths of Sobolev and Besov spaces	1
Nonexact oracle inequalities, r-learnability, and fast rates	1
Linear implicit approximations of invariant measures of semi-linear SDEs with non-globally Lipschitz coefficients	1
Randomized complexity of mean computation and the adaption problem	1
Discrepancy bounds for normal numbers generated by necklaces in arbitrary base	1