Presentation topics.  

Each student choose one topic for a half hour presentation within the next 4 weeks.  
Communicate your choice by email to saunders@udel.edu or face-to-face discussion by Friday, Sept 19. 


			Poly side
square free factorization (14.6) - Saunders (Sept16++)
distinct degree factorization (14.2) - Haripriya Chakraborty (Sept23)
equal degree factorization (14.3 ++)- Andy Novocin (Sept18)
OpenCL - Taylor Baldwin
Pade approximation (5.9) - ?
FFT (8.2) - Patrick Cesarz
Fast multipoint evaluation (10.1) - ?
Fast interpolation (10.2) - Chris Ulicny
Fast EEA (11.1) - Saunders
Real root isolation - Alex Stachnik (Oct 7)

Short vectors in lattices - Andy Novocin (Sept 30)

			Matrix side
Strassen's matrix mul alg (12.1) - Abhishek Kolagunda
fraction free elimination (Bareiss) - ?
sparse fraction free elimination (Lee-S) - ?
Minimal poly of linearly recurrent sequence (12.3, Berlekamp, Massey) - ?
Wiedemann's alg for minpoly (12.4, Wiedemann) - ?
linear system solving, rank, determinant via Wiedemann's(12.4, Wiedemann, KaSa) - Guoyu Lu
Four Russian's matrix multiplication over tiny fields - Matthew Lambert

Presentation guidelines:  
1. Clearly express the algorithm under discussion.
2. Illustrate it's functioning/issues with well chosen example(s).
3. Convince us of it's correctness.  This can be informal or theorem/proof.
4. Analyze it's resource use, time (and possibly memory) usage as a function of instance size.
This may be big-O, soft-O, or hard-O, argument may be informal or theorem/proof.
Depending on the problem, time may constrain how much you do of #3 or #4.  Select judiciously.

Ordering of presentations
Sep 23:  Haripriya Chakraborty, distinct degree factorization (14.2) 
Sep 30: Novocin on char zero factorization (Sept30)
Oct  7: Alex Stachnik, Real root isolation 
Oct  9: Patrick Cesarz, FFT
Oct  9: BDS, Wiedemann's minpoly algorithm.
Oct 14: Guoyu Lu, rank, determinant via Wiedemann's(12.4, Wiedemann, KaSa, Chen et al) 
Oct 16: Abhishek Kolagunda, Strassen's matrix mul alg (12.1) 
Oct 21: Matthew Lambert, Four Russian's matrix multiplication over tiny fields 
Oct 23: Chris Ulicny, Fast interpolation (10.2) 
Oct 28: Taylor Baldwin, OpenCL