This page always under construction (even though it is an oldschool page that needs work).
Robert Sedgewick
Department of Computer Science
Princeton University
Princeton, NJ 08544
rs@cs.princeton.edu
Primary professional activities
Booksites
Recent books
 Algorithms, 4th edition , with Kevin Wayne
 Analytic Combinatorics, with Philippe Flajolet
 An Introduction to Programming in Java: An Interdisciplinary Approach , with Kevin Wayne
 Algorithms in Java, Part 5 (Graph Algorithms)
(code,
errata)
 Algorithms in Java, Parts 14 (Fundamental Algorithms, Data Structures, Sorting, Searching)
(code,
errata)
 Algorithms in C++, Part 5 (Graph Algorithms)
(code,
errata)
 Algorithms in C, Part 5 (Graph Algorithms)
(code,
errata)
 Algorithms in C++, Parts 14 (Fundamental Algorithms, Data Structures, Sorting, Searching)
(code,
errata)
 Algorithms in C, Parts 14 (Fundamental Algorithms, Data Structures, Sorting, Searching)
(code,
errata)
 An Introduction to the Analysis of Algorithms, with Philippe Flajolet
 Algorithms in C++ (second edition)
Works in progress
Recent talks

A 21st Century Model for Disseminating Knowledge,
Dagstuhl Workshop on Data Structures, Wadern, Germany, March, 2016.
 Computer Science for the Masses,
ACMIEEECS Meeting, Computer Science Education Week,
Princeton, December, 2015.
 If You Can Specify It, You Can Analyze It  The Lasting Legacy of Philippe Flajolet,
SODA, New Orleans, January, 2013; Vienna Center for Logic and Algorithms, Vienna University of Technology, May 2013; dedication of the Bibliotheque universitaire de Versailles to Philippe Flajolet, May, 2013; CanaDAM, Newfoundland, June 2013; LATIN, Montevideo, Uruguay, April, 2014.

Taking Education Online: A Unique Opportunity for the New Millenium,
(alternate title Analytic Combinatorics for the Masses),
Combinatorial Probability and Statistical Mechanics Workshop,
Queen Mary University of London, February, 2013;
Colloquium d'informatique de
Université Pierre et Marie Curie – Sorbonne Universités, Paris, May 2013;
24th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Menorca, May 2013;
Center for Information Technology Policy Lecture Series, Princeton University, October 2013;
Universidad de la República Faculty of Engineering, Montevideo, Uruguay, April, 2014; NYU Polytechnic School of Engineering, Brooklyn, NY, April, 2015.
 From Analysis of Algorithms to Analytic Combinatorics,
DIMACS, December, 2011; PFAC conference, Paris, December, 2011; Drexel University, February, 2012; Stanford University, April, 2012.
 Algorithms for the Masses,
ANALCO'11, San Francisco, January, 2011; Modi Memorial Lecture, Drexel University, April, 2012.
 Putting the Science back into Computer Science,
CS Colloquium, Rutgers University, November, 2010.
 The Role of the Scientific Method in Programming,
Colloquium on Computer Science Pedagogy, CarnegieMellon University, March, 2010.
 Impatiemment Attendu, Philippe Flajolet 60th birthday celebration, Paris, December, 2008.
 LeftLeaning RedBlack Trees, Combinatorics and Probability Seminar, University of Pennsylvania, October, 2008.
 LeftLeaning RedBlack Trees, Workshop on Analysis of Algorithms, Maresias, Brazil, April, 2008.
 LeftLeaning RedBlack Trees, Dagstuhl Workshop on Data Structures, Wadern, Germany, February, 2008.
 The Role of the Science and Mathematics in Software Development,
Purdue University, West Lafayette, IN, November, 2007.
 The Role of the Scientific Method in Software Development,
Adobe Systems, San Jose, CA, April, 2007.
 Creating "Algorithms", Adobe Systems, San Jose, CA, December, 2002; Tufts University,
Medford, MA, May, 2003.
 Finding Paths In Graphs,
