Applied Math Colloquium Schedule (Spring 2001)

Most talks are at 4:15 pm in Room 2-105. Refreshments are typically served at 3:45 pm in Room 2-349. For more information, contact the organizers, Michael Brenner and Daniel Spielman.

An index of past Applied Math Colloquia is available here

Spring 2001 talks schedule

Feb 12: No Colloquium
Feb 19: Presidents day
Feb. 26: Andris Ambainis, University of California, Berkeley
- Quantum Computing With Highly Mixed States
March 5: Daniel Spielman, M.I.T., Cancelled due to snow!
March 12 : Mike Shelley, CIMS
March 19: Steve Morris, Toronto
March 26: spring break
April 2: Craig Tracy, U.C. Davis
- Recent Progress in Growth Processes
April 9: Steve Davis, Northwestern
April 16: Patriot's Day
April 23 : Uzi Landman, Georgia Tech
Friday, April 27 : Daniel Spielman, M.I.T. Special joint Colloqium with Combinatorics Seminar.
- Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time.
April 30 : Percy Deift, Courant Institute and University of Pennsylvania
- Identities for Toeplitz determinants and the convergence of moments for random Young diagrams
May 7: Russell Lyons, Indiana University and Georgia Tech, visiting U. C. Berkeley
- Random Spanning Trees, Random Walks, and Electric Networks
May 14: John Bush, MIT

MIT Math Department Home Page.