Theory Day Speaker 1 - What Makes an Algorithm Great?

Other Talks
Saturday, October 24, 2009 - 12:30
2 hours
LeCraw Auditorium
Electrical Engineering and Computer Sciences, University of California, Berkeley
 From time to time a new algorithm comes along that causes a sensation in theoretical computer science or in an area of application because of its resolution of a long-standing open question, its surprising efficiency, its practical usefulness, the novelty of its setting or approach, the elegance of its structure, the subtlety of its analysis or its range of applications. We will give examples of algorithms that qualify for greatness for one or more of these reasons, and discuss how to equip students to appreciate them and understand their strengths and weaknesses.