Interests: Scientific analysis of algorithms, Analytic combinatorics.
ACM Fellow, 1997
Robert Sedgewick, the William O. Baker Professor in Computer Science, in 1985 was the founding chair of the Department of Computer Science, a position he held until 1994. Before joining Princeton, he was a professor for 10 years at Brown University, where he earned bachelor’s and master’s degrees in applied mathematics. He received his Ph.D. in computer science from Stanford in 1975. Professor Sedgewick’s research interests revolve around algorithm design, including mathematical techniques for the analysis of algorithms. He has published widely in these areas and is the author of 16 books, including a well-known series of textbooks on algorithms that have sold more than one-half million copies and (with P. Flajolet) a research monograph on analytic combinatorics that defines the field. He has held visiting research positions at Xerox PARC in Palo Alto, CA; the Institute for Defense Analyses in Princeton; and Inria in Rocquencourt, France, and has been a member of the board of directors of Adobe Systems since 1990. He chairs steering committees that organize conferences on analytic combinatorics, analysis of algorithms, and data structures throughout the world. With Kevin Wayne, he has developed four MOOCs (which have attracted over one million registrants) and extensive associated online conten (which attracts millions of page visits per year).
- “An Introduction to Programming (in Python); an interdisciplinary approach.” (With K. Wayne and R. Dondero). Addison-Wesley, 2015. 771 pages.
- “An Introduction to the Analysis of Algorithms, 2nd Edition.” (With P. Flajolet). Addison-Wesley, 2013. 604 pages.
- “Algorithms, 4th Edition.” (With K. Wayne). Addison-Wesley, Reading, MA, 2011. 975 pages.
- “Analytic Combinatorics.” (With P. Flajolet). Cambridge University Press, 2009. 824 pages.
- “An Introduction to Programming (in Java); an interdisciplinary approach.” (With K. Wayne). Addison-Wesley, 2007. 723 pages.