OOIR: Observatory of International Research

Papers

(The H4-Index of Journal of Complexity is 10. 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
Changes of the Editorial Board	10
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	10
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