Fannie and John Hertz Fellowship, Hertz Foundation, 1973–1975.

Outstanding Dissertation in Computer Science, Garland Publishing, 1976.

ACM Fellow, Association for Computing Machinery, 1997.

School of Engineering and Applied Science Excellence in Teaching Award, Princeton University, 1998.

Phi Beta Kappa Teaching Award, Princeton University chapter, 2014.

Flajolet Lecture Prize, International Conference on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms, 2016.

Best of Computing Notable Book Award, Association for Computing Machinery, 2016.

Leroy P. Steele Prize for Mathematical Exposition, American Mathematical Society, 2019.

Karl V. Karlstrom Outstanding Educator Award, Association for Computing Machinery, 2019.

Computer Science: An Interdisciplinary Approach (with K. Wayne). Addison-Wesley, Reading, MA, 2016, 1131 pp.

Introduction to Programming in Java: An Interdisciplinary Approach, Second Edition (with K. Wayne). Addison-Wesley, Reading, MA, 2016, 713 pp.

Introduction to Programming in Python: An Interdisciplinary Approach (with K. Wayne and R. Dondero). Addison-Wesley, Reading, MA, 2015, 771 pp.

An Introduction to the Analysis of Algorithms, Second Edition (with P. Flajolet). Addison-Wesley, Reading, MA, 2013, 572 pp.

Algorithms, Fourth Edition (with K. Wayne). Addison-Wesley, Reading, MA, 2011, 955 pp.

Analytic Combinatorics (with P. Flajolet). Cambridge University Press, 2009, 824pp.

Introduction to Programming in Java: An Interdisciplinary Approach (with K. Wayne). Addison-Wesley, Reading, MA, 2008, 723 pp.

Algorithms, Third Edition, in Java, Part 5: Graph Algorithms. Addison-Wesley, Reading, MA, 2003, 502 pp.

Algorithms, Third Edition, in Java, Parts 1–4: Fundamentals, Data Structures, Sorting, and Searching. Addison-Wesley, Reading, MA, 2002, 737 pp.

Algorithms, Third Edition, in C++, Part 5: Graph Algorithms. Addison-Wesley, Reading, MA, 2002, 496 pp.

Algorithms, Third Edition, in C, Part 5: Graph Algorithms. Addison-Wesley, Reading, MA, 2001, 472 pp.

Algorithms, Third Edition, in C++, Parts 1–4: Fundamentals, Data Structures, Sorting, and Searching. Addison-Wesley, Reading, MA, 1998, 716 pp.

Algorithms, Third Edition, in C, Parts 1–4: Fundamentals, Data Structures, Sorting, and Searching. Addison-Wesley, Reading, MA, 1998, 702 pp.

An Introduction to the Analysis of Algorithms (with P. Flajolet). Addison-Wesley, Reading, MA, 1996, 512 pp. Translated into French (1997).

Algorithms in Modula-3. Addison-Wesley, Reading, MA, 1993, 672 pp.

Algorithms in C++. Addison-Wesley, Reading, MA, 1992, 672 pp. Translated into German (1993), Japanese (1994), Spanish (1996).

Algorithms in C. Addison-Wesley, Reading, MA, 1990, 672 pp. Translated into French (1991), German (1992), Italian (1993).

Algorithms. Addison-Wesley, Reading, MA, 1983, second edition, 1988, 672 pp. Translated into Japanese (1990), German (1991).

Mathematical Analysis of Algorithms, in Probability Theory and Computer Science. G. Louchard and G. LaTouche, ed., Academic Press (1983), 97 pp.

Quicksort. Garland Publishing, New York, 1980, (Outstanding Dissertations in CS series), 345 pp.

An Introduction to Computer Science (with K. Wayne).

Booksite at Princeton (since 2002).
Curated lectures on CUvids Part 1 and Part 2 (since 2019).
MOOCs on Coursera Part 1 (since 2017) and Part 2 (since 2018).

Algorithms, Fourth Edition (with K. Wayne).

Booksite at Princeton (since 2002).
Curated lectures on CUvids (since 2019).
MOOCs on Coursera Part 1 (since 2012) and Part 2 (since 2013).

