UMN Library

  • Home
  • Library Information
  • Librarian
  • Help on Usage
  • Member Login
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Introduction to algorithms. Third Edition
Bookmark Share

Text

Introduction to algorithms. Third Edition

Cormen, Thomas H. - Personal Name; Leiserson, Charles Eric - Personal Name; Rivest, Ronald L. - Personal Name;

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.


Availability
#
My Library 005.1 Cor i
18/01478
Available
#
My Library 005.1 Cor i
18/01479
Available
Detail Information
Series Title
-
Call Number
005.1 Cor i
Publisher
Cambridge : MIT Press., 2009
Collation
1292 p. ; 24 cm.
Language
ISBN/ISSN
9780262033848
Classification
005.1
Content Type
-
Media Type
-
Carrier Type
-
Edition
Third Edition
Subject(s)
COMPUTER PROGRAMMING
Computer algorithms
Data structures (Computer science)
ALGORITHMS
Specific Detail Info
-
Statement of Responsibility
-
Other version/related

No other version available

File Attachment
No Data

UMN Library
  • Information
  • Services
  • Librarian
  • Member Area

About Us

SLIMS UMN helps you explore UMN Library collections while handling core services such as cataloging, loans, and member management.

Links

  • Knowledge Center
  • Online Library
  • E-journals
  • MyUMN
  • E-learning
Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?