OOIR: Observatory of International Research

Papers

(The median citation count of Journal of Complexity is 1. 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-02-01 to 2025-02-01.)

Article	Citations
Computing Approximate Roots of Monotone Functions	38
Enhancing the applicability of Chebyshev-like method	28
Editorial Board	23
On the complexity of Putinar–Vasilescu's Positivstellensatz	23
On the complexity of fitted toral dynamics	22
Bounds for discrepancies in the Hamming space	19
Kolmogorov widths of intersections of finite-dimensional balls	17
Editorial Board	14
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems	14
Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations	13
Editorial Board	12
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	10
Optimal recovery and generalized Carlson inequality for weights with symmetry properties	9
Changes of the Editorial Board	9
Best Paper Award of the Journal of Complexity	9
On negative dependence properties of Latin hypercube samples and scrambled nets	8
Editorial Board	8
Heuristic approaches to obtain low-discrepancy point sets via subset selection	8
Influence of numerical discretizations on hitting probabilities for linear stochastic parabolic systems	8
Radius of information for two intersected centered hyperellipsoids and implications in optimal recovery from inaccurate data	8
Changes of the Editorial Board	7
Editorial Board	7
Matrix and tensor rigidity and L-approximation	6
Sampling numbers of smoothness classes via ℓ1-minimization	6
Nonlinear Tikhonov regularization in Hilbert scales for inverse learning	6

Nominations for 2022 Joseph F. Traub Information-Based Complexity Young Researcher Award	6
Optimal subsampling for least absolute relative error estimators with massive data	6
On the cardinality of lower sets and universal discretization	6
Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality	6
On the complexity of convergence for high order iterative methods	5
Approximating smooth and sparse functions by deep neural networks: Optimal approximation rates and saturation	5
On the complexity of a unified convergence analysis for iterative methods	5
Editorial Board	5
High-order lifting for polynomial Sylvester matrices	4
On the approximation of vector-valued functions by volume sampling	4
A closer look at covering number bounds for Gaussian kernels	4
Discrepancy bounds for normal numbers generated by necklaces in arbitrary base	4
High probability bounds on AdaGrad for constrained weakly convex optimization	4
Optimal pointwise sampling for L2 approximation	4
On the power of standard information for tractability for L2-approximation in the average case setting	4
A continuous characterization of PSPACE using polynomial ordinary differential equations	4
Weaker convergence criteria for Traub's method	3
Function values are enough for L2-approximation: Part II	3
Optimal recovery and volume estimates	3
Noisy polynomial interpolation modulo prime powers	3
Editorial Board	3
On the power of standard information for tractability for L∞ approximation of periodic functions in the worst case setting	3
Space-filling designs on Riemannian manifolds	3
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	3
Convergence analysis of iteratively regularized Landweber iteration with uniformly convex constraints in Banach spaces	3
Tractability for Volterra problems of the second kind with convolution kernels	3
Editorial Board	3
On oracle factoring of integers	3
Convergence of the Gauss-Newton method for convex composite optimization problems under majorant condition on Riemannian manifolds	3
Lower bounds for integration and recovery in L2	3
Countable tensor products of Hermite spaces and spaces of Gaussian kernels	3
Worst case tractability of linear problems in the presence of noise: Linear information	3
The area of empty axis-parallel boxes amidst 2-dimensional lattice points	3
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits	3
A generative model for fBm with deep ReLU neural networks	3
A unified treatment of tractability for approximation problems defined on Hilbert spaces	2
On the relation of the spectral test to isotropic discrepancy and L-approximation in Sobolev spaces	2
Convergence rates of support vector machines regression for functional data	2
Approximation by quasi-interpolation operators and Smolyak's algorithm	2
Estimates for n-widths of sets of smooth functions on complex spheres	2
Improved dispersion bounds for modified Fibonacci lattices	2
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	2
Average case tractability of non-homogeneous tensor product problems with the absolute error criterion	2
Changes of the Editorial Board	2
Editorial Board	2
A quasi-Monte Carlo data compression algorithm for machine learning	2
Editorial Board	2
The VC-dimension of axis-parallel boxes on the Torus	2
Online gradient descent algorithms for functional data learning	2
A note on Korobov lattice rules for integration of analytic functions	2

Editorial Board	2
Approximation in periodic Gevrey spaces	2
The minimal radius of Galerkin information for the problem of numerical differentiation	2
The BMO-discrepancy suffers from the curse of dimensionality	2
Lower bounds of cowidths and widths of multiplier operators	2
Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case	2
Sharp estimates for the covering numbers of the Weierstrass fractal kernel	2
On a partition with a lower expected L2	2
On regularized polynomial functional regression	2
Central Limit Theorem for (t,s)-sequences in base 2	2
A note on (s,t	2
Editorial Board	2
On the information complexity for integration in subspaces of the Wiener algebra	2
A simplified iteratively regularized projection method for nonlinear ill-posed problems	2
An elementary proof of a lower bound for the inverse of the star discrepancy	2
Convergence analysis of an optimally accurate frozen multi-level projected steepest descent iteration for solving inverse problems	1
Rates of approximation by ReLU shallow neural networks	1
New bounds on the minimal dispersion	1
Multi-task Learning in vector-valued reproducing kernel Banach spaces with the	1
No existence of a linear algorithm for the one-dimensional Fourier phase retrieval	1
Randomized complexity of mean computation and the adaption problem	1
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	1
Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness	1
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	1
Adaptive Huber trace regression with low-rank matrix parameter via nonconvex regularization	1
Fast computation of generic bivariate resultants	1
On optimal recovery in L2	1
Journal of Complexity Best Paper Award	1
The radii of sections of origin-symmetric convex bodies and their applications	1
Tamed-adaptive Euler-Maruyama approximation for SDEs with superlinearly growing and piecewise continuous drift, superlinearly growing and locally Hölder continuous diffusion	1
Randomized complexity of parametric integration and the role of adaption II. Sobolev spaces	1
Best Paper Award of the Journal of Complexity	1
On the expected number of real roots of polynomials and exponential sums	1
Sharp lower bounds on the manifold widths of Sobolev and Besov spaces	1
A note on EC-tractability of multivariate approximation in weighted Korobov spaces for the standard information class	1
Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions	1
Optimal prediction for high-dimensional functional quantile regression in reproducing kernel Hilbert spaces	1
Complexity for a class of elliptic ordinary integro-differential equations	1
David Krieg is the winner of the 2024 Joseph F. Traub Prize for Achievement in Information-Based Complexity	1
Editorial Board	1
EC-(t1,t2)-tractability of approximation in weighted Korobov spaces in the worst case setting	1
Changes of the Editorial Board	1
Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
Adaptive iterative hard thresholding for low-rank matrix recovery and rank-one measurements	1
An ultra-weak space-time variational formulation for the Schrödinger equation	1
Editorial Board	1
Tractability of approximation in the weighted Korobov space in the worst-case setting — a complete picture	1
Robust pairwise learning with Huber loss	1
Functional linear regression with Huber loss	1
On the strong convergence rate for the Euler–Maruyama scheme of one-dimensional SDEs with irregular diffusion coefficient and local time	1
Nominations for 2021 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
Numerical weighted integration of functions having mixed smoothness	1