Journal of Complexity

Papers
(The H4-Index of Journal of Complexity is 11. 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.)
ArticleCitations
Multilevel Picard approximations overcome the curse of dimensionality in the numerical approximation of general semilinear PDEs with gradient-dependent nonlinearities40
On the approximation of vector-valued functions by volume sampling31
Central Limit Theorem for the volume of the zero set of Kostlan-Shub-Smale random polynomial systems25
Rademacher learning rates for iterated random functions22
A continuous characterization of PSPACE using polynomial ordinary differential equations21
Optimal recovery and volume estimates20
On a central algorithm for calculation of the inverse of the harmonic oscillator in the spaces of orbits19
Central Limit Theorem for (t,s)-sequences in base 218
Optimal approximation of infinite-dimensional holomorphic functions II: Recovery from i.i.d. pointwise samples16
Random-prime–fixed-vector randomised lattice-based algorithm for high-dimensional integration14
Kateryna Pozharska is the winner of the 2023 Joseph F. Traub Information-Based Complexity Young Researcher Award11
0.86970710754395