11. A factorization algorithm for G-algebras and its applications. (March 2018) Authors: Levandovskyy, Viktor; Heinle, Albert Journal: Journal of symbolic computation Issue: Volume 85(2018) Page Start: 188 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
12. A fast algorithm for computing multiplicative relations between the roots of a generic polynomial. (May 2021) Authors: Zheng, Tao Journal: Journal of symbolic computation Issue: Volume 104(2021) Page Start: 381 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
13. A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix. (May 2023) Authors: Birmpilis, Stavros; Labahn, George; Storjohann, Arne Journal: Journal of symbolic computation Issue: Volume 116(2023) Page Start: 146 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
14. A fast parallel sparse polynomial GCD algorithm. (July 2021) Authors: Hu, Jiaxiong; Monagan, Michael Journal: Journal of symbolic computation Issue: Volume 105(2021) Page Start: 28 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
15. A general framework for Noetherian well ordered polynomial reductions. (November 2019) Authors: Ceria, Michela; Mora, Teo; Roggero, Margherita Journal: Journal of symbolic computation Issue: Volume 95(2019) Page Start: 100 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
16. A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties. (March 2015) Authors: Lubicz, David; Robert, Damien Journal: Journal of symbolic computation Issue: Volume 67(2015) Page Start: 68 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
17. A generalization of the Katzman-Zhang algorithm. (March 2021) Authors: Yeşil, Mehmet Journal: Journal of symbolic computation Issue: Volume 103(2021) Page Start: 213 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
18. A generic and executable formalization of signature-based Gröbner basis algorithms. (September 2021) Authors: Maletzky, Alexander Journal: Journal of symbolic computation Issue: Volume 106(2021) Page Start: 23 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
19. A generic framework for symbolic execution: A coinductive approach. (May 2017) Authors: Lucanu, Dorel; Rusu, Vlad; Arusoaie, Andrei Journal: Journal of symbolic computation Issue: Volume 80:Part 1(2017) Page Start: 125 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
20. A generic position based method for real root isolation of zero-dimensional polynomial systems. (May 2015) Authors: Cheng, Jin-San; Jin, Kai Journal: Journal of symbolic computation Issue: Volume 68:Part 1(2015) Page Start: 204 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