Theory Seminar
2005-2006
Academic Year
| Friday,
August 26, 2005 | Theory of Computing Seminar
Adwords and Generalizaed Online Matching Aranyak Mehta, Cornell University 2:00 pm, 4331 CS |
| Wednesday,
September 28, 2005 | Theory of Computing Seminar
Finding points and encoding messages on elliptic curves over characteristic 2 Andrew Shallue, University of Wisconsin 1:00 pm, 3331 CS |
| Monday,
October 3, 2005 | Theory of Computing Seminar
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time Shang-Hua Teng, Boston University and Akamai Technologies 10:00 am, 2310 CS |