Newton Basis Relations and Applications to Integer-Valued Polynomials and q-Binomial Coefficients. - Jesse Elliott (Integers, 2014)

Bit complexity for critical point computation in smooth and compact real hypersurfaces. - Jesse Elliott; Éric Schost (ACM Commun. Comput. Algebra, 2019)

On the bit complexity of finding points in connected components of a smooth real hypersurface. - Jesse Elliott; Mark Giesbrecht; Éric Schost (ISSAC, 2020)

Supersingular Isogeny Diffie-Hellman with Legendre Form. - Jesse Elliott; Aaron Hutchinson (IACR Cryptol. ePrint Arch., 2022)

Bit complexity for computing one point in each connected component of a smooth real algebraic set. - Jesse Elliott; Mark Giesbrecht; Éric Schost (J. Symb. Comput., 2023)

Some applications of Chinese Remainder Theorem codes with error-correction. - Jesse Elliott; Éric Schost (SCSS (Work in Progress), 2024)