Art Computer Programming Volumes by Knuth Donald (39 results)

Hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Condition: Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority.

Condition: Very Good. Very Good condition. No Dust Jacket 3 Volume Set. (Computer Programming) NOT AVAILABLE FOR SHIPMENT OUTSIDE OF THE UNITED STATES.

Condition: Like New. Brand new four volume set in case. Text block, pages, boards and bindings are pristine, dust wrappers like new. Supporting Bay Area Friends of the Library since 2010. Well packaged and promptly shipped.

hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Hardcover. Condition: Very Good. These three volumes of Donald Knuth's The Art of Computer Programming (Fundamental Algorithms, Seminumerical Algorithms, Sorting and Searching) were formerly part of the Naval Research Laboratory - Underwater Sound Reference Division (USRD) library in Orlando, Florida. The USRD was a specialized Navy research branch focused on underwater acoustics, sonar calibration, signal processing, and reference standards. During the late 1960s and early 1970s, the division conducted extensive computational and mathematical research - making Knuth's early algorithm volumes highly relevant to their work during the Cold War. These copies date 1969-1973, and align precisely with the period when NRL facilities were adopting formal algorithmic methods for modeling underwater sound propagation, digital signal processing, and early computational analysis. Books are HEAVY and in excellent condition with just a few condition issues (such as foxing to the outside page edges). Hard cover edition. 1980 pages. Dimensions: 6.5" by 9.5". B&W illustrations. Beige binding. Cover defect(s): Some staining/marking/writing/stickers. Page defect(s): Some writing. 9.5 Pound Media Shipping Rate. Combine items and SAVE! Genre(s): Computer Science / Cold War / Reference / Eng / Library Survivors. (B119). …

Hardcover. Condition: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Hardcover. Condition: New. 1. The item is brand new, never used or read. It's in perfect condition and may include supplements and/or access codes or come shrink-wrapped.

Condition: NEW.

Condition: New.

hardcover. Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. Brand new! Please provide a physical shipping address.

UNK. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Hardcover. Condition: new. Hardcover. Now Includes the Long-Anticipated Volume 4B! Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books. Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library. These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf. This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because ". . . a single good idea can save years or even centuries of computer time." "Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers." --Christine Solnon, Department of Computer Science, INSA Lyon This box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2 Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…

Taschenbuch. Condition: Neu. Art of Computer Programming, The, Volumes 1-4B, Boxed Set | Donald Knuth (u. a.) | Taschenbuch | 736 S. | Englisch | 2022 | Pearson | EAN 9780137935109 | Verantwortliche Person für die EU: Pearson Studium im Verlag Pearson Benelux B.V. Zweigniederla, Sankt-Martin-Str. 82, 81541 München, buchhandel[at]pearson[dot]com | Anbieter: preigu. …

Taschenbuch. Condition: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B!Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his 'cookbook' solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf.This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because '. . . a single good idea can save years or even centuries of computer time.''Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers.' --Christine Solnon, Department of Computer Science, INSA LyonThis box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2 736 pp. Englisch.…

Taschenbuch. Condition: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B!Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his 'cookbook' solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf.This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because '. . . a single good idea can save years or even centuries of computer time.''Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers.' --Christine Solnon, Department of Computer Science, INSA LyonThis box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2 736 pp. Englisch.…

Taschenbuch. Condition: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B.

Condition: New. pp. 736.

hardcover. Condition: New. Special order direct from the distributor.

Gebunden. Condition: New. &Uumlber den AutorDonald 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 hi.

Condition: New. pp. 736.

Condition: New. pp. 736.

Taschenbuch. Condition: Neu. Neuware -Now Includes the Long-Anticipated Volume 4B!Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his 'cookbook' solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf.This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because '. . . a single good idea can save years or even centuries of computer time.''Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers.' --Christine Solnon, Department of Computer Science, INSA LyonThis box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2GPSR Kontakt, Harvestehuder Weg 42, 20149 Hamburg 736 pp. Englisch.…

Condition: new.

hardcover. Condition: Gut. 3168 Seiten; 9780321751041.3 Gewicht in Gramm: 11.

Taschenbuch. Condition: Neu. Neuware - Now Includes the Long-Anticipated Volume 4B!Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his 'cookbook' solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem. Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.These five books comprise what easily could be the most important set of information on any serious programmer's bookshelf.This set now includes Volume 4B, the sequel to Volume 4A, which extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen interest to software designers because '. . . a single good idea can save years or even centuries of computer time.''Donald Knuth may very well be a great master of the analysis of algorithms, but more than that, he is an incredible and tireless storyteller who always strikes the perfect balance between theory, practice, and fun. [The Art of Computer Programming, Volume 4B, Combinatorial Algorithms, Part 2,] dives deep into the fascinating exploration of search spaces (which is quite like looking for a needle in a haystack or, even harder, to prove the absence of a needle in a haystack), where actions performed while moving forward must be meticulously undone when backtracking. It introduces us to the beauty of dancing links for removing and restoring the cells of a matrix in a dance which is both simple to implement and very efficient. And it studies the iconic and versatile satisfiability problem and carefully analyses various ingredients of SAT solvers.' --Christine Solnon, Department of Computer Science, INSA LyonThis box set includes the following volumes: The Art of Computer Programming: Volume 1: Fundamental Algorithms, 3rd EditionThe Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd EditionThe Art of Computer Programming: Volume 3: Sorting and Searching, 2nd EditionThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1The Art of Computer Programming, Volume 4B: Combinatorial Algorithms, Part 2.…

Condition: New. 2023. 1st Edition. Hardcover. . . . . .