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

Article	Citations
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities	40
On the approximation of vector-valued functions by volume sampling	31
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems	25
Rademacher learning rates for iterated random functions	22
A continuous characterization of PSPACE using polynomial ordinary differential equations	21
Optimal recovery and volume estimates	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	18
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples	16
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	14
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	11
Editorial Board	9
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	9
Approximation in periodic Gevrey spaces	9
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time	8
A simplified iteratively regularized projection method for nonlinear ill-posed problems	8
On regularized polynomial functional regression	8
A duality approach to regularized learning problems in Banach spaces	7
On the expected number of real roots of polynomials and exponential sums	7
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	6
On the complexity of orbit word problems	6
Computing zeta functions of large polynomial systems over finite fields	6
Editorial Board	6
Online regularized learning algorithm for functional data	6
Approximate equality for two sums of roots	6

Editorial Board	6
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy	6
Direct estimates for adaptive time-stepping finite element methods	6
An unfeasibility view of neural network learning	6
On the cardinality of lower sets and universal discretization	5
Skewness of a randomized quasi-Monte Carlo estimate	5
On the power of standard information for tractability for L2-approximation in the average case setting	5
Optimal recovery and generalized Carlson inequality for weights with symmetry properties	5
Editorial Board	5
On the complexity of a unified convergence analysis for iterative methods	5
On the computation of rational solutions of underdetermined systems over a finite field	5
Editorial Board	5
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations	5
Online outcome weighted learning with general loss functions	5
On the number of solutions to a random instance of the permuted kernel problem	4
Geo-indistinguishable location obfuscation with inference error bounds	4
The area of empty axis-parallel boxes amidst 2-dimensional lattice points	4
Best Paper Award of the Journal of Complexity	4
Complexity for a class of elliptic ordinary integro-differential equations	4
Optimal recovery of linear operators from information of random functions	4
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality	4
Countable tensor products of Hermite spaces and spaces of Gaussian kernels	4
Lower bounds for integration and recovery in L2	4
Editorial Board	4
Editorial Board	4
Optimal pointwise sampling for L2 approximation	4
On oracle factoring of integers	4
Approximation by quasi-interpolation operators and Smolyak's algorithm	4
Takashi Goda is the winner of the 2025 Joseph F. Traub Prize for Achievement in Information-Based Complexity	4