Introduction to Algorithms Export

@book{citeulike:201727, abstract = {Aimed at any serious programmer or computer science student, the new second edition of \_Introduction to Algorithms\_ builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the maths- averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems. With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job at explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some maths background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked list to trees (including binary trees, red-black and B-trees), this title really shines with clear diagrams that show algorithms in operation. Even if you glance over the mathematical notation here, you can definitely benefit from this text in other ways. The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortised analysis). Algorithms for graphing problems (used in such real-world business problems as optimising flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions. This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveloling salesmen problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers. Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome project), business, and engineering. Each section ends with short discussions of related historical material often discussing original research in each area of algorithms. In all, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, \_The Art of Computer Programming\_), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. \_--Richard Dragan\_}, author = {Cormen, Thomas H. and Stein, Clifford and Leiserson, Charles E. and Rivest, Robert L.}, citeulike-article-id = {201727}, citeulike-linkout-0 = {http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0262531968}, citeulike-linkout-1 = {http://www.amazon.de/exec/obidos/redirect?tag=citeulike01-21&path=ASIN/0262531968}, citeulike-linkout-2 = {http://www.amazon.fr/exec/obidos/redirect?tag=citeulike06-21&path=ASIN/0262531968}, citeulike-linkout-3 = {http://www.amazon.jp/exec/obidos/ASIN/0262531968}, citeulike-linkout-4 = {http://www.amazon.co.uk/exec/obidos/ASIN/0262531968/citeulike00-21}, citeulike-linkout-5 = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0262531968}, citeulike-linkout-6 = {http://www.worldcat.org/isbn/0262531968}, citeulike-linkout-7 = {http://books.google.com/books?vid=ISBN0262531968}, citeulike-linkout-8 = {http://www.amazon.com/gp/search?keywords=0262531968&index=books&linkCode=qs}, citeulike-linkout-9 = {http://www.librarything.com/isbn/0262531968}, day = {10}, edition = {2nd Revised edition}, howpublished = {Taschenbuch}, isbn = {0262531968}, keywords = {algorithms, book}, month = {August}, posted-at = {2005-05-17 01:06:34}, priority = {5}, publisher = {B\&T}, title = {Introduction to Algorithms}, url = {http://www.amazon.com/exec/obidos/redirect?tag=citeulike07-20&path=ASIN/0262531968}, year = {2001} }

TY - BOOK ID - citeulike:201727 L3 - citeulike-article-id:201727 N2 - Aimed at any serious programmer or computer science student, the new second edition of _Introduction to Algorithms_ builds on the tradition of the original with a truly magisterial guide to the world of algorithms. Clearly presented, mathematically rigorous, and yet approachable even for the maths- averse, this title sets a high standard for a textbook and reference to the best algorithms for solving a wide range of computing problems. With sample problems and mathematical proofs demonstrating the correctness of each algorithm, this book is ideal as a textbook for classroom study, but its reach doesn't end there. The authors do a fine job at explaining each algorithm. (Reference sections on basic mathematical notation will help readers bridge the gap, but it will help to have some maths background to appreciate the full achievement of this handsome hardcover volume.) Every algorithm is presented in pseudo-code, which can be implemented in any computer language, including C/C++ and Java. This ecumenical approach is one of the book's strengths. When it comes to sorting and common data structures, from basic linked list to trees (including binary trees, red-black and B-trees), this title really shines with clear diagrams that show algorithms in operation. Even if you glance over the mathematical notation here, you can definitely benefit from this text in other ways. The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortised analysis). Algorithms for graphing problems (used in such real-world business problems as optimising flight schedules or flow through pipelines) come next. In each case, the authors provide the best from current research in each topic, along with sample solutions. This text closes with a grab bag of useful algorithms including matrix operations and linear programming, evaluating polynomials and the well-known Fast Fourier Transformation (FFT) (useful in signal processing and engineering). Final sections on "NP-complete" problems, like the well-known traveloling salesmen problem, show off that while not all problems have a demonstrably final and best answer, algorithms that generate acceptable approximate solutions can still be used to generate useful, real-world answers. Throughout this text, the authors anchor their discussion of algorithms with current examples drawn from molecular biology (like the Human Genome project), business, and engineering. Each section ends with short discussions of related historical material often discussing original research in each area of algorithms. In all, they argue successfully that algorithms are a "technology" just like hardware and software that can be used to write better software that does more with better performance. Along with classic books on algorithms (like Donald Knuth's three-volume set, _The Art of Computer Programming_), this title sets a new standard for compiling the best research in algorithms. For any experienced developer, regardless of their chosen language, this text deserves a close look for extending the range and performance of real-world software. _--Richard Dragan_ SN - 0262531968 TI - Introduction to Algorithms PB - B&T KW - algorithms KW - book AU - Cormen, Thomas AU - Stein, Clifford AU - Leiserson, Charles AU - Rivest, Robert PY - 2001/08/10/ UR - http://www.amazon.ca/exec/obidos/redirect?tag=citeulike09-20&path=ASIN/0262531968 ER -