Thomas H. Cormen's Books

Introduction To Algorithms

By: Thomas H Cormen,Charles E Leiserson,Ronald L Rivest,Clifford Stein

Write a review Read reviews Take a Quiz Solve Book Puzzle

Introduction To Algorithms

By: Thomas H Cormen,Charles E Leiserson,Ronald L Rivest,Clifford Stein

An extensively revised edition of a mathematically rigorous yet accessible introduction to algorithms.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

1216

Publisher

MIT Press

Published Date

ISBN 10

0262032937

ISBN 13

9780262032933

Introduction to Algorithms, third edition

By: Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein

Write a review Read reviews Take a Quiz Solve Book Puzzle

Introduction to Algorithms, third edition

By: Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein

The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called “Divide-and-Conquer”), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

1314

Publisher

MIT Press

Published Date

ISBN 10

0262033844

ISBN 13

9780262033848

Introduction to Algorithms, fourth edition

By: Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein

Write a review Read reviews Take a Quiz Solve Book Puzzle

Introduction to Algorithms, fourth edition

By: Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein

A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition New chapters on matchings in bipartite graphs, online algorithms, and machine learning New material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays 140 new exercises and 22 new problems Reader feedback–informed improvements to old problems Clearer, more personal, and gender-neutral writing style Color added to improve visual presentation Notes, bibliography, and index updated to reflect developments in the field Website with new supplementary material Warning: Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

1313

Publisher

MIT Press

Published Date

ISBN 10

026204630X

ISBN 13

9780262046305

Introduction To Algorithms

By: Thomas H Cormen,Charles E Leiserson,Ronald L Rivest,Clifford Stein

Write a review Read reviews Take a Quiz Solve Book Puzzle

Introduction To Algorithms

By: Thomas H Cormen,Charles E Leiserson,Ronald L Rivest,Clifford Stein

An extensively revised edition of a mathematically rigorous yet accessible introduction to algorithms.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

1216

Publisher

MIT Press

Published Date

ISBN 10

0262032937

ISBN 13

9780262032933

Algorithms Unlocked

By: Thomas H. Cormen

Write a review Read reviews Take a Quiz Solve Book Puzzle

Algorithms Unlocked

By: Thomas H. Cormen

For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms. Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations translate themselves into your GPS, your laptop, or your smart phone? This book offers an engagingly written guide to the basics of computer algorithms. In Algorithms Unlocked, Thomas Cormen—coauthor of the leading college textbook on the subject—provides a general explanation, with limited mathematics, of how algorithms enable computers to solve problems. Readers will learn what computer algorithms are, how to describe them, and how to evaluate them. They will discover simple ways to search for information in a computer; methods for rearranging information in a computer into a prescribed order (“sorting”); how to solve basic problems that can be modeled in a computer with a mathematical structure called a “graph” (useful for modeling road networks, dependencies among tasks, and financial relationships); how to solve problems that ask questions about strings of characters such as DNA structures; the basic principles behind cryptography; fundamentals of data compression; and even that there are some problems that no one has figured out how to solve on a computer in a reasonable amount of time.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

237

Publisher

MIT Press

Published Date

ISBN 10

0262518805

ISBN 13

9780262518802

Algorithms Unlocked

By: Thomas H. Cormen

Write a review Read reviews Take a Quiz Solve Book Puzzle

Algorithms Unlocked

By: Thomas H. Cormen

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

240

Publisher

MIT Press

Published Date

ISBN 10

0262313235

ISBN 13

9780262313230

Introduction to Algorithms and Java CD-ROM

By: Thomas Cormen,Charles Leiserson,Ronald Rivest,Clifford Stein

Write a review Read reviews Take a Quiz Solve Book Puzzle

Introduction to Algorithms and Java CD-ROM

By: Thomas Cormen,Charles Leiserson,Ronald Rivest,Clifford Stein

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforce the concepts the students are learning.

Average ratings

N/A

Write a review

Solve jigsaw puzzle

Age

Page Count

1056

Publisher

McGraw-Hill Science/Engineering/Math

Published Date

ISBN 10

0072970545

ISBN 13

9780072970548

Book's by Thomas H. Cormen

Introduction To Algorithms

Introduction To Algorithms

Introduction to Algorithms, third edition

Introduction to Algorithms, third edition

Introduction to Algorithms, fourth edition

Introduction to Algorithms, fourth edition

Introduction To Algorithms

Introduction To Algorithms

Algorithms Unlocked

Algorithms Unlocked

Algorithms Unlocked

Algorithms Unlocked

Introduction to Algorithms and Java CD-ROM

Introduction to Algorithms and Java CD-ROM

Username

Password

Username

Password

Password again

Birthday

Email