Introduction to Algorithms

Introduction to Algorithms

"Introduction to Algorithms" is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is used as the textbook for algorithms courses at many universities.

Cormen teaches at Dartmouth College, Rivest and Leiserson teach at MIT, and Stein teaches at Columbia.


The first edition of the textbook did not include Stein as an author, and thus the book became known by the acronym CLR. After the addition of the fourth author in the second edition, many began to refer to the book as CLRS. (Although many misread it as "CLR's Second edition") This first edition of the book was also known as "The Big White Book (of Algorithms)." With the second edition, the predominant color of the cover changed to green, causing the nickname to be shortened to just "The Big Book (of Algorithms)." [ [ Steiner Trees: Bookstore ] ] [ [ Neato Tech Books (J. Blustein) ] ]


This book is also available with a companion CD-ROM including examples in Java.

Cover design

The mobile located on the cover, Big Red by Alexander Calder, can be found at the Phillips Collection, a modern art museum in Dupont Circle in Washington, DC.


* cite book
first = Thomas H.
last = Cormen
coauthors = Leiserson, Charles E.; Rivest, Ronald L.
title = Introduction to Algorithms
edition = first edition
publisher = MIT Press and McGraw-Hill
date = 1990
id = ISBN 0-262-03141-8

* cite book
first = Thomas H.
last = Cormen
coauthors = Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford
title = Introduction to Algorithms
publisher = MIT Press and McGraw-Hill
DATE = 2001
id = ISBN 0-262-53196-8
edition = second edition

External links

* [,M1 The online edition of the book, by Google]
* [ McGraw-Hill site]
* [ Authors' site]
* [ Book's own site]
* [ Via MIT OpenCourseWare: site on book-based course held by coauthor]

Wikimedia Foundation. 2010.

Поможем написать реферат

Look at other dictionaries:

  • Convex hull algorithms — Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science, see Convex hull applications . In computational geometry, numerous algorithms are proposed for computing the convex… …   Wikipedia

  • Analysis of algorithms — To analyze an algorithm is to determine the amount of resources (such as time and storage) necessary to execute it. Most algorithms are designed to work with inputs of arbitrary length. Usually the efficiency or running time of an algorithm is… …   Wikipedia

  • Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… …   Wikipedia

  • Navigational Algorithms — is a source of information whose purpose is to make available the scientific part of the art of navigation, containing specialized articles and software that implements the various procedures of calculus. The topics covered are: Celestial… …   Wikipedia

  • Standard algorithms — In elementary arithmetic, a standard algorithm or method is an efficient manual method of computation which yields one correct answer, and has been traditionally taught over a long period of time. These methods vary somewhat by nation and time,… …   Wikipedia

  • Cryptanalysis of TIA's Common Cryptographic Algorithms — In 1992, the TR 45 working group within the Telecommunications Industry Association (TIA) developed a standard for integration of cryptographic technology into tomorrow s digital cellular systems [TIA92] , which has been updated at least once… …   Wikipedia

  • List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… …   Wikipedia

  • Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… …   Wikipedia

  • Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… …   Wikipedia

  • Distributed computing — is a field of computer science that studies distributed systems. A distributed system consists of multiple autonomous computers that communicate through a computer network. The computers interact with each other in order to achieve a common goal …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”