All authorships are in alphabetical order, as is customary in theoretical computer science.

Publications and Preprints

• Bit Complexity for Computing One Point in Each Connected Component of a Smooth Real Algebraic Set.
  J. Elliott, M. Giesbrecht and E. Schost.
  Journal of Symbolic Computation, Volume 116, pp. 72-97, 2023.

• Supersingular Isogeny Diffie-Hellman with Legendre Form.
  J. Elliott and A. Hutchinson.
  Cryptology ePrint Archive, July 2022.

• On the Bit Complexity of Finding Points in Connected Components of a Smooth Real Hypersurface.
  J. Elliott, M. Giesbrecht and E. Schost.
  Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'20), July 2020.

Dissertations

• Analysis of Randomized Algorithms in Real Algebraic Geometry.
  MMath Thesis, David R. Cheriton School of Computer Science, University of Waterloo, Aug. 2020.

• Recovery of Exponents of Polynomials of High Degree.
  BSc Honours Thesis, Department of Mathematics, Simon Fraser University, Dec. 2016. 

​​

Presentations 

• Some Applications of Chinease Remainder Theorem Codes with Error-correction.
  J. Elliott and E. Schost.
  Symbolic Computation in Software Science: 10th International Symposium (SCSS 2024), Aug. 28-30, 2024.
  Tokyo, Japan.

• On the Bit Complexity of Some Randomized Algorithms in Real Algebraic Geometry.
  J. Elliott, M. Giesbrecht and E. Schost.
  PhD Seminar, University of Waterloo, Dec. 2023.
  Waterloo, Canada.

• On the Bit Complexity of Some Randomized Algorithms in Real Algebraic Geometry.
  J. Elliott, M. Giesbrecht and E. Schost.
  Polynomial Optimization, Efficiency through Moments and Algebra (POEMA'22), Sept. 2022.
  Paris, France.

• Bit Complexity for Critical Point Computation in Smooth and Compact Real Hypersurfaces.
  J. Elliott and E. Schost.
  Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'19), July 2019.
  Beijing, China.

  • Extended abstract.
    ACM Communications in Computer Algebra, 53(3): 114-117, Dec. 2019

• Recovery of Exponents of Polynomials of High Degree.
  J. Elliott and M. Monagan.
  SFU Symposium on Mathematics and Computation (SFUSMC'16), Aug. 2016.
  Burnaby, Canada. 

Undergraduate Research 

• Evaluating the Performance of Equible
  J. Elliott
  NSERC USRA, technical report, 2015.