Analysis of Algorithms (based on work with P. Flajolet).

Booksite at Princeton (since 2011).
Curated lectures on CUvids (since 2019).
MOOC on Coursera (since 2013).

Analytic Combinatorics (based on work with P. Flajolet).

Booksite at Princeton (since 2011).
Curated lectures on CUvids (since 2019).
MOOC on Coursera (since 2013).

HyperBitBit: A Memory-Efficient Alternative to HyperLogLog. In preparation, 2021.

In memory of Philippe Flajolet. Combinatorics, Probability, and Computing, 2014.

Left-Leaning Red-Black Trees. Posted here, 2008.

CS-1 for Scientists (with G. Wilson, C. Alvarado, J. Campbell, and R. Landau). ACM SIGCSE Bulletin 40 (1), 2008.

Analytic combinatorics: symbolic combinatorics (with P. Flajolet). INRIA Research Report, December 2002.

Optimal-space generalized queues (with A. Brodnik, S. Carlsson, E. Demaine, and I. Munro). Workshop on Algorithms and Data Structures, 1999; summary in Dr. Dobbs Journal, July, 2002.

Analytic Combinatorics: Functional equations, rational and algebraic functions (with P. Flajolet). INRIA Research Report, January, 2001.

Ternary Search Trees (with J. Bentley). Dr. Dobbs Journal, March, 1998.

Multiway Quicksort (with J. Bentley). Dr. Dobbs Journal, November, 1998.

The Average-case Analysis of Algorithms: Multivariate Asymptotics and Limit Distribution (with P. Flajolet). INRIA Research Report, August, 1997.

Fast Algorithms for Sorting and Searching Strings (with J. Bentley). Proc. 8th Symposium on Discrete Algorithms, 1997.

The Average-case Analysis of Algorithms: Mellin Transform Asymptotics (with P. Flajolet). INRIA Research Report No. 2956, August, 1996.

Analysis of Shellsort and Related Algorithms. Invited paper at 1996 European Symposium on Algorithms.

Mellin Transforms and Asymptotics: Finite Differences and Rice’s Integrals (with P. Flajolet). Theoretical Computer Science A 144, 1995.

The Average-case Analysis of Algorithms: Saddle Point Asymptotics (with P. Flajolet). INRIA Research Report No. 2376, October, 1994

Queue-Mergesort (with M. Golin). Information Processing Letters 34, 1994.

The Average-case Analysis of Algorithms: Complex Asymptotics and Generating Functions (with P. Flajolet). INRIA Research Report No. 2026, September, 1993.

The Average-case Analysis of Algorithms: Counting and Generating Functions (with P. Flajolet). INRIA Research Report No. 1888, April, 1993.

The Analysis of Heapsort (with R. Schaffer). J. of Algorithms, 1993.

Deterministic Skip Lists (with I. Munro and T. Papadakis). Proc. 3rd Symposium on Discrete Algorithms, 1992.

More on Shellsort Increment Sequences (with M. Weiss). Information Processing Letters 34, 1990.

Tight Lower Bounds for Shellsort (with M. Weiss). J. of Algorithms 11, 1990.

Exact Analysis of Mergesort (with M. Golin). Proc. 4th SIAM Conference on Discrete Mathematics, 1988.

Shellsort and the Frobenius Problem (with M. Weiss, E. Hentschel, and A. Pelin). Congressus Numerantium 65, 1988.

Analysis of a Simple Yet Efficient Convex Hull Algorithm (with M. Golin). Proceedings 4th Symposium on Computational Geometry, 1988.

Bad Cases for Shakersort (with M. Weiss). Information Processing Letters 28, 1988.

Practical Variations on Shellsort (with J. Incerpi). Information Processing Letters 26, 1987.

Pairing Heaps: A New Form of Self-Adjusting 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.

Techniques for Algorithm Animation (with M. Brown). IEEE Computer, 1985.

Shortest Paths in Euclidean Graphs (with J. Vitter). 25th Annual Symposium on Foundations of Computer Science, W. Palm Beach, FL (October 1984). Algorithmica 1, 1, 1986.

