R. Sedgewick

Publications154
h-index38
Citations11,085
Highly Influential Citations803
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • P. Flajolet
  • 228 Publications • 16,830 Citations
  • R. Gatti
  • 252 Publications • 15,103 Citations
  • D. Knuth
  • 425 Publications • 53,354 Citations
  • A. Odlyzko
  • 309 Publications • 14,736 Citations
  • Publications
  • Influence
Analytic Combinatorics
TLDR
Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and scientific models with applications in physics, biology and chemistry. Expand
  • 2,784
  • 378
  • PDF
An introduction to the analysis of algorithms
1. Analysis of Algorithms. Why Analyze an Algorithm? Computational Complexity. Analysis of Algorithms. Average-Case Analysis. Example: Analysis of Quicksort. Asymptotic Approximations. Distributions.… Expand
  • 730
  • 49
  • PDF
Algorithms in C
TLDR
Algorithms in C is a comprehensive repository of algorithms, complete with code. Expand
  • 1,045
  • 43
  • PDF
Fast algorithms for sorting and searching strings
TLDR
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. Expand
  • 428
  • 42
  • PDF
A dichromatic framework for balanced trees
  • L. Guibas, R. Sedgewick
  • Computer Science
  • 19th Annual Symposium on Foundations of Computer…
  • 16 October 1978
TLDR
We show how to imbed in this framework the best known balanced tree techniques and then use the framework to develop new algorithms which perform the update and rebalancing in one pass on the way down towards a leaf. Expand
  • 691
  • 29
  • PDF
Analytic Combinatorics: RANDOM STRUCTURES
  • 745
  • 20
Mellin Transforms and Asymptotics: Finite Differences and Rice's Integrals
TLDR
High order differences of simple number sequences may be analysed asymptotically by means of integral representations, residue calculus, and contour integration. Expand
  • 221
  • 20
  • PDF
A system for algorithm animation
TLDR
A software environment is described which provides facilities at a variety of levels for “animating algorithms: exposing properties of programs by displaying multiple dynamic views of the program and associated data structures. Expand
  • 390
  • 14
Implementing Quicksort programs
TLDR
This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers, including how to apply various code optimization techniques. Expand
  • 274
  • 14
  • PDF
Digital Search Trees Revisited
TLDR
The paper may be of interest as a survey and tutorial treatment of the analysis of the three primary digital tree search methods: digital search trees, radix search tries, and Patricia tries. Expand
  • 143
  • 12
  • PDF
...
1
2
3
4
5
...