- Counting Basic-Irreducible Factors Mod p^k in Deterministic Poly-Time and p-Adic Applicationscoco 2019: [doi]
- Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applicationseccc, 26:33, 2019. [doi]
- Efficiently factoring polynomials modulo $p^4$eccc, 26:8, 2019. [doi]
- Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Fieldtoc, 15:1-30, 2019. [doi]
- Research in theoretical computer scienceCACM, 62(11):92-95, 2019. [doi]