A New Upper Bound for Shellsort. Journal of Algorithms 7, 1986. (Invited paper at 1982 IEEE International Conference on Information Theory.)

Some Uses of the Mellin Integral Transform in the Analysis of Algorithms (with P. Flajolet and M. Regnier). in NATO Conference, Springer-Verlag, Berlin, 1985.

A System for Algorithm Animation (with M. Brown). Computer Graphics 18, 3, 1984.

A Prototype Environment for Algorithm Animation (with M. Brown). ACM SIGCSE Bulletin, 1984.

Improved Upper Bounds for Shellsort (with Janet Incerpi). 24th Annual Symposium on Foundations of Computer Science, 1983. (Invited paper in J. Computer and System Sciences 31, 2, 1985.)

VLSI Layout as Programming (with R. J. Lipton, J. Valdes, G. Vijayan, and S. C. North). ACM Transactions of Programming Languages and Systems 5, 3, 1983.

Mathematical Analysis of Combinatorial Algorithms. in Probability and Computer Science, G. Louchard and G. Latouche, ed., Academic Press, 1983.

ALI: A Procedural Approach to VLSI (with R.J. Lipton and J. Valdes). Proceedings Design Automation Conference, Las Vegas, NV, 1982.

Notes on Merging Networks (with Zhu Hong). Proceedings 14th Symposium on Theory of Computing, 1982. (Invited paper to Information and Control.)

Programming Aspects of VLSI (with R. J. Lipton and J. Valdes). Proceedings 9th Symposium on Principles of Programming Languages Albequerque, NM, 1982. (Invited paper for special issue of TOMS.)

The Complexity of Finding Cycles in Periodic Functions (with T. Szymanski and A. Yao). SIAM Journal of Computing, 1982.

Lower Bounds for VLSI (with R. J. Lipton). Proceedings 13th Symposium on Theory of Computing, Milwaukee, WI, 1981. (Invited paper for special issue of JCSS.)

Efficient Sorting by Computer. In Computational Probability, ed. P.M. Kahn, Academic Press, 1980.

A Dichromatic Framework for Balanced Trees (with L. Guibas). 19th Annual Symposium on Foundations of Computer Science, 1980. (Also appears in A Decade of Research—Xerox Palo Alto Research Center 1970-1980 ed. G. Laverdel and E.R. Barker.)

The Complexity of Finding Periods (with T. Szymanski). Proceedings 11th Symposium on Theory of Computing, Atlanta, GA, 1979.

Implementing Quicksort Programs. Communications of the ACM 21, 10, 1978.

Data Movement in Odd-Even Merging. SIAM Journal on Computing 7, 2, 1978.

Permutation Generation Methods. Computing Surveys 9, 2, 1977.

Quicksort with Equal Keys. SIAM Journal on Computing 6, 2, 1977.

The Analysis of Quicksort Programs. Acta Informatica 7, 1977.

Data Movement in Odd-Even Merging. Conference on Theoretical Computer Science, University of Waterloo, 1977.

Computer Graphics for Drafting. Computer Graphics and Image Processing 3, 1974.

Graphics Software for Two-Dimensional Filling. DECUS Proceedings, 1971.

SPY – A Program to Monitor OS/360. Proceedings 1970 AFIPS Fall Joint Computer Conference, AFIPS Press, 1970.

Janet Incerpi, A Study of the Worst Case of Shellsort, Brown University, 1986.

Marc H. Brown, Algorithm Animation, Brown University, 1987 (ACM Outstanding Dissertation).

Mark A. Weiss, Lower Bounds for Shellsort, Princeton University, 1987.

Mordecai J. Golin, Probabilistic Analysis of Geometric Algorithms, Princeton University, 1990.

Sarantos Kapidakis, Average-Case Analysis of Graph Searching Algorithms, Princeton University, 1990.

Russel W. Schaffer, Analysis of Heapsort, Princeton University, 1992.

What do we know about Quicksort?

2022 Isaac Newton Institute for the Mathematical Sciences, Cambridge, UK

Cardinality Estimation

