1. Factoring Polynomials Over Finite Fields
2. Elwyn R Berlekamp . 1970. Factoring polynomials over large finite fields. Mathematics of computation 24, 111 ( 1970 ), 713–735. Elwyn R Berlekamp. 1970. Factoring polynomials over large finite fields. Mathematics of computation 24, 111 (1970), 713–735.
3. Polynomial root finding over local rings and application to error correcting codes
4. A CRITERION FOR THE p-ADIC SOLUBILITY OF DIOPHANTINE EQUATIONS
5. Solving systems of polynomial equations over GF (2) by a parity-counting self-reduction. In 46th International Colloquium on Automata, Languages, and Programming (ICALP), 2019, Patras, Greece(LIPIcs, Vol. 132);Björklund Andreas;Schloss Dagstuhl - Leibniz-Zentrum für Informatik,2019