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 2022-05-01 to 2026-05-01.)

Article	Citations
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems	43
Rademacher learning rates for iterated random functions	36
On the approximation of vector-valued functions by volume sampling	29
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities	26
A continuous characterization of PSPACE using polynomial ordinary differential equations	21
Optimal recovery and volume estimates	20
Central Limit Theorem for (t,s)-sequences in base 2	19
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples	14
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	12
Generalization bounds of adversarial bipartite ranking with pairwise perturbation	12
Changes of the Editorial Board	10
Approximation in periodic Gevrey spaces	9
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	9
Editorial Board	8
On regularized polynomial functional regression	8
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time	8
A duality approach to regularized learning problems in Banach spaces	8
A simplified iteratively regularized projection method for nonlinear ill-posed problems	8
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	8
Approximate equality for two sums of roots	7
Online regularized learning algorithm for functional data	7
Editorial Board	7
On the complexity of orbit word problems	7
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	7
Direct estimates for adaptive time-stepping finite element methods	7

Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy	7
On the expected number of real roots of polynomials and exponential sums	7
On the computation of rational solutions of underdetermined systems over a finite field	6
Online outcome weighted learning with general loss functions	6
Computing zeta functions of large polynomial systems over finite fields	6
Editorial Board	6
On optimal recovery and information complexity in numerical differentiation and summation	6
An unfeasibility view of neural network learning	6
Skewness of a randomized quasi-Monte Carlo estimate	6
Editorial Board	6
Optimal recovery and generalized Carlson inequality for weights with symmetry properties	5
On the power of standard information for tractability for L2-approximation in the average case setting	5
On the complexity of a unified convergence analysis for iterative methods	5
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality	5
On the cardinality of lower sets and universal discretization	5
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations	5
The area of empty axis-parallel boxes amidst 2-dimensional lattice points	4
Countable tensor products of Hermite spaces and spaces of Gaussian kernels	4
Editorial Board	4
Editorial Board	4
Statistical analysis of prediction in functional polynomial quantile regression	4
Complexity for a class of elliptic ordinary integro-differential equations	4
On oracle factoring of integers	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
Weighted sampling recovery of functions with mixed smoothness	4
Optimal recovery of linear operators from information of random functions	4
Editorial Board	4
Geo-indistinguishable location obfuscation with inference error bounds	4
Best Paper Award of the Journal of Complexity	4
Accelerated convergence of error quantiles using robust randomized quasi Monte Carlo methods	4
Numerical weighted integration of functions having mixed smoothness	4
Spectral flatness and the volume of intersections of p-ellipsoids	3
New bounds on the minimal dispersion	3
Editorial Board	3
Changes of the Editorial Board	3
A two-point Newton-like method of optimal fourth order convergence for systems of nonlinear equations	3
Changes of the 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
Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems	3
Selected aspects of tractability analysis	3
Editorial Board	3
Optimal prediction of vector-valued functions from point samples	3
Editorial Board	3
Jonathan Siegel is the winner of the 2025 Joseph F. Traub Information-Based Complexity Young Researcher Award	3
On the number of solutions to a random instance of the permuted kernel problem	3
On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property	3
Fast interpolation of multivariate polynomials with sparse exponents	2
A generative model for fBm with deep ReLU neural networks	2
Sharp estimates for the covering numbers of the Weierstrass fractal kernel	2

On the power of standard information for tractability for L∞ approximation of periodic functions in the worst case setting	2
Integrability of weak mixed first-order derivatives and convergence rates of scrambled digital nets	2
Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs	2
Editorial Board	2
Minimal dispersion of large volume boxes in the cube	2
Information-based complexity young researcher award	2
On the complexity of convergence for high order iterative methods	2
Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case	2
Heuristic approaches to obtain low-discrepancy point sets via subset selection	2
Matrix and tensor rigidity and L-approximation	2
Announcement: IBC award 2022 and the nomination deadline 2023	2
Homogeneous algorithms and solvable problems on cones	2
Enhancing the applicability of Chebyshev-like method	2
Thomas Jahn, Tino Ullrich and Felix Voigtlaender are the Winners of the 2023 Best Paper Award of the Journal of Complexity	2
Amortized multi-point evaluation of multivariate polynomials	2
A high-efficiency fourth-order iterative method for nonlinear equations: Convergence and computational gains	2
Regularized reduced-rank regression for structured output prediction	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
Changes of the Editorial Board	2
Expected multivolumes of random amoebas	2
A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions	2
Discrepancy bounds for normal numbers generated by necklaces in arbitrary base	1
On the complexity of p-order cone programs	1
A strongly monotonic polygonal Euler scheme	1
Hammersley point sets and inverse of star-discrepancy	1
Influence of numerical discretizations on hitting probabilities for linear stochastic parabolic systems	1
Sampling discretization and related problems	1
Convergence analysis of a regularized iterative scheme for solving nonlinear problems	1
Editorial Board	1
Sharp lower bounds on the manifold widths of Sobolev and Besov spaces	1
Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
Approximate Pythagoras numbers on ⁎-algebras over C	1
Marcinkiewicz–Zygmund inequalities in quasi-Banach function spaces	1
On the complexity of Putinar–Vasilescu's Positivstellensatz	1
Editorial Board	1
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
Minimal dispersion on the cube and the torus	1
Kernel multigrid on manifolds	1
A sixth-order bi-parametric iterative method for nonlinear systems: Theory, stability and computational complexity	1
Bounds for the sampling discretization error and their applications to the universal sampling discretization	1
The BMO-discrepancy suffers from the curse of dimensionality	1
Nonexact oracle inequalities, r-learnability, and fast rates	1
Nonparametric conditional U-statistics on Lie groups with measurement errors	1
On recovering the Radon-Nikodym derivative under the big data assumption	1
Optimal subsampling for least absolute relative error estimators with massive data	1
Worst case tractability of linear problems in the presence of noise: Linear information	1
Changes of the Editorial Board	1
Improved bounds on the gain coefficients for digital nets in prime power base	1
On the convergence of gradient descent for robust functional linear regression	1
Linear implicit approximations of invariant measures of semi-linear SDEs with non-globally Lipschitz coefficients	1
Functional linear regression with Huber loss	1
The minimal radius of Galerkin information for the problem of numerical differentiation	1
No existence of a linear algorithm for the one-dimensional Fourier phase retrieval	1
On Newton's method for solving generalized equations	1