Selected papers on analysis of algorithms
By: Donald E. Knuth.
Publisher: Center for the Study of Language and Information, Leland Stanford Junior University
Published: 2000
Place of publication: [Stanford, Calif.]
Language: eng
Number of pages: 621
Subjects: Algorithms
Notes: Includes bibliographical references and index.
Table of contents: title: Mathematical analysis of algorithms --; title: The dangers of computer science theory --; title: The analysis of algorithms --; title: Big Omicron and big Omega and big Theta --; title: Optimal measurement points for program frequency counts --; title: Estimating the efficiency of backtrack programs --; title: Ordered hase tables --; title: Activity in an interleaved memory --; title: An analysis of Alpha-Beta pruning --; title: Notes on generalized Dedekind sums --; title: The distribution of continued fraction approximations --; title: Evaluation of Porter's constant --; title: The subtractive algorithm for greatest common divisors --; title: Length of strings for a merge sort --; title: The average height of planted plane trees --; title: The toilet paper problem --; title: An analysis of optimum caching --; title: A trivial algorithm whose analysis isn't --; title: Deletions that preserve randomness --; title: Analysis of a simple factorization algorithm --; title: The expected linearity of a simple equivalence algorithm --; title: Textbook examples of recursion --; title: An exact analysis of stable allocation --; title: Stable husbands --; title: Shellsort with three increments --; title: The average time for carry propagation --; title: Linear probing and graphs --; title: A terminological proposal --; title: Postscript about NP-hard problems --; title: An experiment in optimal sorting --; title: Duality in addition chains --; title: Complexity results for bandwidth minimization --; title: The problem of compatible representatives --; title: The complexity of nonuniform random number generation.