Nationality United States Name Robert Sedgewick Education Stanford University | Notable awards ACM Fellow (1997) | |
 | ||
Born December 20, 1946 (age 77) ( 1946-12-20 ) Institutions Princeton UniversityBrown University (1975–85) Books Algorithms in C++ Parts 1‑4, Introduction to Program, An Introduction to the An, Algorithms, Algorithms in C Similar People Philippe Flajolet, Donald Knuth, Roberto Tamassia | ||
Princeton startup tv interview with robert sedgewick
Robert Sedgewick (born December 20, 1946) is an American computer science professor at Princeton University and a member of the board of directors of Adobe Systems.
Sedgewick completed his Ph.D. in 1975 under the supervision of Donald Knuth at Stanford. His Thesis was about the quicksort algorithm. In 1975–85, he served on the faculty of Brown University.
Sedgewick was the founding Chairman (1985) of the Department of Computer Science at Princeton University and is currently still a Professor of Computer Science at Princeton. He was a visiting researcher at Xerox PARC, Institute for Defense Analyses and INRIA.
He along with Leo J Guibas came up with the highly popular data structure Red–black tree in their paper A dichromatic framework for balanced trees in 1978 by adapting the work of Rudolf Bayer. In 1997, Robert Sedgewick was inducted as a Fellow of the Association for Computing Machinery for his seminal work in the mathematical analysis of algorithms and pioneering research in algorithm animation.
Robert Sedgewick is the author of a well-known book series Algorithms, published by Addison-Wesley. The first edition of the book was published in 1983 and contained code in Pascal. Subsequent editions used C, C++, Modula-3, and Java.
Together with Philippe Flajolet, he wrote several books and preprints which promoted analytic combinatorics, a discipline which relies on the use of generating functions and complex analysis in order to enumerate combinatorial structures, and to study their asymptotic properties. As explained by Knuth in The Art of Computer Programming, this is the key to perform average case analysis of algorithms.
He teaches four open online courses on the online learning platform Coursera, namely Algorithms Part I and Part II, Analysis of Algorithms and Analytic Combinatorics.