Quick links

Robert Sedgewick

Photo of Robert Sedgewick
Title/Position
William O. Baker '39 Professor
Degree
Ph.D., Stanford University, 1975
rs  (@cs.princeton.edu) (609) 258-4345 319 Computer Science
Other Affiliations

Research

Interests: Algorithm science, Analytic combinatorics, Data structures
ACM Fellow, 1997

Research Areas:

Short Bio

Robert Sedgewick is the founding chair and the William O. Baker Professor in the Department of Computer Science at Princeton and was a member of the board of directors of Adobe Systems for many years. He previously served on the faculty at Brown and has held visiting research positions at Xerox PARC, IDA, and INRIA. His research expertise is in data structures, algorithm science, and analytic combinatorics. He has also been active for decades in developing the college curriculum in computer science and in innovative uses of technology to propel the dissemination of knowledge.

Prof. Sedgewick is the author of twenty books. He is best known for his Algorithms textbooks, which have been bestsellers for decades and have served generations of students, programmers, and developers. His 2008 book with Philippe Flajolet, Analytic Combinatorics, defines the field and was awarded the Leroy P. Steele prize for mathematical exposition by the American Mathematical Society. With Kevin Wayne, he has developed a scalable model that integrates the textbook, studio-produced online lectures, and extensive online content that has enabled millions of people to learn about algorithms. Their most recently completed project is Computer Science: An Interdisciplinary Approach, built on the same model, which supports teaching and learning for a first course in computer science and is used at educational institutions throughout the world.

Selected Publications

  • “Computer Science: an interdisciplinary approach.” (With K. Wayne). Addison-Wesley, 2016. 1131 pages.
  • “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.
  • http://introcs.cs.princeton.edu​

  • http://algs4.cs.princeton.edu​

  • http://aofa.cs.princeton.edu​

  • http://ac.cs.princeton.edu​

Follow us: Facebook Twitter Linkedin