| 81 | -- | 92 | Kosuke Sakata. An efficient reduction strategy for signature-based algorithms to compute Gröbner basis |
| 93 | -- | 95 | Shayea Aldossari, Mark van Hoeij. Methods for simplifying differential equations |
| 96 | -- | 98 | Shaoshi Chen, Jing Guo. Additive Ore-Sato theorem |
| 99 | -- | 102 | Boming Chi, Akira Terui. The GPGCD algorithm with the Bézout matrix |
| 103 | -- | 106 | Robert M. Corless, Leili Rafiee Sevyeri. Approximate GCD in Bernstein basis |
| 107 | -- | 109 | Mawunyo Kofi Darkey-Mensah, Przemyslaw Koprowski. Intrinsic factorization of ideals in Dedekind domains |
| 110 | -- | 113 | Hao Du, Jing Guo, Ziming Li. An additive decomposition in multiple logarithmic extensions |
| 114 | -- | 117 | Jesse Elliott, Éric Schost. Bit complexity for critical point computation in smooth and compact real hypersurfaces |
| 118 | -- | 121 | Marijn Heule, Manuel Kauers, Martina Seidl. A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications |
| 122 | -- | 125 | Bo Huang, Wei Niu. Algebraic approach to chaos induced by snapback repeller |
| 126 | -- | 129 | Manuel Kauers, Thibaut Verron. Why you should remove zeros from data before guessing |
| 130 | -- | 133 | Kazuki Kondo, Hiroshi Sekigawa. Robust computation methods for sparse interpolation of multivariate polynomials |
| 134 | -- | 137 | Jiang Liu. Block distance invariant method for monoterm canonicalization of Riemann tensor polynomials |
| 138 | -- | 141 | Akshar Nair, James H. Davenport, Gregory Sankaran, Scott McCallum. Lazard's CAD exploiting equality constraints |
| 142 | -- | 145 | Garrett Paluck, Michael Monagan. n factors |
| 146 | -- | 149 | Patricia Pascual-Ortigosa, Eduardo Sáenz-de-Cabezón, Henry P. Wynn. n systems |
| 150 | -- | 152 | Yi Zhou, Mark van Hoeij. Fast algorithm for factoring difference operators |