Algorithms for the Masses

  • warning: Parameter 1 to theme_field() expected to be a reference, value given in /site/web/www/includes/theme.inc on line 170.
  • warning: Parameter 1 to theme_field() expected to be a reference, value given in /site/web/www/includes/theme.inc on line 170.
  • warning: Parameter 2 to usernode_link() expected to be a reference, value given in /site/web/www/includes/module.inc on line 406.
04/09/2012 - 11:00
04/09/2012 - 14:00

4th Annual Jay Modi Memorial Lecture & Reception

Dr. Robert Sedgewick
William O. Baker Professor
Department of Computer Science
Princeton University

Jay Modi Award Ceremony:
11 to 11:15 a.m.

Lecture:
11:20 a.m. to 12:30 p.m.

Reception:
12:30 to 2 p.m.

Location:
Behrakis Grand Hall
Creese Student Center
3210 Chestnut Street, Philadelphia

Algorithms for the Masses

Abstract:
Before the advent of computing, a standard science and mathematics curriculum emerged in secondary education, supported and expanded by first-year college courses, that serves as the technical basis for every student in science and engineering. For whatever reason, we have seen two unfortunate developments at the dawn of the new millenium. First, many computer science students have somehow been exempted from having to know basic precepts of science (instead, they learn about developing large programs and about theoretical issues). Second, many students in science and engineering have somehow been exempted from being exposed to basic precepts of computer science and algorithmics (instead, they learn a few specific programming tools). In both cases, students are being shortchanged.

This talk will be a progress report on nearly four decades of work towards bringing the study of algorithms into the mainstream, with diversions into computer science education, research on analytic combinatorics, and speculation on the future of publishing, all with significant implications for algorithms research. First, applications from all fields of science and engineering now provide direct motivation for the study of algorithms, and a host of fascinating problems that students can address by implementing algorithms on their own computers. Second, analytic combinatorics now gives universal laws of sweeping generality that provide the key insights needed to understand algorithm performance from a scientific viewpoint. Third, the web now enables researchers to easily share problems, data, and algorithm implementations. Applying and developing effective algorithms is now the path of choice to address a broad variety of complex problems that face modern researchers in all fields—-our task is to provide them both with an appreciation for algorithm design as an intellectual endeavor and with the algorithms that they need.

The bottom line is that integrating the study of algorithms into the education of every student (and thus making modern scientists and engineers as comfortable with computational models as with mathematical models) is now much easier than it might seem. The growing number of people who can take advantage of this knowledge hold the key to the future.

Bio:
Robert Sedgewick is William O. Baker Professor of Computer Science at Princeton and a member of the board of directors of Adobe Systems. Prof. Sedgewick’s research interests include mathematical techniques for the analysis of algorithms, design of data structures and algorithms, and program visualization. He has published widely in these areas and is the author of several books, including a well-known series of textbooks on algorithms that have sold over one-half million copies. The 4th edition of “Algorithms” (completely rewritten, with K. Wayne) was published in 2011. His other recently published books are “An Introduction to Programming in Java: An Interdisciplinary Approach” (with K. Wayne) in 2007 and “Analytic Combinatorics” (with P. Flajolet) in 2009.

Learn more about Dr. Robert Sedgewick and his research interests here [External Link].

Find more information about the Jay Modi Memorial Lecture here.

Video of this presentation is available here [External Link].