The Art of Computer Programming, Volume 4
by Donald E. Knuth
Publisher: Addison-Wesley Professional 2006
ISBN/ASIN: 0321335708
Number of pages: 128
Description:
This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
Download or read it online for free here:
Download link
(multiple PDF,PS files)
Similar books
Efficient Algorithms for Sorting and Synchronizationby Andrew Tridgell - samba.org
This thesis presents efficient algorithms for parallel sorting and remote data update. The sorting algorithms approach the problem by concentrating first on efficient but incorrect algorithms followed by a cleanup phase that completes the sort.
(9973 views)
Open Data Structures: An Introductionby Pat Morin - AU Press
Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
(11385 views)
Elementary Algorithmsby Larry LIU Xinyu - Github
'Elementary Algorithms' is a free book about elementary algorithms and data structures. This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures.
(3660 views)
A Practical Introduction to Data Structures and Algorithm Analysisby Clifford A. Shaffer - Virginia Tech
A comprehensive treatment of fundamental data structures and algorithm analysis with a focus on how to create efficient data structures and algorithms. Aims to help the reader gain an understanding of how to select or design the best data structure.
(9373 views)