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

Article	Citations
Editorial Board	36
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems	32
A continuous characterization of PSPACE using polynomial ordinary differential equations	30
On the approximation of vector-valued functions by volume sampling	29
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits	26
Optimal recovery and volume estimates	20
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	19
Central Limit Theorem for (t,s)-sequences in base 2	18
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	17
Editorial Board	15
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time	14
Approximation in periodic Gevrey spaces	14
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	13
A simplified iteratively regularized projection method for nonlinear ill-posed problems	12
Estimates for n-widths of sets of smooth functions on complex spheres	11
A duality approach to regularized learning problems in Banach spaces	10
On regularized polynomial functional regression	10
On the expected number of real roots of polynomials and exponential sums	10
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	10
Non-convergence of stochastic gradient descent in the training of deep neural networks	9
Improved bounds for the bracketing number of orthants or revisiting an algorithm of Thiémard to compute bounds for the star discrepancy	8
On the complexity of orbit word problems	7
An unfeasibility view of neural network learning	7
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness	7
Online regularized learning algorithm for functional data	7

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