CECM | CAG | Department of Mathematics | SFU | MITACS | IRMACS | PIMS

About me Research Publications Students Teaching Talks Links

Selected Talks

  • Towards High Performance Multivariate Factorization.
    Singular Group, TU Kaiserslautern, July 25, 2017.
  • A Fast Parallel Sparsee 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.
  • 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.
  • Gaston, Maple and Mike
    GNOME 2014, Zurich, Switzerland, July 4, 2014.
  • 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.
  • 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.
  • 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