Adobe Systems India, January, 2007;
based on earlier talks at
2005 International Conference on the Analysis of Algorithms, Barcelona, June, 2005, Dagstuhl Workshop on Data Structures, Wadern, Germany, February, 2004, and OttawaCarleton Discrete Math Day, April, 2004.
 Creating "Algorithms", Adobe Systems, San Jose, CA, December, 2002; Tufts University,
Medford, MA, May, 2003.
 Permutation generation methods,
Dagstuhl Workshop on Data Structures, Wadern, Germany, February, 2002.
 Quicksort is optimal, Knuthfest, Stanford University, January, 2002.

New research on the theory and practice of sorting
(math supplement)
Universite du Quebec a Montreal, April 27, 2001;
New York Academy of Sciences, February 8, 2000;
Ecole Polytechnique, Paris, France, May 25, 1999.
 Visualizing the analysis of algorithms, Fourth International Workshop on the Analysis of Algorithms, Princeton University, July 20, 1998.
 Online knowledge and the incandescent future of the university, Assembly of the Class of 2001, Princeton University, September 7, 1997.
 Open problems in the analysis of sorting and searching algorithms, Workshop on the probabilistic analysis of algorithms, Princeton, May, 1997.
 Sorting and searching strings, Eighth Symposium on Discrete Algorithms, New Orleans, January, 1997.
 Analysis of shellsort and related algorithms, Fourth European Symposium on Algorithms, Barcelona, September, 1996.
Princeton course development
Other professional activities
Past professional appointments
 Founding Chair, Department of Computer Science, Princeton University (198594)
 Professor at Brown University, Providence, RI (197585)
 Visiting staff at Xerox PARC, Palo Alto, CA (1978, 1979)
 Visiting staff at INRIA, Rocquencourt, France (198283, 1990)
 Visiting staff at IDA, Princeton New Jersey (1978, 1979, 1983, 1990, 1994, 1997)
 Computer Science GRE Committee, Educational Testing Service (19861996)
Selected papers
 "Mellin transforms and asymptotics: finite differences and Rice's
integrals" (with P. Flajolet) Theoretical Computer Science A
144, 1995.
 "The analysis of Heapsort" (with R. Schaffer),
J. of Algorithms 13, 1993.
 "Deterministic skip lists" (with I. Munro and T. Papadakis),
Proc. 3rd ACMSIAM Symp. on Discrete Algorithms, 1992.
 "Tight lower bounds for Shellsort" (with M. Weiss),
J. of Algorithms 11, 1990.
 "Pairing heaps: a new form of selfadjusting heap,"
(with M. Fredman, D. Sleator, and R. E. Tarjan)
Algorithmica 1, 1, 1986.
 "Digital search tree analysis revisited" (with P. Flajolet),
SIAM J. Computing 15, 2, 1986.
 "Shortest paths in euclidean graphs" (with J. Vitter),
Algorithmica 1, 1, 1986.
 "A new upper bound for Shellsort,"
Journal of Algorithms 7, 1986.
 "Improved Upper Bounds for Shellsort" (with J. Incerpi),
J. Computer and System Sciences 31, 2, 1985.
 "A system for algorithm animation" (with M. Brown)
Computer Graphics 18, 3, 1984.
 Technical reports and old papers
General description of research goals
Finding efficient algorithms for fundamental practical problems by
studying important algorithms at all levels through the
designanalysisimplementation cycle. Validating theoretical designs
through practical implementations; uncovering fundamental properties
of algorithms through careful mathematical performance analyses;
comparing algorithms through careful implementation studies.
Developing general mechanisms relating algorithms, data structures,
generating functions and analytic functions such that asymptotic results
useful in predicting performance of the algorithms can be derived
automatically and economically.
Investigating the way in which visual representations can provide an
understanding of how algorithms gain efficiency, including
dynamic graphical simulations of algorithms in operation and
highquality static representations suitable for use in
publications.
Robert Sedgewick