OOIR: Observatory of International Research

Papers

(The TQCC of ACM Transactions on Mathematical Software is 6. 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 2020-04-01 to 2024-04-01.)

Article	Citations
JGraphT—A Java Library for Graph Data Structures and Algorithms	63
Construction of Arbitrary Order Finite Element Degree-of-Freedom Maps on Polygonal and Polyhedral Cell Meshes	49
hIPPYlib	40
GetFEM	33
Scrambled Linear Pseudorandom Number Generators	30
Enabling New Flexibility in the SUNDIALS Suite of Nonlinear and Differential/Algebraic Equation Solvers	28
PySPH: A Python-based Framework for Smoothed Particle Hydrodynamics	25
TuckerMPI	24
Ginkgo : A Modern Linear Operator Algebra Framework for High Performance Computing	24
Medusa	20
A Flexible, Parallel, Adaptive Geometric Multigrid Method for FEM	19
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU	18
Algorithm 1011	18
A Set of Batched Basic Linear Algebra Subprograms and LAPACK Routines	16
`DIRECTGO` : A New `DIRECT` -Type `MATLAB` Toolbox for Derivative-Free Global Optimization	15
CGPOPS	15
An Enhancement of the Bisection Method Average Performance Preserving Minmax Optimality	13
Yet Another Tensor Toolbox for Discontinuous Galerkin Methods and Other Applications	12
HyperNOMAD	12
Adaptive Precision Block-Jacobi for High Performance Preconditioning in the Ginkgo Linear Algebra Software	11
MultiZ	11
Enabling Research through the SCIP Optimization Suite 8.0	11
Algorithm 1027: `NOMAD` Version 4: Nonlinear Optimization with the MADS Algorithm	11
PCPATCH	11
Automatic Code Generation for High-performance Discontinuous Galerkin Methods on Modern Architectures	10

Error Analysis and Improving the Accuracy of Winograd Convolution for Deep Neural Networks	10
Error Analysis of Some Operations Involved in the Cooley-Tukey Fast Fourier Transform	10
CS-TSSOS: Correlative and Term Sparsity for Large-Scale Polynomial Optimization	10
ArborX	10
Propagating Geometry Information to Finite Element Computations	9
Faithfully Rounded Floating-point Computations	9
Algorithms for Efficient Reproducible Floating Point Summation	9
Algorithm 1017	8
hyper.deal: An Efficient, Matrix-free Finite-element Library for High-dimensional Partial Differential Equations	8
Parallel Tree Algorithms for AMR and Non-Standard Data Access	8
The BLAS API of BLASFEO	8
Algorithm 1008	7
Irksome: Automating Runge–Kutta Time-stepping for Finite Element Methods	7
Automating the Formulation and Resolution of Convex Variational Problems	7
Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement	7
H2Pack	6
Recycling Krylov Subspaces and Truncating Deflation Subspaces for Solving Sequence of Linear Systems	6
Abstractions and Automated Algorithms for Mixed Domain Finite Element Methods	6
PLANC	6
Algorithm 1012	6
Algorithm 1020: Computation of Multi-Degree Tchebycheffian B-Splines	6
Linnea	6