OOIR: Observatory of International Research

Papers

(The TQCC of Journal of Complexity is 4. 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-08-01 to 2026-08-01.)

Article	Citations
On the approximation of vector-valued functions by volume sampling	47
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities	43
Simon Foucart is the winner of the 2026 Joseph F. Traub Prize for Achievement in Information-Based Complexity	32
Rademacher learning rates for iterated random functions	30
A continuous characterization of PSPACE using polynomial ordinary differential equations	24
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems	20
Editorial Board	14
Central Limit Theorem for (t,s)-sequences in base 2	14
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	12
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples	10
Editorial Board	10
Optimal recovery and volume estimates	10
On regularized polynomial functional regression	10
Generalization bounds of adversarial bipartite ranking with pairwise perturbation	10
Changes of the Editorial Board	10
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	10
A simplified iteratively regularized projection method for nonlinear ill-posed problems	9
Approximation in periodic Gevrey spaces	8
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time	8
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	8
Sequential-data-driven Levenberg-Marquardt algorithm with convex constraints	8
On the expected number of real roots of polynomials and exponential sums	8
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	8
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy	7
Average case tractability of additive random fields with Korobov kernels	7

Robust learning of Huber loss under exponentially strongly mixing sequence	7
On the complexity of orbit word problems	7
Disproving the quasi-uniformity of the Halton sequences and of some Halton-type sequences	7
A duality approach to regularized learning problems in Banach spaces	7
Regularization operators for identifying the unknown source in the time-fractional convection-diffusion-reaction equation	7
Online regularized learning algorithm for functional data	7
An unfeasibility view of neural network learning	6
Direct estimates for adaptive time-stepping finite element methods	6
Approximate equality for two sums of roots	6
On the computation of rational solutions of underdetermined systems over a finite field	6
Editorial Board	5
On optimal recovery and information complexity in numerical differentiation and summation	5
Editorial Board	5
On the complexity of a unified convergence analysis for iterative methods	5
Editorial Board	5
On the cardinality of lower sets and universal discretization	5
Optimal recovery and generalized Carlson inequality for weights with symmetry properties	5
Computing zeta functions of large polynomial systems over finite fields	5
On oracle factoring of integers	4
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations	4
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality	4
Best Paper Award of the Journal of Complexity	4
Complexity for a class of elliptic ordinary integro-differential equations	4
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
Online outcome weighted learning with general loss functions	4
Skewness of a randomized quasi-Monte Carlo estimate	4
Geo-indistinguishable location obfuscation with inference error bounds	4
Editorial Board	4
Weighted sampling recovery of functions with mixed smoothness	4
Editorial Board	4
Statistical analysis of prediction in functional polynomial quantile regression	4
Lower bounds for integration and recovery in L2	4
Landweber iteration for inverse problems using multiple repeated measurements data in Banach spaces	4
Takashi Goda is the winner of the 2025 Joseph F. Traub Prize for Achievement in Information-Based Complexity	4
Accelerated convergence of error quantiles using robust randomized quasi Monte Carlo methods	4