OOIR: Observatory of International Research

Papers

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

Article	Citations
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems	39
On the approximation of vector-valued functions by volume sampling	36
A continuous characterization of PSPACE using polynomial ordinary differential equations	34
Editorial Board	30
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits	25
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	21
Central Limit Theorem for (t,s)-sequences in base 2	21
Optimal recovery and volume estimates	17
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples	17
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	15
Editorial Board	15
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	15
A simplified iteratively regularized projection method for nonlinear ill-posed problems	14
On regularized polynomial functional regression	11
On the expected number of real roots of polynomials and exponential sums	10
A duality approach to regularized learning problems in Banach spaces	10
Approximation in periodic Gevrey spaces	10
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time	10
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	9
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy	8
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness	8
Online regularized learning algorithm for functional data	7
On the complexity of orbit word problems	7
An unfeasibility view of neural network learning	7
On the computation of rational solutions of underdetermined systems over a finite field	6

On the cardinality of lower sets and universal discretization	6
On negative dependence properties of Latin hypercube samples and scrambled nets	6
Editorial Board	6
Direct estimates for adaptive time-stepping finite element methods	6
Editorial Board	6
Approximate equality for two sums of roots	6
Computing zeta functions of large polynomial systems over finite fields	6
Editorial Board	6
Editorial Board	6
On the power of standard information for tractability for L2-approximation in the average case setting	5
Online outcome weighted learning with general loss functions	5
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality	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
Optimal recovery and generalized Carlson inequality for weights with symmetry properties	5
The area of empty axis-parallel boxes amidst 2-dimensional lattice points	4
Complexity for a class of elliptic ordinary integro-differential equations	4
Robust pairwise learning with Huber loss	4
Countable tensor products of Hermite spaces and spaces of Gaussian kernels	4
On oracle factoring of integers	4
Editorial Board	4
A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class	4
Optimal pointwise sampling for L2 approximation	4
Lower bounds for integration and recovery in L2	4
Best Paper Award of the Journal of Complexity	4
Takashi Goda is the winner of the 2025 Joseph F. Traub Prize for Achievement in Information-Based Complexity	4
Approximation by quasi-interpolation operators and Smolyak's algorithm	4
Optimal recovery of linear operators from information of random functions	3
Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems	3
Tamed-adaptive Euler-Maruyama approximation for SDEs with superlinearly growing and piecewise continuous drift, superlinearly growing and locally Hölder continuous diffusion	3
Editorial Board	3
Computing Riemann–Roch spaces via Puiseux expansions	3
Minimal dispersion of large volume boxes in the cube	3
On a unified convergence analysis for Newton-type methods solving generalized equations with the Aubin property	3
New bounds on the minimal dispersion	3
Spectral flatness and the volume of intersections of p-ellipsoids	3
Numerical weighted integration of functions having mixed smoothness	3
Editorial Board	3
Thomas Jahn, Tino Ullrich and Felix Voigtlaender are the Winners of the 2023 Best Paper Award of the Journal of Complexity	3
Expected multivolumes of random amoebas	3
Information-based complexity young researcher award	3
Changes of the Editorial Board	3
On the number of solutions to a random instance of the permuted kernel problem	3
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness	3
Changes of the Editorial Board	3
Estimates of the asymptotic Nikolskii constants for spherical polynomials	3
A two-point Newton-like method of optimal fourth order convergence for systems of nonlinear equations	3
Changes of the Editorial Board	3
Amortized multi-point evaluation of multivariate polynomials	3
Selected aspects of tractability analysis	3