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-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
Central Limit Theorem for (t,s)-sequences in base 2	21
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration	21
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples	17
Optimal recovery and volume estimates	17
Editorial Board	15
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	15
Tractability of L2-approximation and integration in weighted Hermite spaces of finite smoothness	15
A simplified iteratively regularized projection method for nonlinear ill-posed problems	14
On regularized polynomial functional regression	11
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 expected number of real roots of polynomials and exponential sums	10
A duality approach to regularized learning problems in Banach spaces	10
On the complexity of strong approximation of stochastic differential equations with a non-Lipschitz drift coefficient	9
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness	8
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
Online regularized learning algorithm for functional data	7
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 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
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
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
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
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
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
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

Enhancing the applicability of Chebyshev-like method	2
Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs	2
Editorial Board	2
Editorial Board	2
Weaker convergence criteria for Traub's method	2
Announcement: IBC award 2022 and the nomination deadline 2023	2
A quasi-Monte Carlo data compression algorithm for machine learning	2
Fast amortized multi-point evaluation	2
Convergence analysis of iteratively regularized Landweber iteration with uniformly convex constraints in Banach spaces	2
Adaptive regularization for nonconvex optimization using inexact function values and randomly perturbed derivatives	2
Convergence rates of support vector machines regression for functional data	2
Homogeneous algorithms and solvable problems on cones	2
Randomized complexity of parametric integration and the role of adaption I. Finite dimensional case	2
Matrix and tensor rigidity and L-approximation	2
Heuristic approaches to obtain low-discrepancy point sets via subset selection	2
On the complexity of convergence for high order iterative methods	2
A proof of convergence for gradient descent in the training of artificial neural networks for constant target functions	2
Weighted mesh algorithms for general Markov decision processes: Convergence and tractability	2
Integrability of weak mixed first-order derivatives and convergence rates of scrambled digital nets	2
A generative model for fBm with deep ReLU neural networks	2
Fast interpolation of multivariate polynomials with sparse exponents	2
Sharp estimates for the covering numbers of the Weierstrass fractal kernel	2
The minimal radius of Galerkin information for the problem of numerical differentiation	1
A strongly monotonic polygonal Euler scheme	1
Optimal subsampling for least absolute relative error estimators with massive data	1
Changes of the Editorial Board	1
On the complexity of Putinar–Vasilescu's Positivstellensatz	1
Homotopy techniques for solving sparse column support determinantal polynomial systems	1
Nonexact oracle inequalities, r-learnability, and fast rates	1
Kernel multigrid on manifolds	1
Nonparametric conditional U-statistics on Lie groups with measurement errors	1
No existence of a linear algorithm for the one-dimensional Fourier phase retrieval	1
The BMO-discrepancy suffers from the curse of dimensionality	1
On the power of standard information for tractability for L∞ approximation of periodic functions in the worst case setting	1
Approximate Pythagoras numbers on ⁎-algebras over C	1
Bounds for discrepancies in the Hamming space	1
Influence of numerical discretizations on hitting probabilities for linear stochastic parabolic systems	1
Nominations for 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
Lower bounds for the error of quadrature formulas for Hilbert spaces	1
Nuclear embeddings in general vector-valued sequence spaces with an application to Sobolev embeddings of function spaces on quasi-bounded domains	1
Deterministic computation of the characteristic polynomial in the time of matrix multiplication	1
On optimal recovery in L2	1
Minimal dispersion on the cube and the torus	1
Editorial Board	1
Tractability of approximation in the weighted Korobov space in the worst-case setting — a complete picture	1
Matthieu Dolbeault is the winner of the 2024 Joseph F. Traub Information-Based Complexity Young Researcher Award	1
On the convergence of gradient descent for robust functional linear regression	1
A promenade through correct test sequences I: Degree of constructible sets, Bézout's Inequality and density	1
Discrepancy bounds for normal numbers generated by necklaces in arbitrary base	1
Changes of the Editorial Board	1
Editorial Board	1
Sampling discretization and related problems	1
On Newton's method for solving generalized equations	1
Improved bounds on the gain coefficients for digital nets in prime power base	1
Linear implicit approximations of invariant measures of semi-linear SDEs with non-globally Lipschitz coefficients	1
Functional linear regression with Huber loss	1
Sharp lower bounds on the manifold widths of Sobolev and Besov spaces	1
Function values are enough for L2-approximation: Part II	1