Includes bibliographical references and index.

Mathematical analysis of algorithms -- The dangers of computer science theory -- The analysis of algorithms -- Big Omicron and big Omega and big Theta -- Optimal measurement points for program frequency counts -- Estimating the efficiency of backtrack programs -- Ordered hase tables -- Activity in an interleaved memory -- An analysis of Alpha-Beta pruning -- Notes on generalized Dedekind sums -- The distribution of continued fraction approximations -- Evaluation of Porter's constant -- The subtractive algorithm for greatest common divisors -- Length of strings for a merge sort -- The average height of planted plane trees -- The toilet paper problem -- An analysis of optimum caching -- A trivial algorithm whose analysis isn't -- Deletions that preserve randomness -- Analysis of a simple factorization algorithm -- The expected linearity of a simple equivalence algorithm -- Textbook examples of recursion -- An exact analysis of stable allocation -- Stable husbands -- Shellsort with three increments -- The average time for carry propagation -- Linear probing and graphs -- A terminological proposal -- Postscript about NP-hard problems -- An experiment in optimal sorting -- Duality in addition chains -- Complexity results for bandwidth minimization -- The problem of compatible representatives -- The complexity of nonuniform random number generation.