Jesse Elliott

Orcid: 0009-0009-3770-2886

According to our database1, Jesse Elliott authored at least 7 papers between 2014 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2025
Refined bit complexity for the computation of at least onepoint per connected component of a smooth completeintersection real algebraic set.
CoRR, August, 2025

Some Applications of Chinese Remainder Theorem Codes with Error-Correction.
Proceedings of the 2025 International Symposium on Symbolic and Algebraic Computation, 2025

2023
Bit complexity for computing one point in each connected component of a smooth real algebraic set.
J. Symb. Comput., 2023

2022
Supersingular Isogeny Diffie-Hellman with Legendre Form.
IACR Cryptol. ePrint Arch., 2022

2020
On the bit complexity of finding points in connected components of a smooth real hypersurface.
Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019
Bit complexity for critical point computation in smooth and compact real hypersurfaces.
ACM Commun. Comput. Algebra, 2019

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


  Loading...