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

Conference Papers, Journal Articles, and Preprints

• Primes of Bad Reduction for Systems of Polynomial Equations
  J. Elliott and E. Schost.
  Journal of Symbolic Copmutation (Under Review)

• Refined Bit Complexity for the Computation of at Least One Point per Connected Component of a Smooth Complete Intersection Real Algebraic Set
  J. Elliott, M. Giesbrecht, E. Gillot, M. Safey El Din (PolSys), and É. Schost
  Journal of Symbolic Copmutation (Under Review)

• Computing \(2^a\)-isogenies in Legendre Form
  J. Elliott, A. Hutchinson, and D. Jao
  Mathematics of Cryptography Workshop 2025 (To Appear)

• Some Applications of Chinese Remainder Theorem Codes with Error-Correction
  J. Elliott and E. Schost
  Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'25)

• 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

• 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)

Talks, Posters, and Short Papers

• Some Applications of Chinese Remainder Theorem Codes with Error-Correction
  Proceedings of the 50th International Symposium on Symbolic and Algebraic Computation, July 2025
  Guanajuato, Mexico 

• Sampling One Point per Connected Component of a Smooth Real Complete Intersection  
  Institut de Mathématiques de Jussieu–Paris Rive Gauche (Combinatorics & Optimization), June 2025  
  Paris, France

• Feasibility, Connectivity, and Bit Complexity in Real Algebraic Geometry  
  Institut de Mathématiques de Jussieu–Paris Rive Gauche (Ouragan), June 2025  
  Paris, France

• Bit Size Estimates for Computing Roadmaps in Smooth Bounded Real Hypersurfaces
  University of Waterloo (PhD Seminar), Feb. 2025
  Waterloo, Ontario

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

  • Short paper
    SCSS (Work in Progress) 2024: 13-18

• On the Bit Complexity of Some Randomized Algorithms in Real Algebraic Geometry
  PhD Seminar, University of Waterloo, Dec. 2023
  Waterloo, Canada

• On the Bit Complexity of Some Randomized Algorithms in Real Algebraic Geometry
  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

Dissertations

• On the Complexity of Feasibility, Connectivity, and \(2^a\)-isogeny Computation
  PhD Thesis, David R. Cheriton School of Computer Science, University of Waterloo, April 2025

• 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 

Undergraduate Research 

• Evaluating the Performance of Equible
  J. Elliott
  NSERC USRA, Knowledge Representation and Reasoning, 2015