Robert Sedgewick

Robert Sedgewick studied at Stanford University and Wheaton High School. The recorded working language is English. The field of work recorded is computer science. Employment is recorded with Brown University and Princeton University. Distinctions recorded are ACM Fellow and Steele Prize for Mathematical Exposition.

• Name — Robert Sedgewick • Born — 20 December 1946 • Birthplace — Willimantic, Connecticut, United States • Field — Computer science • Workplaces — Princeton University Brown University (1975–85) • Education — Brown University (B.S.; M.S.) Stanford University (Ph.D.) • Doctoral Advisor — Donald Knuth • Thesis Title — Quicksort • Thesis Year — 1975 • Thesis Url — http: searchworks.stanford.edu/view/870273 • Awards — ACM Fellow (1997), Flajolet Prize, Leroy P. Steele Prize, and Karlstrom Award Robert Sedgewick (born December 20, 1946) is an American computer scientist. He is the founding chair and the William O. Baker Professor in Computer Science at Princeton University[1] and was a member of the board of directors of Adobe Systems (1990–2016).[2] He previously served on the faculty at Brown University and has held visiting research positions at Xerox PARC, Institute for Defense Analyses, and INRIA.[3] His research expertise is in algorithm science, data structures, and analytic combinatorics. He is also active in developing college curriculums in computer science.[4]

Sedgewick was born on December 20, 1946, in Willimantic, Connecticut. During his childhood he lived in Storrs, Connecticut, where his parents Charles Hill Wallace Sedgewick and Rose Whelan Sedgewick were professors at the University of Connecticut.[5] In 1958, he moved with his parents to Wheaton, Maryland, a suburb of Washington, D.C., where he attended Wheaton High School, graduating in 1964.

Sedgewick earned his Bachelor of Science (1968) and Master of Science (1969) degrees in applied mathematics from Brown University, where he was a student of Andries van Dam. He went on to graduate work at Stanford University where he was an advisee of Donald E. Knuth, receiving his PhD in 1975.[6] His thesis was entitled Quicksort and was named an outstanding dissertation in computer science.[7]

Sedgewick returned to Brown to start his academic career as an assistant professor in 1975, with promotion to associate professor in 1980 and full professor in 1983. At Brown, he participated in the founding of the computer science department, in 1979.[8] In 1985, Sedgewick joined the faculty at Princeton University as founding chair of the Department of Computer Science[9] where he later became the William O. Baker '39 Professor of Computer Science.[10] The first-year courses in computer science that he developed at Princeton became quite popular.[11] He also replaced live lectures with on-demand online videos.[12] Throughout his career, he has worked at research institutions outside of academia during summers and sabbatical leaves: • The Communications Research Division of the Institute for Defense Analyses in Princeton, New Jersey, working on the CRAY-1 supercomputer. • Xerox Palo Alto Research Center (PARC) with some of the early personal computers • The Institut National de Recherche en Informatique et en Automatique (INRIA) in France, in collaboration with Philippe Flajolet.

Sedgewick developed red–black trees (with Leonidas J. Guibas),[13] ternary search trees (with Jon Bentley),[14] and pairing heaps (with R. E. Tarjan and Michael Fredman).[15] He solved open problems left by Donald Knuth in the analysis of quicksort,[16] shellsort, heapsort (with R. Schaffer),[18] and Batcher's sort.[19] With Philippe Flajolet, he developed the field of mathematics known as analytic combinatorics. He has organized research meetings and conferences on data structures, algorithm science, and analytic combinatorics around the world, including Dagstuhl seminars on analysis of algorithms and data structures,.[20] In particular, in 1993, together with Rainer Kemp, Philippe Flajolet and Helmut Prodinger, he initiated a series of workshops and conferences which was key to the development of a research community around the analysis of algorithms, and which evolved into the AofA—International Meeting on Combinatorial, Probabilistic, and Asymptotic Methods in the Analysis of Algorithms. Robert Sedgewick was also the main proponent and organizer of the first editions of the SIAM Meetings on Analytic Algorithmics and Combinatorics (ANALCO),[21] a series of meetings annually held from 2004 to 2019, co-located with the Symposium on Discrete Algorithms (SODA).

Sedgewick is the author of twenty books, including Algorithms,[22] originally published in 1983. His 2008 book with Philippe Flajolet, Analytic Combinatorics,[23] was awarded the Leroy P. Steele Prize for mathematical exposition by the American Mathematical Society.[24] More recently, he co-authored with Kevin Wayne the book Computer Science: An Interdisciplinary Approach.[25]

Sedgewick has developed massive open online courses in his area.[26] With Kevin Wayne, he developed a model that integrates the textbook, studio-produced online lectures, and online content.[29] These have had over one million registrants.[31] He advocates for expanding the reach of computer science,[32] with essays published in the Wall Street Journal[35] and Inside Higher Ed.[36]

According to his personal website, Sedgewick lives in Princeton, New Jersey and spends summers in Jamestown, Rhode Island with his wife Linda (née Migneault), married in 1971. They have four children.[40]