Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
$42.75
Qty:1
  • List Price: $45.00
  • Save: $2.25 (5%)
Only 1 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Add to Cart
Want it Tuesday, April 22? Order within and choose One-Day Shipping at checkout. Details
Trade in your item
Get a $4.22
Gift Card.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more

Selected Papers on the Analysis of Algorithms Paperback

ISBN-13: 978-1575862125 ISBN-10: 1575862123 Edition: 0th

See all 2 formats and editions Hide other formats and editions
Amazon Price New from Used from Collectible from
Hardcover
"Please retry"
Paperback
"Please retry"
$42.75
$38.66 $12.97

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student



Frequently Bought Together

Selected Papers on the Analysis of Algorithms + Selected Papers on Design of Algorithms (Center for the Study of Language and Information - Lecture Notes) + Selected Papers on Computer Science (Center for the Study of Language and Information - Lecture Notes)
Price for all three: $101.74

Some of these items ship sooner than the others.

Buy the selected items together

NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Series: Center for the Study of Language and Information - Lecture Notes (Book 102)
  • Paperback: 540 pages
  • Publisher: Center for the Study of Language and Inf (June 2000)
  • Language: English
  • ISBN-10: 1575862123
  • ISBN-13: 978-1575862125
  • Product Dimensions: 9.1 x 6.1 x 1.3 inches
  • Shipping Weight: 2 pounds (View shipping rates and policies)
  • Average Customer Review: 4.6 out of 5 stars  See all reviews (5 customer reviews)
  • Amazon Best Sellers Rank: #1,865,926 in Books (See Top 100 in Books)

Editorial Reviews

Review

"The collection is a valuable additon to the literature." Mathematical Reviews

Book Description

This volume is devoted to an important subfield of Computer Science that Knuth founded in the 1960s and still considers his main life's work. Analysis of Algorithms deals with quantitative studies of computer techniques, leading to methods for understanding and predicting the efficiency of computer programs.

More About the Author

Donald E. Knuth was born on January 10, 1938 in Milwaukee, Wisconsin. He studied mathematics as an undergraduate at Case Institute of Technology, where he also wrote software at the Computing Center. The Case faculty took the unprecedented step of awarding him a Master's degree together with the B.S. he received in 1960. After graduate studies at California Institute of Technology, he received a Ph.D. in Mathematics in 1963 and then remained on the mathematics faculty. Throughout this period he continued to be involved with software development, serving as consultant to Burroughs Corporation from 1960-1968 and as editor of Programming Languages for ACM publications from 1964-1967.

He joined Stanford University as Professor of Computer Science in 1968, and was appointed to Stanford's first endowed chair in computer science nine years later. As a university professor he introduced a variety of new courses into the curriculum, notably Data Structures and Concrete Mathematics. In 1993 he became Professor Emeritus of The Art of Computer Programming. He has supervised the dissertations of 28 students.

Knuth began in 1962 to prepare textbooks about programming techniques, and this work evolved into a projected seven-volume series entitled The Art of Computer Programming. Volumes 1-3 first appeared in 1968, 1969, and 1973. Having revised these three in 1997, he is now working full time on the remaining volumes. Volume 4A appeared at the beginning of 2011. More than one million copies have already been printed, including translations into ten languages.

He took ten years off from that project to work on digital typography, developing the TeX system for document preparation and the METAFONT system for alphabet design. Noteworthy by-products of those activities were the WEB and CWEB languages for structured documentation, and the accompanying methodology of Literate Programming. TeX is now used to produce most of the world's scientific literature in physics and mathematics.

His research papers have been instrumental in establishing several subareas of computer science and software engineering: LR(k) parsing; attribute grammars; the Knuth-Bendix algorithm for axiomatic reasoning; empirical studies of user programs and profiles; analysis of algorithms. In general, his works have been directed towards the search for a proper balance between theory and practice.

Professor Knuth received the ACM Turing Award in 1974 and became a Fellow of the British Computer Society in 1980, an Honorary Member of the IEEE in 1982. He is a member of the American Academy of Arts and Sciences, the National Academy of Sciences, and the National Academy of Engineering; he is also a foreign associate of l'Academie des Sciences (Paris), Det Norske Videnskaps-Akademi (Oslo), Bayerische Akademie der Wissenschaften (Munich), the Royal Society (London), and Rossiiskaya Akademia Nauk (Moscow). He holds five patents and has published approximately 160 papers in addition to his 28 books. He received the Medal of Science from President Carter in 1979, the American Mathematical Society's Steele Prize for expository writing in 1986, the New York Academy of Sciences Award in 1987, the J.D. Warnier Prize for software methodology in 1989, the Adelskøld Medal from the Swedish Academy of Sciences in 1994, the Harvey Prize from the Technion in 1995, and the Kyoto Prize for advanced technology in 1996. He was a charter recipient of the IEEE Computer Pioneer Award in 1982, after having received the IEEE Computer Society's W. Wallace McDowell Award in 1980; he received the IEEE's John von Neumann Medal in 1995. He holds honorary doctorates from Oxford University, the University of Paris, St. Petersburg University, and more than a dozen colleges and universities in America.

Professor Knuth lives on the Stanford campus with his wife, Jill. They have two children, John and Jennifer. Music is his main avocation.

Customer Reviews

4.6 out of 5 stars
5 star
4
4 star
0
3 star
1
2 star
0
1 star
0
See all 5 customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

13 of 18 people found the following review helpful By Amazon Customer on September 5, 2000
Format: Paperback
To a reader interested in the analysis of algorithms, this book doubtlessly contains a number of very thorough analyses, with some interesting correspondence about the origin of complexity O()-notation and the term "NP-hard" thrown in.
As a reader more interested in Knuth's work in general, I must admit that, despite having advanced degrees in CS and a quite decent math education, I found myself unable to follow the heavy mathematics employed, and ultimately, the problems analyzed were not interesting enough to me to make me spend the effort to follow it. One of the chapters was titled "A Trivial Algorithm Whose Analysis Isn't", and this probably sums up why I'm not entirely enthusiastic about this book and about the field of algorithm analysis in general.
Knuth wouldn't be Knuth if he didn't throw some lighter material in as well, and chapter 2, "The Dangers of Computer Science Theory", was quite amusing.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
6 of 11 people found the following review helpful By John Douglas Pritchard on June 16, 2000
Format: Paperback
Professor Knuth collects a charming and valuable set of papers into one terrific place. Don't miss his satirical "anti- Science" article "The Dangers of Computer Science", Chapter two, first presented in 1971.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
3 of 11 people found the following review helpful By Dr. B on May 19, 2001
Format: Paperback
Befor Donald Ervin Knuth, there was no such thing as the Analysis of Algorithms. He is a visionary in this field, and these selected papers are a testomony to his greatness in this field.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
3 of 11 people found the following review helpful By "junglebambam" on June 16, 2000
Format: Paperback
Donald Knuth is recognized as guru of the science of the computation. This publication comes to already complement its collection consecrated. The Analysis of Algorithms is one of the most important areas of the science of the computation. Excellent release.
1 Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
2 of 11 people found the following review helpful By "junglebambam" on June 16, 2000
Format: Paperback
Donald Knuth is recognized as guru of the science of the computation. This publication comes to already complement its collection consecrated. The Analysis of Algorithms is one of the most important areas of the science of the computation. Excellent release.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Product Images from Customers

Search
ARRAY(0xa4a0bdd4)