A Closer Look at Computing: The Million-Dollar Algorithms

(free and open to the public;
high school students/parents/teachers/administrators are particularly welcome)

Philip Chan and Ryan Stansifer (Florida Tech)
March 24, Friday, 7-8pm, Auditorium (Room 130), Olin Life Sciences, Florida Tech

Materials from the lecture: Stable Marriage, Ranking Web Pages and Mystery Problem

Flyer

Directions to Florida Tech campus
(search for and select Olin Life Sciences--button for directions is under the description of the building)

Campus map in PDF (Building 35 is Olin Life Sciences Building)

Press Release

Speakers from the School of Computing at Florida Tech will discuss the impact that computational advances have on society. These computational ideas have launched industries, promoted social stability, and earned Nobel Prizes. We will discuss the stable marriage and web page ranking problems. Algorithms for both problems not only have continuing impact on society, they also have earned fame and fortune. Furthermore, we will discuss a third problem of great significance, for which a million-dollar prize awaits the person who creates a practical algorithm.

P.S. In the same evening, a public science lecture on astronomy is at 8pm and viewing from a 0.8-meter (32-inch) telescope is at 9pm (more details are at http://cos.fit.edu/pss/aapls.php).

About the speakers:

Philip Chan is a faculty member in computer science at Florida Tech. His main research interests include machine learning and data mining.

Ryan Stansifer is a faculty member in computer science at Florida Tech. His main research interests are in programming languages, especially type theory and functional language. He hopes to strengthen problem solving abilities in his students through intercollegiate programming competitions.

Previous community lectures