2016 Flajolet Lecture, AofA’16, Kraków, Poland
2016 University of Utah, Salt Lake City, UT
2017 University of Southern California, Los Angeles, CA
2018 Knuth80 Symposium, Piteå, Sweden
2019 Data Structures Workshop, Dagstuhl, Wadern, Germany

A 21st Century Model for Disseminating Knowledge

2016 Data Structures Workshop, Dagstuhl, Wadern, Germany
2016 University of Utah, Salt Lake City, UT
2017 Princeton University, Princeton, NJ
2017 Georgia Institute of Technology, Atlanta, GA
2017 University of Southern California, Los Angeles, CA
2017 Harvey Mudd College, Pomona, CA
2017 University of Michigan, Ann Arbor, MI
2018 MIT, Cambridge, MA
2018 Brown University, Providence, RI
2019 The Round Table, Saint Louis, MO
2019 Universitat Politècnica de Catalunya, Barcelona, Spain
2019 University of Colorado, Boulder, CO

If You Can Specify It, You Can Analyze It—The Legacy of Philippe Flajolet

2013 SODA, New Orleans, LA
2013 Université Pierre et Marie Curie, Paris, France
2013 Vienna University of Technology, Vienna, Austria
2013 CanaDAM, Newfoundland, Canada
2014 Université de Versailles, Versailles, France
2014 LATIN, Montevideo, Uruguay

Taking Education Online: A Unique Opportunity for the New Millennium

2013 Queen Mary University of London, England
2013 AofA’13, Menorca, Spain
2014 Universidad de la República, Montevideo, Uruguay
2014 Florida International University, Miami, Florida
2015 NYU Polytechnic School of Engineering, Brooklyn, NY

From Analysis of Algorithms to Analytic Combinatorics

2011 PFAC conference, in memory of Flajolet, Paris, France
2011 DIMACS, Piscataway, NJ
2012 Drexel University, Philadelphia, PA
2012 Stanford University, Palo Alto, CA

Algorithms for the Masses

2011 ANALCO, San Francisco, CA
2012 Drexel University, Philadelphia, PA

Impatiemment Attendu

2008 Philippe Flajolet 60th birthday, Paris, France

Putting the “Science” back into Computer Science

2007 Adobe Systems, San Jose, CA
2007 Purdue University, West Lafayette, IN
2009 University of São Paulo, São Paulo, Brazil
2010 Carnegie-Mellon University, Pittsburgh, PA
2010 Rutgers University, New Brunswick, NJ

Left-Leaning Red-Black Trees

2008 Workshop on Analysis of Algorithms, Maresias, Brazil
2008 University of Pennsylvania, Philadelphia, PA
2008 Data Structures Workshop, Dagstuhl, Wadern, Germany
2009 LAGOS Symposium, Gramado, Brazil

Finding Paths in Graphs

2007 Adobe Systems India, Bangalore, India
2005 Conference on Analysis of Algorithms, Barcelona, Spain
2004 Data Structures Workshop, Dagstuhl, Wadern, Germany
2004 Carleton University, Ottawa, Canada

Quicksort is Optimal

2002 KnuthFest, Stanford University, Stanford, CA

Permutation Generation Methods

2002 Data Structures Workshop, Dagstuhl, Wadern, Germany

New Research on the Theory and Practice of Sorting

1999 Workshop on Analysis of Algorithms, Barcelona, Spain
1999 Ecole Polytechnique, Paris, France
2000 New York Academy of Sciences, New York, NY
2000 Data Structures Workshop, Dagstuhl, Wadern, Germany
2001 Université du Quebec a Montreal, Montreal, Canada

Visualization of Analysis of Algorithms

1998 Workshop on Analysis of Algorithms Princeton, NJ

Open Problems in Sorting and Searching

1996 Analysis of Algorithms Workshop, Dagstuhl, Wadern, Germany
1997 Workshop on Probabilistic Algorithms, Princeton, NJ
1998 Data Structures Workshop, Dagstuhl, Wadern, Germany

Creating “Algorithms”

1990 University of Virginia, Charlottesville, VA
1993 Stanford University, Palo Alto, CA
1994 IDA Systems Research Center, Bowie, MD
2002 Adobe Systems, San Jose, CA

