About me Bio Research Publications Students Teaching Lecture Videos Talks Links

Talks and Posters

2022

Computing with polynomials over algebraic number fields.
Séminaire de Théorie Algorithmique des Nombres, Institut de Mathéematics de Bordeaux, Bordeaux, July 12, 2022.

Computing isomorphisms between algebraic number fields.
Seminar, Laboratoire CRIStAL, University of Lille, Lille, France, July 8, 2022.
Seminar, Department of Mathematics, Western University, London, Ontario, August 2nd, 2022.
Contributed talk, Applications of Computer Algebra (ACA 2022), Gebze, Turkey, August 16th, 2022.
Extended Abstract: On computing isomorphisms between algebraic number fields.

Factoring Non-monic polynomials represented by black boxes.
ISSAC 2022 Poster Session, University of Lille, Lille, July 4–7, 2022.

The recursive dense polynomial data structure.
Computer Algebra Seminar, SFU, April 8, 2022.   Demo (.mw)

Random Polynomial Dilations
Computer Algebra Seminar, SFU, January 22, 2022.

2021

Speeding up polynomial GCD, a crucial operation in Maple
2021 Maple Conference, Online, November 5th, 2021.

2020

The Tangent–Graeffe root finding algorithm.
Number Theory and Algebraic Geometry Group, SFU, November 19th, 2020.

Implementing the tangent Graeffe root finding algorithm.
2020 ICMS Conference, Online, July 17th, 2020. Talk Video (.mp4)

2019

Polynomial Factorization in Maple 2019.
2019 Maple Conference, Waterloo, Ontario, October 16th, 2019. Extended Abstract

Using Leslie matrices as the application of eigenvalues and eigenvectors in a first course in Linear Algebra.
2019 Maple Conference, Waterloo, Ontario, October 16th, 2019.

A new random polynomial time algorithm for factoring sparse multivariate polynomials.
Academy of Mathematics and Systems Sciences, Chinese Academy of Science, Beijing, July 19th, 2019.

Linear Hensel Lifting for ℤ[x] and 𝔽q[x,y] with Cubic Cost.
ISSAC 2019, Beijing, July 16th, 2019.

Using Leslie matrices as an application of eigenvalues and eigenvectors in a first course in Linear Algebra.
Alexander College, Vancouver, May 31st, 2019.

2018

How to factor a multivariate polynomial.
Discrete Mathematics Seminar, SFU, Vancouver, December 3rd, 2018.

Factoring multivariate polynomials with many factors and huge coefficients.
CASC 2018, Lille, France, September 19th, 2018.

Polynomial GCD Computation with Sparse Interpolation.
CASC 2018, Lille, France, September 18th, 2018.

Sparse multivariate polynomial factorization: A high-performance design and implementation.
ICMS 2018, Notre Dame, South Bend, Indiana, July 24th, 2018.

2017

Towards High Performance Multivariate Factorization.
Symbolic Computation Group, University of Waterloo, November 3rd, 2017.

Towards High Performance Multivariate Factorization.
Singular Group, TU Kaiserslautern, July 25, 2017.

2016

A Fast Parallel Sparse Polynomial GCD Algorithm
ISSAC 2016, WLU, Waterloo, Ontario, July 19–22, 2016.

Fast parallel multi-point interpolation of sparse polynomials.
MICA 2016, University of Waterloo, Canada, July 16–18, 2016.

2015

Computing multivariate polynomial GCDs using sparse interpolation: the problem of unlucky evaluation points and evaluation cost.
Symbolic Computation Group, University of Waterloo, October 5, 2015.

Optimizing and Parallelizing the Modular GCD Algorithm
PASCO 2015, Bath, England, July 10, 2015.

2014

Gaston, Maple and Mike
GNOME 2014, Zurich, Switzerland, July 4, 2014.

2013

What's the best data structure for multivariate polynomials in a world of 64 bit multicore computers?"
ECCAD 2013, US Naval Academy, Annapolis, Maryland, April 27, 2013.

2012

POLY: A new data structure for Maple 17 with parallel speedup.
Parallel Computer Algebra, Sophia, Bulgaria, June 28, ACA 2012.

Teaching Commutative Algebra and Algebraic Geometry using Computer Algebra Systems.
Computer Algebra in Education, Sophia, Bulgaria, June 28, ACA 2012.

2011

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.

2010

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.

2009

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.

Solving Linear Systems over Cyclotomic Fields

2008

Sparse polynomial arithmetic part II: A proposal to dramatically speed up polynomials in Maple.
Mathematics of Computer Algebra and Analysis (MOCAA) workshop, London, Ontario, May 7, 2008.

How fast can we multiply and divide sparse polynomials?
Milestones in Computer Algebra (MICA), Tobago, May 1, 2008.

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