Selected papers on analysis of algorithms - Info and Reading Options
By Donald Knuth
"Selected papers on analysis of algorithms" was published by Center for the Study of Language and Information, Leland Stanford Junior University in 2000 - [Stanford, Calif.], it has 621 pages and the language of the book is English.
“Selected papers on analysis of algorithms” Metadata:
- Title: ➤ Selected papers on analysis of algorithms
- Author: Donald Knuth
- Language: English
- Number of Pages: 621
- Publisher: ➤ Center for the Study of Language and Information, Leland Stanford Junior University
- Publish Date: 2000
- Publish Location: [Stanford, Calif.]
“Selected papers on analysis of algorithms” Subjects and Themes:
- Subjects: Algorithms
Edition Specifications:
- Pagination: xvi, 621 p. :
Edition Identifiers:
- The Open Library ID: OL15495554M - OL1915635W
- Online Computer Library Center (OCLC) ID: 43641140 - 42835282
- Library of Congress Control Number (LCCN): 00023847
- ISBN-10: 1575862115 - 1575862123
- All ISBNs: 1575862115 - 1575862123
AI-generated Review of “Selected papers on analysis of algorithms”:
"Selected papers on analysis of algorithms" Table Of Contents:
- 1- Mathematical analysis of algorithms --
- 2- The dangers of computer science theory --
- 3- The analysis of algorithms --
- 4- Big Omicron and big Omega and big Theta --
- 5- Optimal measurement points for program frequency counts --
- 6- Estimating the efficiency of backtrack programs --
- 7- Ordered hase tables --
- 8- Activity in an interleaved memory --
- 9- An analysis of Alpha-Beta pruning --
- 10- Notes on generalized Dedekind sums --
- 11- The distribution of continued fraction approximations --
- 12- Evaluation of Porter's constant --
- 13- The subtractive algorithm for greatest common divisors --
- 14- Length of strings for a merge sort --
- 15- The average height of planted plane trees --
- 16- The toilet paper problem --
- 17- An analysis of optimum caching --
- 18- A trivial algorithm whose analysis isn't --
- 19- Deletions that preserve randomness --
- 20- Analysis of a simple factorization algorithm --
- 21- The expected linearity of a simple equivalence algorithm --
- 22- Textbook examples of recursion --
- 23- An exact analysis of stable allocation --
- 24- Stable husbands --
- 25- Shellsort with three increments --
- 26- The average time for carry propagation --
- 27- Linear probing and graphs --
- 28- A terminological proposal --
- 29- Postscript about NP-hard problems --
- 30- An experiment in optimal sorting --
- 31- Duality in addition chains --
- 32- Complexity results for bandwidth minimization --
- 33- The problem of compatible representatives --
- 34- The complexity of nonuniform random number generation.
Read “Selected papers on analysis of algorithms”:
Read “Selected papers on analysis of algorithms” by choosing from the options below.
Search for “Selected papers on analysis of algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Borrow "Selected papers on analysis of algorithms" Online:
Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.
- Is Online Borrowing Available: Yes
- Preview Status: borrow
- Check if available: The Open Library & The Internet Archive
Find “Selected papers on analysis of algorithms” in Libraries Near You:
Read or borrow “Selected papers on analysis of algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Selected papers on analysis of algorithms” at a library near you.
Buy “Selected papers on analysis of algorithms” online:
Shop for “Selected papers on analysis of algorithms” on popular online marketplaces.
- Ebay: New and used books.