Priority Queues and Graph Searching

1987 Conference on Combinatorics and CS, Montreal, Canada

Writing a Dynamic Book

1985 Bell Laboratories, Murray Hill, NJ
1986 RCA David Sarnoff Laboratories, Princeton, NJ
1986 Princeton ACM-IEEE, Princeton, NJ

An Environment for Algorithm Animation

1983 Yale University, New Haven, CT
1984 RPI (Class of 1925 Lecture), Troy NY
1984 NSF CER Conference, Salt Lake City, UT
1984 Xerox PARC, Palo Alto, CA
1984 Stanford University, Stanford, CA
1984 Dartmouth College, Hanover, NH
1984 National Science Foundation, Washington, DC
1984 Bell Laboratories, Murray Hill, NJ
1984 Defense Contractor’s meeting, Monterrey, CA
1984 Defense Computer Graphics Conference, Washington, DC
1984 American Assoc. of Statistics, Boston, MA
1984 St. Joseph’s University (CBMS Program), Philadelphia, PA
1984 Cornell University, Ithaca, NY
1985 University of California, Berkeley, CA
1987 Finnish Conference on Theoretical CS, Jonesuu, Finland

Heapsort

1981 INRIA, Rocquencourt, France
1996 Analysis of Algorithms Workshop, Dagstuhl, Wadern, Germany

Shellsort and the Frobenius Problem

1981 Institute for Defense Analyses, Princeton, NJ
1982 INRIA, Rocquencourt, France
1983 Université de Paris-VI, Paris, France
1984 RPI (Class of 1925 Lecture), Troy, NY
1986 City Graduate College, New York, NY
1987 University of Helsinki, Helsinki, Finland
1996 European Symposium on Algorithms, Barcelona, Spain

Superoptimization on the CRAY-1

1978 Institute for Defense Analyses, Princeton, NJ
1979 Xerox Palo Alto Research Center, Palo Alto, CA
1982 Carnegie-Mellon University, Pittsburg, PA
1983 ETH, Zurich, Switzerland
1983 Université de Paris-Sud, Orsay, France
1983 INRIA, Rocquencourt, France

Fast Sorting Algorithms

1978 Institute for Defense Analyses, Princeton, NJ
1990 Institute for Defense Analyses, Princeton, NJ
1994 Institute for Defense Analyses, Princeton, NJ

A Framework for Balanced Trees

1978 Xerox Palo Alto Research Center, Palo Alto, CA
1979 Lawrence Livermore Laboratories, Livermore, CA
1979 University of California, Berkeley, Berkeley, CA

Quicksort

1974 Brown University, Providence, RI
1975 Stanford University, Stanford, CA
1975 University of California, Berkeley, Berkeley, CA
1976 Yale University, New Haven, CT
1976 Los Alamos Scientific Laboratory, Los Alamos, NM
1976 University of Massachusetts, Amherst, MA
1977 University of Waterloo, Waterloo, Ontario

Journals

Journal of the ACM,Editor, 1982–2001
Journal of Algorithms,Editor, 1979–2002
Transactions on Algorithms,Editor, 2003–2014
Algorithmica,Editor, 2003–

Conferences and Seminars

Dagstuhl Seminars on Analysis of Algorithms
Organizer, 1993, 1995, 1997

DIMACS Special Year on Massive Data Sets
Chair, 1997

Dagstuhl Seminars on Data Structures
Organizer, 2002, 2005, 2008, 2010, 2014, 2016, 2018

International Meetings on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms
Steering Committee, 1998–2019, Chair, 2011–2019

SIAM Meetings on Analytic Algorithmics and Combinatorics
Steering Committee Chair, 2004–2019

KnuthFest (Don Knuth’s 1000000th Birthday)
Organizing Committee, 2002

Colloquium for Philippe Flajolet’s 60th Birthday
Steering Committee, 2008

Philippe Flajolet Memorial Conference
Steering Committee, 2011

Collected Works of Philippe Flajolet
Editorial Board, 2011–

Turing Centennial Celebration
Organizer, 2016

Knuth80 (Don Knuth’s 80th Birthday)
Co-organizer, 2018