Hello, the CSC is hosting a talk entitled "The Best Algorithms are Randomized Algorithms" on 2010-02-23 at 04:30 PM in MC5136B. It will be presented by Dr. Nicholas Harvey. Talk Abstract: For many problems, randomized algorithms are either the fastest algorithm or the simplest algorithm; sometimes they even provide the only known algorithm. Randomized algorithms have become so prevalent that deterministic algorithms could be viewed as a curious special case. In this talk I will describe some startling examples of randomized algorithms for solving some optimization problems on graphs. Light refreshments will be provided and I hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.