, The middle product algorithm i Applicable Algebra in Engineering, Communication and Computing, vol.14, issue.6, pp.415-438, 2004.
, Tellegen's principle into practice, Proceedings of the 2003 international symposium on Symbolic and algebraic computation , ISSAC '03, pp.37-44, 2003.
DOI : 10.1145/860854.860870
, Multiplication of Multidigit Numbers on Automata, Soviet Physics-Doklady, vol.7, pp.595-596, 1963.
, Modern Computer Algebra, 2013.
, Faster Polynomial Multiplication over Finite Fields, Journal of the ACM, vol.63, issue.6, pp.1-5223, 2017.
DOI : 10.1090/S0025-5718-1992-1106981-9
URL : https://hal.archives-ouvertes.fr/hal-01022757
, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM, vol.27, issue.4, pp.701-717, 1980.
DOI : 10.1145/322217.322225
, A probabilistic remark on algebraic program testing, Information Processing Letters, vol.7, issue.4, pp.193-195, 1978.
DOI : 10.1016/0020-0190(78)90067-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.391.4508
, Online order basis algorithm and its impact on the block Wiedemann algorithm, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, pp.202-209, 2014.
DOI : 10.1145/2608628.2608647
URL : https://hal.archives-ouvertes.fr/lirmm-01232873
, A probabilistic algorithm for verifying matrix products using O(n2) time and log2n + O(1) random bits, Information Processing Letters, vol.45, issue.2, pp.107-110, 1993.
DOI : 10.1016/0020-0190(93)90224-W
, On short multiplications and divisions Applicable Algebra in Engineering, Communication and Computing, vol.11, issue.1, pp.69-88, 2000.
DOI : 10.1007/s002000000037
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.214
, A long note on Mulders??? short product, Journal of Symbolic Computation, vol.37, issue.3, pp.391-401, 2004.
DOI : 10.1016/j.jsc.2003.03.001
URL : https://hal.archives-ouvertes.fr/inria-00100069