The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

4.59 avg rating
( 59 ratings by Goodreads )
 
9780201038040: The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1

The Art of Computer Programming, Volume 4A:  Combinatorial Algorithms, Part 1

 

Knuth’s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth’s analysis, while practicing programmers have successfully applied his “cookbook” solutions to their day-to-day problems.

 

The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient “review” of future volumes could almost be: “Knuth, Volume n has been published.”

Data Processing Digest

 

Knuth, Volume n has been published, where n = 4A.

 

In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams.

 

The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form.

 

There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages.

–Frank Ruskey, Department of Computer Science, University of Victoria

 

The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer’s library.

 

Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.

 

Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org


The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e

ISBN: 0321751043 

"synopsis" may belong to another edition of this title.

About the Author:

Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the TEX and METAFONT systems for computer typesetting, and for his prolific and influential writing (26 books, 161 papers). Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of his seminal multivolume series on classical computer science, begun in 1962 when he was a graduate student at California Institute of Technology. Professor Knuth is the recipient of numerous awards and honors, including the ACM Turing Award, the Medal of Science presented by President Carter, the AMS Steele Prize for expository writing, and, in November, 1996, the prestigious Kyoto Prize for advanced technology. He lives on the Stanford campus with his wife, Jill.

"About this title" may belong to another edition of this title.

Buy New View Book
List Price: US$ 79.99
US$ 61.89

Convert Currency

Shipping: FREE
From United Kingdom to U.S.A.

Destination, Rates & Speeds

Add to Basket

Top Search Results from the AbeBooks Marketplace

1.

Donald E. Knuth
Published by Pearson Education (US), United States (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Hardcover Quantity Available: 10
Seller
The Book Depository US
(London, United Kingdom)
Rating
[?]

Book Description Pearson Education (US), United States, 2011. Hardback. Book Condition: New. Language: English . Brand New Book. Knuth s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth s analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient review of future volumes could almost be: Knuth, Volume n has been published. --Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. --Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer s library. Bookseller Inventory # AAK9780201038040

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 61.89
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

2.

Knuth, Donald E.
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Quantity Available: 1
Seller
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description 2011. HRD. Book Condition: New. New Book.Shipped from US within 10 to 14 business days. Established seller since 2000. Bookseller Inventory # IB-9780201038040

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 57.91
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

3.

Knuth, Donald E.
Published by Prentice Hall
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Quantity Available: > 20
Seller
INDOO
(Avenel, NJ, U.S.A.)
Rating
[?]

Book Description Prentice Hall. Book Condition: New. Brand New. Bookseller Inventory # 0201038048

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 61.26
Convert Currency

Add to Basket

Shipping: US$ 3.50
Within U.S.A.
Destination, Rates & Speeds

4.

Donald E. Knuth
Published by Pearson Education (US), United States (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Hardcover Quantity Available: 10
Seller
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description Pearson Education (US), United States, 2011. Hardback. Book Condition: New. Language: English . Brand New Book. Knuth s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth s analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient review of future volumes could almost be: Knuth, Volume n has been published. --Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. --Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer s library. Bookseller Inventory # AAK9780201038040

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 65.82
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

5.

Donald E. Knuth
Published by Pearson Education (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Quantity Available: 1
Seller
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Pearson Education, 2011. PAP. Book Condition: New. New Book. Shipped from US within 10 to 14 business days. Established seller since 2000. Bookseller Inventory # IB-9780201038040

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 62.12
Convert Currency

Add to Basket

Shipping: US$ 11.59
From United Kingdom to U.S.A.
Destination, Rates & Speeds

6.

Knuth, Donald E.
Published by Addison-Wesley Professional (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Hardcover Quantity Available: 1
Seller
Murray Media
(North Miami Beach, FL, U.S.A.)
Rating
[?]

Book Description Addison-Wesley Professional, 2011. Hardcover. Book Condition: New. Never used!. Bookseller Inventory # 0201038048

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 75.72
Convert Currency

Add to Basket

Shipping: US$ 1.99
Within U.S.A.
Destination, Rates & Speeds

7.

Donald E. Knuth
Published by Addison-Wesley Professional (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Hardcover Quantity Available: 1
Seller
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Addison-Wesley Professional, 2011. Hardcover. Book Condition: New. Bookseller Inventory # SONG0201038048

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 74.80
Convert Currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, Rates & Speeds

8.

Donald E. Knuth
Published by Pearson Education 2011-01-12, Upper Saddle River, N.J. |London (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New paperback Quantity Available: 1
Seller
Blackwell's
(Oxford, OX, United Kingdom)
Rating
[?]

Book Description Pearson Education 2011-01-12, Upper Saddle River, N.J. |London, 2011. paperback. Book Condition: New. Bookseller Inventory # 9780201038040

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 78.97
Convert Currency

Add to Basket

Shipping: US$ 3.86
From United Kingdom to U.S.A.
Destination, Rates & Speeds

9.

Donald E. Knuth
Published by Pearson Education (US), United States (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Hardcover Quantity Available: 10
Seller
Book Depository hard to find
(London, United Kingdom)
Rating
[?]

Book Description Pearson Education (US), United States, 2011. Hardback. Book Condition: New. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. Knuth s multivolume analysis of algorithms is widely recognized as the definitive description of classical computer science. The first three volumes of this work have long comprised a unique and invaluable resource in programming theory and practice. Scientists have marveled at the beauty and elegance of Knuth s analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. The level of these first three volumes has remained so high, and they have displayed so wide and deep a familiarity with the art of computer programming, that a sufficient review of future volumes could almost be: Knuth, Volume n has been published. --Data Processing Digest Knuth, Volume n has been published, where n = 4A. In this long-awaited new volume, the old master turns his attention to some of his favorite topics in broadword computation and combinatorial generation (exhaustively listing fundamental combinatorial objects, such as permutations, partitions, and trees), as well as his more recent interests, such as binary decision diagrams. The hallmark qualities that distinguish his previous volumes are manifest here anew: detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form. There is an amazing amount of information on each page. Knuth has obviously thought long and hard about which topics and results are most central and important, and then, what are the most intuitive and succinct ways of presenting that material. Since the areas that he covers in this volume have exploded since he first envisioned writing about them, it is wonderful how he has managed to provide such thorough treatment in so few pages. --Frank Ruskey, Department of Computer Science, University of Victoria The book is Volume 4A, because Volume 4 has itself become a multivolume undertaking. Combinatorial searching is a rich and important topic, and Knuth has too much to say about it that is new, interesting, and useful to fit into a single volume, or two, or maybe even three. This book alone includes approximately 1500 exercises, with answers for self-study, plus hundreds of useful facts that cannot be found in any other publication. Volume 4A surely belongs beside the first three volumes of this classic work in every serious programmer s library. Bookseller Inventory # BZV9780201038040

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 92.57
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

10.

Donald E. Knuth
Published by Addison-Wesley Professional (2011)
ISBN 10: 0201038048 ISBN 13: 9780201038040
New Hardcover First Edition Quantity Available: 1
Seller
Irish Booksellers
(Rumford, ME, U.S.A.)
Rating
[?]

Book Description Addison-Wesley Professional, 2011. Hardcover. Book Condition: New. book. Bookseller Inventory # M0201038048

More Information About This Seller | Ask Bookseller a Question

Buy New
US$ 92.99
Convert Currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, Rates & Speeds

There are more copies of this book

View all search results for this book