I can supervise graduate students at Simon Fraser University in computer algebra at the Ph.D. and Masters' level in either mathematics or applied mathematics. I am looking for one Ph.D. student or a Masters student who wants to do a Ph.D. Students should contact me directly by Email.

For details of my current research projects, please see my recent publications.

### Graduate Students

- Gabriel Henderson, MSc. in pure mathematics, in progress.

- Garrett Paluck, MSc. in pure mathematics, in progress.

- Jiaxiong (Lucas) Hu. Ph.D. in pure mathematics, in progress.

- Justine Gauthier, MSc. in pure mathematics, August 2017.
- Fast Multipoint Evaluation on n Arbitrary Points.

- John Kluesner, MSc. in pure mathematics, August 2017.
- Resolving zero divisors of radical triangular sets using Hensel lifting and applications.

- Hao Ze. MSc. in pure mathematics, August 2017.
- Fast power series inversion: Newton's iteration and the middle product optimization.

- Yusuf Baris Tuncer. Ph.D. in pure mathematics, August 2017.
- Solving Multivariate Polynomial Diophantine Equations and their Role in Multivariate Polynomial Factorization.

- Marshall Law, MSc. in pure mathematics, April 2017.
- Computing Characteristic Polynomials of Matrices of Structured Polynomials

- Soo Go. M. Sc. in pure mathematics, July 2012.
- Sparse Polynomial Interpolation and the Fast Euclidean Algorithm.

- Steven Kieffer. M.Sc. in pure mathematics, April 2012.
- Computability in Principle and in Practice in Algebraic Number Theory: Hensel to Zassenhaus.

- Cory Ahn. M.Sc. in pure mathematics, December 2011.
- Fast polynomial multiplication over algebraic number fields.

- Andrew Arnold. M.Sc. in pure mathematics, January 2011.
- Algorithms for Computing Cyclotomic Polynomials.

- Mahdi Javadi. Ph.D. in computing science, January 2011.
- Efficient Algorithms for Calculations with Sparse Polynomials

- Chelsea Richards. M.Sc. in pure mathematics, August 2009.
- Algorithms for Factoring Square-free Polynomials over Finite Fields.

- Suling Yang. M.Sc. in pure mathematics, April 2009.
- Computing GCDs of Multivariate Polynomials over Finite Fields.

- Paul Vrbik. M.Sc. in pure mathematics, December 2008.
- Delayed Polynomial Arithmetic and Applications.

- Liang Chen. M.Sc. in computer science, August 2007.
- Solving Linear Systems over Cyclotomic Fields.

- Mahdi Javadi. M.Sc. in computer science, November 2006.
- A Sparse Modular GCD Algorithm for Polynomials over Algebraic Function Fields.

- Aaron Bradford.
M.Sc. in pure mathematics, April 2006.
- Computing Discrete Logarithms in GF(p).

- Sara Khodadad.
M.Sc. in computer science, November 2005.
- Fast Rational Function Reconstruction.

- Roman Pearce. M.Sc. in pure mathematics, August 2005.
- Rational Expression Simplification with Polynomial Side Relations.

- Allan Wittkopf. Ph.D. in applied and computational mathematics, October 2004.
- Algorithms and Implementations for Differential Elimination.

- Stephen Tse. M.Sc. in computing science, July 2002.
- Algorithms and Bounds for Resultants.

- Jennifer de Kleine. M.Sc. in computing science, 2001.
- A Modular Design and Implementation of Buchberger's Algorithm.

- Laurent Bernardin. Ph.D. in computer science, ETH Zentrum, September 1999.
- Factorization of Multivariate Polynomials over Finite Fields.

### Undergraduate Students

- Jesse Elliott, NSERC 2016.
- Analysis of Algorithms.

- Alex Fan, RA 2016.
- Sparse Interpolation.

- Alan Wong, RA 2016.
- Parallel algorithms for polynomial GCDs.

- Adriano Arce, VPR 2015.
- Discrete Logarithms.

- Hao Zhuang, USRA 2015.
- FFT over Finite Fields.

- Marshall Law, NSERC 2014.
- FFT multiplication mod p in parallel.

- Casie Bao, VPR 2014.
- Measuring river flow (discharge).

- Mathew Gibson, NSERC 2013.
- Algorithms for GCDs over finite fields.

- Alan Wong, NSERC 2013.
- Computing Tutte polynomials.

- Shraddha Ramesh, NSERC 2011.
- Algorithms for finite groups.

- Jaiganesh Balasundarum, MITACS Globalink 2011.
- Fast polynomial arithmetic.

- Stephen Melczer, NSERC 2010.
- Algebraic geometry.

- Julian Sahrasbuhde, NSERC 2009.
- Graph theory.

- Bill Bao, NSERC 2009.
- Scientific computing.

- Asif Zaman, NSERC 2008.
- Computational group theory.

- Andrew Arnold, NSERC 2007.
- Graph theory and number theory.

- Simon Lo, NSERC, 2006.
- Graph theory.

- Al Erickson, NSERC, 2006.
- Graph theory and polynomial factorization.

- Simon Lo, NSERC, 2005.
- Computer algebra.

- Mohammed Ebrahimi, NSERC, 2005.
- Scientific computing.

- Howard Liu, NSERC, 2005.
- Numerical integration and differentiation.

- Al Erickson, NSERC, 2005.
- Computer algebra.

- Simon Lo, NSERC, 2004.
- Computational linear algebra.

- Mohammed Ebrahimi, NSERC, 2004.
- Visualizations for differential equations in Maple.

- Scott Cowan, NSERC, 2003.
- Computational problems in cryptography and algebra.

- Aaron Bradford, NSERC, 2002.
- Evaluating definite integrals.

- Roman Pearce, NSERC, 2001.
- Groebner bases and ideal theoretic operations.

- George Zhang, NSERC, 2001.
- Algorithms for testing ideals for primality and maximality.

- Jamie Mulholland, NSERC, 2001
- Algorithms for trigonometric polynomials.

- Craig Pastro, NSERC, 2000.
- The Modular GCD algorithm over algebraic number fields.

- Michael Ludkovski, Directed Studies, 1999.
- Brown's and Zippel's modular GCD algorithms.

- Mark Siggers, Directed Studies, 1999
- Univariate Hensel lifting over Euclidean domains.

- Colin Percival, Career Prep, 1998.
- Polynomial GCDs over algebraic number fields.

- Rene Rodoni, Diplomarbeit, ETH Zurich, 1995.
- An Implementation of the Forward adn Reverse Mode in Maple.

- Roger Margot, Diplomarbeit, ETH Zurich, 1995.
- Univariate polynomial GCD's over Q(alpha).

- Igor Berchtold, Diplomarbeit, ETH Zurich, 1993.
- Sparse Matrix Determinants over Integral Domains.

- Laurent Bernardin, Diplomarbeit, ETH Zurich, 1993.
- Factorization of multivariate polynomials over a finite field.

- Walter Neuenschwander, Diplomarbeit, ETH Zurich, 1992.
- Algorithmische Differentiation.

- Stefan Schwendimann, Diplomarbeit, ETH Zurich, 1992.
- Ein Softwarepaket fuer die algebraische, projektive Geometrie.