Michael Monagan, Simon Fraser University (3 lectures, 6 hours)
Lecture 1A : Brown's modular GCD algorithm: Algorithm MGCD, unlucky primes. Video
Lecture 1B : Brown's modular GCD algorithm: Algorithm PGCD, unlucky evaluation points. Video
Uses the Gelfond and Mignotte factor height bounds.Lecture 2 : Zippel's sparse modular GCD algorithm. Solving (shifted) Vandermonde systems. Video
Lecture 3A : The Ben-Or/Tiwari sparse polynomial interpolation algorithm. Video
Lecture 3B : Ben-Or/Tiwari using discrete logarithms. The Black Box representation for polynomials. Video