| Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants SG Hyun, V Neiger, É Schost Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019 | 14 | 2019 |
| Block-Krylov techniques in the context of sparse-FGLM algorithms SG Hyun, V Neiger, H Rahkooy, É Schost Journal of Symbolic Computation 98, 163-191, 2020 | 9 | 2020 |
| Change of basis for m-primary ideals in one and two variables SG Hyun, S Melczer, É Schost, C St-Pierre Proceedings of the 2019 on International Symposium on Symbolic and Algebraic …, 2019 | 7 | 2019 |
| A fast algorithm for solving linearly recurrent sequences SG Hyun, S Melczer, C St-Pierre ACM Communications in Computer Algebra 52 (3), 100-103, 2019 | 7 | 2019 |
| Algorithms for structured linear systems solving and their implementation SG Hyun, R Lebreton, É Schost Proceedings of the 2017 ACM on International Symposium on Symbolic and …, 2017 | 6 | 2017 |
| Algorithms for Linearly Recurrent Sequences of Truncated Polynomials SG Hyun, V Neiger, É Schost Proceedings of the 2021 on International Symposium on Symbolic and Algebraic …, 2021 | 1 | 2021 |
| Sparse FGLM using the block Wiedemann algorithm SG Hyun, V Neiger, H Rahkooy, É Schost ACM Communications in Computer Algebra 52 (4), 123-125, 2019 | 1 | 2019 |
| Test-Cost Sensitive Methods for Identifying Nearby Points SG Hyun, C Leung arXiv preprint arXiv:2010.03962, 2020 | | 2020 |
