About me Research Publications Students Teaching Talks Links

Recent Talks

Computing Tutte Polynomials
Symbolic Computation Group Seminar, Waterloo, November 29, 2011.

Graph Theory and Polynomial Interpolation
Maplesoft, Waterloo, November 28, 2011.

Faster computation of roots of polynomials over F_q
ICIAM minisymposium on ``Polynomial and Computational Challenges in Computer Algebra'', Vancouver, July 18, 2011.

Sparse Polynomial Interpolation
Presented at JonFest, Vancouver, May 16–20, 2011. A workshop on computational and analytical mathematics in honor of Jonathan Borwein's 60th birthday. Video of talk.

Polynomial Interpolation
Computers and Mathematics Day, Vancouver, August 12, 2010.

Sparse Polynomial Multiplication and Division in Maple 14.
ISSAC 2010 Software Presentation session, Munich, July 26th, 2010.

Parallel Sparse Polynomial Interpolation over Finite Fields
Parallel Algorithms in Symbolic Computation (PASCO). Grenoble, France, July 22nd, 2010.

How fast can we multiply and divide sparse polynomials?
Japanese Society for Symbolic and Algebraic (JSSAC) annual workshop on computers and mathematics, Toho University, Japan, December 19th, 2009.

In-place Arithmetic Algorithms for Computing over Number Fields.
ASCM '09, December 14-17th, Fukuoka, Japan, 2009.

How fast can we multiply and divide sparse polynomials?
Scientific Computing in Applied and Industrial Mathematics (SCAIM) seminar, University of British Columbia, Vancouver, October 16th, 2009.

Computing cyclotomic polynomials of very large and very small height.
Workshop on Discovery and Experimentation in Number Theory, Simon Fraser University, September 22-26, 2009.

p. (778) 782-4279 · f. (778) 782-4947 · Shrum Science K 10501 · Department of Mathematics · 8888 University Drive · Burnaby · BC · V5A 1S6 · Canada