Addison Wesley US | 1998 | 716 blz. | Robert Sedgewick

Tutorial for Users, Intermediate and Advanced Level, behandelt US versie

boek | 5833-C7 | € 79,90 (75,38 excl. BTW) | ISBN: 9780201350883 / 0201350882 | Engels US

Addison Wesley US | Robert Sedgewick

Tutorial and Reference for Developers, Beginning, Intermediate and Advanced Level, behandelt US versie

boek | 6510-D1 | € 86,90 (81,98 excl. BTW) | ISBN: 9780201726848 / 020172684X | Engels US

Addison Wesley US | 2002 | 496 blz. | Robert Sedgewick

Coverage includes: A complete overview of graph properties and types; Diagraphs and DAGs; Minimum spanning trees; Shortest paths; Network flows

Tutorial and Reference for Developers, Intermediate and Advanced Level, behandelt US versie

boek | 9384-F7 | € 28,90 (27,26 excl. BTW) | ISBN: 9780201361186 / 0201361183 | Engels US

Addison Wesley US | 1997 | Donald E. Knuth

Tutorial and Reference for Developers, Intermediate and Advanced Level, behandelt US versie

boek | 1930-F1 | € 138,90 (131,04 excl. BTW) | ISBN: 9780201485417 / 0201485419 | Engels US

Addison Wesley US | 1997 | 762 blz., hardcover | Donald E. Knuth

Seminumerical Algorithms

boek | 216-B7 | € 61,00 (57,55 excl. BTW) | ISBN: 9780201896848 / 0201896842 | Engels US

Addison Wesley US | 2008 | 216 blz. | Donald E. Knuth

This fascicle introduces what will become by far the longest chapter in The Art of Computer Programming, a chapter on combinatorial algoritms that will itself free three full-sized volumes. Combinatorial algorithms, informally, are techniques for the high-speed manipulation of extremely large quantities of objects, such as permutations or the elements of graphs.

Tutorial for Developers, Intermediate and Advanced Level, behandelt US versie

boek | 14385-A7 | € 16,90 (15,94 excl. BTW) | ISBN: 9780321534965 / 0321534964 | Engels US

Addison Wesley US | 2005 | 127 blz. | Donald E. Knuth

Newly Available Sections of the Classic Work.
This fascicle inaugurates the eagerly awaited publication of Knuth's The Art of Computer Programming, Volume 4: Combinatorial Algorithms. Part of what will be a long chapter on combinatorial searching, the fascicle begins his treatment of how to generate all possibilities

Tutorial for Developers, Intermediate and Advanced Level, behandelt US versie

boek | 4197-F8 | € 16,90 (15,94 excl. BTW) | ISBN: 9780201853933 / 0201853930 | Engels US

Addison Wesley US | 2005 | 150 blz. | Donald E. Knuth

Newly Available Sections of the Classic Work.
This fascicle continues Knuth's authoritative chapter on combinatorial algorithms, ultimately to be included in Volume 4 of the Art of Computer Programming. The previous fascicle from Volume 4, which covered the generation of all tuples and permutations, is now complemented by techniques for generating all combinations and partitions

Reference for Developers, Intermediate and Advanced Level, behandelt US versie

boek | 4673-F8 | € 16,90 (15,94 excl. BTW) | ISBN: 9780201853940 / 0201853949 | Engels US

Addison Wesley US | 2006 | 120 blz. | Donald E. Knuth

Newly Available Sections of the Classic Work.
This latest fascicle covers the generation of all trees, a basic topic that has surprisingly rich ties to the first three volumes of The Art of Computer Programming. This fascicle also covers the history of combinatorial generation

Reference for Developers, Intermediate and Advanced Level, behandelt US versie

boek | 5615-F4 | € 16,90 (15,94 excl. BTW) | ISBN: 9780321335708 / 0321335708 | Engels US

Addison Wesley US | 2007 | 562 blz. | Anany Levitin

Takes advantage of a new taxonomy of algorithm design techniques that has been developed by the book's author

Tutorial for Developers, Intermediate and Advanced Level, behandelt US versie

boek | 8503-E0 | € 74,90 (70,66 excl. BTW) | ISBN: 9780321364135 / 0321364139 | Engels US