| 2022 | On Polynomial Ideals and Overconvergence in Tate Algebras. | Xavier Caruso, Tristan Vaccon, Thibaut Verron |
| 2022 | Enumerating Denumerable Sets in Polynomial Time via the Schrder-Bernstein Theorem. | Reinhold Burger |
| 2022 | Sparse Matrices Powering Three Pillars of Science: Simulation, Data, and Learning. | Aydin Bulu |
| 2022 | Algorithms for Discrete Differential Equations of Order 1. | Alin Bostan, Frdric Chyzak, Hadrien Notarantonio, Mohab Safey El Din |
| 2022 | Marginal Independence Models. | Tobias Boege, Sonja Petrovic, Bernd Sturmfels |
| 2022 | Faster Change of Order Algorithm for Grbner Bases under Shape and Stability Assumptions. | Jrmy Berthomieu, Vincent Neiger, Mohab Safey El Din |
| 2022 | Solving Sparse Polynomial Systems using Grbner Bases and Resultants. | Matas R. Bender |
| 2022 | Bounding the Number of Roots of Multi-Homogeneous Systems. | Evangelos Bartzos, Ioannis Z. Emiris, Ilias S. Kotsireas, Charalambos Tzamos |
| 2022 | Mahler Discrete Residues and Summability for Rational Functions. | Carlos E. Arreche, Yi Zhang |
| 2022 | On Linear Dependence of Rows and Columns in Matrices over Non-commutative Domains. | Sergei A. Abramov, Marko Petkovsek, Anna A. Ryabenko |
| 2021 | Differential Equations for Feynman Integrals. | Pierre Vanhove |
| 2021 | Computing Grothendieck Point Residues via Solving Holonomic Systems of First Order Partial Differential Equations. | Shinichi Tajima, Katsusuke Nabeshima |
| 2021 | Positive Existential Definability with Unit, Addition and Coprimeness. | Mikhail R. Starchak |
| 2021 | The Tensor Rank of 5x5 Matrices Multiplication is Bounded by 98 andIts Border Rank by 89. | Alexandre Sedoglavic, Alexey V. Smirnov |
| 2021 | A Complexity Chasm for Solving Univariate Sparse Polynomial Equations Over p-adic Fields. | J. Maurice Rojas, Yuyu Zhu |
| 2021 | Computing Characteristic Polynomials of p-Curvatures in Average Polynomial Time. | Raphal Pags |
| 2021 | Computing Valuations of the Dieudonn Determinants. | Taihei Oki |
| 2021 | Extending the Fundamental Theorem of Linear Programming for Strict Inequalities. | Jasper Nalbach, Erika brahm, Gereon Kremer |
| 2021 | Design and Implementation of Multi-Threaded Algorithms in Polynomial Algebra. | Marc Moreno Maza |
| 2021 | Completion in Operads via Essential Syzygies. | Philippe Malbos, Isaac Ren |
| 2021 | The Constant Trace Property in Noncommutative Optimization. | Ngoc Hoang Anh Mai, Abhishek Bhardwaj, Victor Magron |
| 2021 | Choosing the Variable Ordering for Cylindrical Algebraic Decomposition via Exploiting Chordal Structure. | Haokun Li, Bican Xia, Huiying Zhang, Tao Zheng |
| 2021 | On the Smallest Ratio Problem of Lattice Bases. | Jianwei Li |
| 2021 | Generalized Grbner Bases and New Properties of Multivariate Difference Dimension Polynomials. | Alexander Levin |
| 2021 | Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations. | Huu Phuoc Le, Mohab Safey El Din |