History of Algorithms: The Worst Case and Beyond

Computer scientists tend to have a rather demanding perspective when it comes to algorithms: we expect them to be both accurate and efficient, and moreover in every conceivable situation. These constraints have steadily driven some of the most exciting developments in the design of algorithms, even in the backdrop of fundamental mysteries about the potential and limitations of computational power. This talk will begin with the early days of algorithm design and then fast forward to contemporary ideas that have gone beyond the worst-case frameworks and are rapidly evolving to help us make sense of why some things work, even when we don't expect them to, and, sometimes, vice-versa.