World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
38
Citations
16100
World Ranking
9946
National Ranking
4181

Research.com Recognitions

  • 2019 - Steele Prize for Mathematical Exposition
  • 2018 - ACM Karl V. Karlstrom Outstanding Educator Award For developing classic textbooks and online materials for the study of algorithms, analytic combinatorics, and introductory computer science that have educated generations of students worldwide.
  • 1997 - ACM Fellow For seminal work in the mathematical analysis of algorithms and pioneering research in algorithm animation.

Overview

Robert Sedgewick is affiliated with Princeton University in the United States. Their work spans several areas within computer science, focusing on core topics such as algorithms and data compression, cellular automata and applications, and advanced database systems and queries.

The main fields of study for Sedgewick include computer science, with specific subfields covering artificial intelligence, computational theory and mathematics, and computer networks and communications.

Recent scholarly contributions include the paper titled Bit-array-based alternatives to HyperLogLog, published in 2025 in Theoretical Computer Science. This paper represents part of Sedgewick's engagement with mathematical and algorithmic topics as indicated by their publication venue.

Frequent co-authors collaborating with Sedgewick are:

  • Svante Janson
  • Jérémie Lumbroso

The publication venues for Sedgewick's work notably include Theoretical Computer Science.

Several awards have been granted to Sedgewick recognizing their contributions to the field:

  • Steele Prize for Mathematical Exposition (2019)
  • ACM Karl V. Karlstrom Outstanding Educator Award (2018) - for developing classic textbooks and online materials in algorithms, analytic combinatorics, and introductory computer science
  • ACM Fellow (1997) - for seminal work in the mathematical analysis of algorithms and pioneering research in algorithm animation

These recognitions highlight a sustained engagement with both research and education within computer science, especially focusing on algorithm analysis and educational resource development.

Best Publications

  • Analytic Combinatorics

    Philippe Flajolet;Robert Sedgewick

  • Analytic Combinatorics: RANDOM STRUCTURES

    Philippe Flajolet;Robert Sedgewick

  • Algorithms in C

    Robert Sedgewick

  • An Introduction to the Analysis of Algorithms

    Robert Sedgewick;Philippe Flajolet

  • A dichromatic framework for balanced trees

    Leo J. Guibas;Robert Sedgewick

  • Fast algorithms for sorting and searching strings

    Jon L. Bentley;Robert Sedgewick

  • A system for algorithm animation

    Marc H. Brown;Robert Sedgewick

  • Implementing Quicksort programs

    Robert Sedgewick

  • The pairing heap: a new form of self-adjusting heap

    Michael L. Fredman;Robert Sedgewick;Daniel D. Sleator;Robert E. Tarjan

  • Permutation Generation Methods

    Robert Sedgewick

  • Algorithms in Java, Part 5: Graph Algorithms

    Robert Sedgewick;Michael Schidlowsky

  • Techniques for Algorithm Animation

    M.H. Brown;R. Sedgewick

  • Mellin transforms and asymptotics: finite differences and Rice's integrals

    Philippe Flajolet;Robert Sedgewick

  • SYSTEM FOR ALGORITHM ANIMATION.

    Marc H. Brown;Robert Sedgewick

  • Lower bounds for VLSI

    Richard J. Lipton;Robert Sedgewick

  • Shortest paths in Euclidean graphs

    Robert Sedgewick;Jeffrey Scott Vitter

  • The analysis of Quicksort programs

    Robert Sedgewick

  • Digital search trees revisited

    Philippe Flajolet;Robert Sedgewick

  • Deterministic skip lists

    J. Ian Munro;Thomas Papadakis;Robert Sedgewick

  • BASIC COMPLEX ANALYSIS

    Philippe Flajolet;Robert Sedgewick

  • Analytic Combinatorics: PREFACE

    Philippe Flajolet;Robert Sedgewick

Frequent Co-Authors

Philippe Flajolet
Philippe Flajolet French Institute for Research in Computer Science and Automation - INRIA
Richard J. Lipton
Richard J. Lipton Georgia Institute of Technology
Wojciech Szpankowski
Wojciech Szpankowski Purdue University West Lafayette
Jeffrey Scott Vitter
Jeffrey Scott Vitter University of Mississippi
Andrew Chi-Chih Yao
Andrew Chi-Chih Yao Tsinghua University
J. Ian Munro
J. Ian Munro University of Waterloo
Robert E. Tarjan
Robert E. Tarjan Princeton University
Leonidas J. Guibas
Leonidas J. Guibas Stanford University
Jin-Yi Cai
Jin-Yi Cai University of Wisconsin–Madison

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a range of related online degrees and career pathways. Many students seek flexible learning options, which is why choosing from good online colleges is crucial. Accredited programs ensure you receive quality education and recognized credentials that can boost your job prospects.

For those interested in creative technology fields, consider pursuing an online video game design degree. This pathway combines programming, storytelling, and graphic design, preparing graduates for careers in the rapidly growing gaming industry.

Cybersecurity remains one of the most in-demand sectors in tech. Upskilling with a cybersecurity masters online can help you protect digital assets and pursue specialized careers in information security, risk analysis, and network defense.

For those interested in project management and engineering, a construction management degree online provides both technical and leadership skills. Graduates often move into roles overseeing large-scale technology and infrastructure projects.

Choosing the right online program in any of these fields can lead to diverse, rewarding careers within the technology sector and beyond.

Best Scientists Citing Robert Sedgewick

Trending Scientists