skip to content
Introduction to algorithms Preview this item
ClosePreview this item
Checking...

Introduction to algorithms

Author: Thomas H Cormen; Charles Eric Leiserson; Ronald L Rivest; Clifford Stein
Publisher: Cambridge, Mass. : MIT Press, [2009] ©2009
Edition/Format:   Print book : English : Third editionView all editions and formats
Summary:
This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover].
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: Thomas H Cormen; Charles Eric Leiserson; Ronald L Rivest; Clifford Stein
ISBN: 9780262033848 0262033844 9780262533058 0262533057 0262270838 9780262270830
OCLC Number: 311310321
Description: xix, 1292 pages : illustrations ; 24 cm
Contents: I. Foundations. The role of algorithms in computing --
Getting started --
Growth of functions --
Divide-and-conquer --
Probabilistic analysis and randomized algorithms --
II. Sorting and order statistics. Heapsort --
Quicksort --
Sorting in linear time --
Medians and order statistics --
III. Data structures. Elementary data structures --
Hash tables --
Binary search trees --
Red-black trees --
Augmenting data structures --
IV. Advanced design and analysis techniques. Dynamic programming --
Greedy algorithms --
Amortized analysis --
V. Advanced data structures. B-trees --
Fibonacci heaps --
van Emde Boas trees --
Data structures for disjoint sets --
VI. Graph algorithms. Elementary graph algorithms --
Minimum spanning trees --
Single-source shortest paths --
All-pairs shortest paths --
Maximun flow --
VII. Selected topics. Multithreaded algorithms --
Matrix operations --
Linear programming --
Polynomials and the FFT --
Number-theoretic algorithms --
String matching --
Computational geometry --
NP-completeness --
Approximation algorithms --
VIII. Appendix: Mathematical background. Summations --
Sets, etc. --
Counting and probability --
Matrices.
Responsibility: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
More information:

Abstract:

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.  Read more...

Reviews

Editorial reviews

Publisher Synopsis

"As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(11)

User lists with this item (6)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/311310321> # Introduction to algorithms
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "311310321" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algoritmen> ; # Algoritmen
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmus> ; # Algorithmus
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/datoralgoritmer> ; # Datoralgoritmer
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmentheorie> ; # Algorithmentheorie
   schema:about <http://dewey.info/class/005.1/e22/> ;
   schema:about <http://id.worldcat.org/fast/872010> ; # Computer algorithms
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmische_programmierung> ; # Algorithmische Programmierung
   schema:about <http://id.worldcat.org/fast/872390> ; # Computer programming
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/datastrukturer> ; # Datastrukturer
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/datenstruktur> ; # Datenstruktur
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/bilgasayar_programlama> ; # Bilgasayar programlama
   schema:about <http://experiment.worldcat.org/entity/work/data/6419620#Topic/bilgisayar_algoritmalari> ; # Bilgisayar algoritmaları
   schema:bookEdition "Third edition." ;
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/23967971> ; # Clifford Stein
   schema:contributor <http://viaf.org/viaf/93446737> ; # Thomas H. Cormen
   schema:contributor <http://viaf.org/viaf/101783249> ; # Ronald L. Rivest
   schema:contributor <http://viaf.org/viaf/32081339> ; # Charles Eric Leiserson
   schema:copyrightYear "2009" ;
   schema:datePublished "2009" ;
   schema:description "I. Foundations. The role of algorithms in computing -- Getting started -- Growth of functions -- Divide-and-conquer -- Probabilistic analysis and randomized algorithms -- II. Sorting and order statistics. Heapsort -- Quicksort -- Sorting in linear time -- Medians and order statistics -- III. Data structures. Elementary data structures -- Hash tables -- Binary search trees -- Red-black trees -- Augmenting data structures -- IV. Advanced design and analysis techniques. Dynamic programming -- Greedy algorithms -- Amortized analysis -- V. Advanced data structures. B-trees -- Fibonacci heaps -- van Emde Boas trees -- Data structures for disjoint sets -- VI. Graph algorithms. Elementary graph algorithms -- Minimum spanning trees -- Single-source shortest paths -- All-pairs shortest paths -- Maximun flow -- VII. Selected topics. Multithreaded algorithms -- Matrix operations -- Linear programming -- Polynomials and the FFT -- Number-theoretic algorithms -- String matching -- Computational geometry -- NP-completeness -- Approximation algorithms -- VIII. Appendix: Mathematical background. Summations -- Sets, etc. -- Counting and probability -- Matrices."@en ;
   schema:description "This edition has been revised and updated throughout. It includes some new chapters. It features improved treatment of dynamic programming and greedy algorithms as well as a new notion of edge-based flow in the material on flow networks.--[book cover]."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/6419620> ;
   schema:inLanguage "en" ;
   schema:isSimilarTo <http://worldcat.org/entity/work/data/6419620#CreativeWork/> ;
   schema:name "Introduction to algorithms"@en ;
   schema:productID "311310321" ;
   schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017675862&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
   schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017675862&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
   schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=017675862&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
   schema:url <http://mitpress-ebooks.mit.edu/product/introduction-to-algorithms> ;
   schema:workExample <http://worldcat.org/isbn/9780262533058> ;
   schema:workExample <http://worldcat.org/isbn/9780262033848> ;
   schema:workExample <http://worldcat.org/isbn/9780262270830> ;
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA976420> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/311310321> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmentheorie> # Algorithmentheorie
    a schema:Intangible ;
   schema:name "Algorithmentheorie"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/algorithmische_programmierung> # Algorithmische Programmierung
    a schema:Intangible ;
   schema:name "Algorithmische Programmierung"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/bilgasayar_programlama> # Bilgasayar programlama
    a schema:Intangible ;
   schema:name "Bilgasayar programlama"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/6419620#Topic/bilgisayar_algoritmalari> # Bilgisayar algoritmaları
    a schema:Intangible ;
   schema:name "Bilgisayar algoritmaları"@en ;
    .

<http://id.worldcat.org/fast/872010> # Computer algorithms
    a schema:Intangible ;
   schema:name "Computer algorithms"@en ;
    .

<http://id.worldcat.org/fast/872390> # Computer programming
    a schema:Intangible ;
   schema:name "Computer programming"@en ;
    .

<http://viaf.org/viaf/101783249> # Ronald L. Rivest
    a schema:Person ;
   schema:familyName "Rivest" ;
   schema:givenName "Ronald L." ;
   schema:name "Ronald L. Rivest" ;
    .

<http://viaf.org/viaf/23967971> # Clifford Stein
    a schema:Person ;
   schema:birthDate "1965" ;
   schema:familyName "Stein" ;
   schema:givenName "Clifford" ;
   schema:name "Clifford Stein" ;
    .

<http://viaf.org/viaf/32081339> # Charles Eric Leiserson
    a schema:Person ;
   schema:familyName "Leiserson" ;
   schema:givenName "Charles Eric" ;
   schema:name "Charles Eric Leiserson" ;
    .

<http://viaf.org/viaf/93446737> # Thomas H. Cormen
    a schema:Person ;
   schema:familyName "Cormen" ;
   schema:givenName "Thomas H." ;
   schema:name "Thomas H. Cormen" ;
    .

<http://worldcat.org/isbn/9780262033848>
    a schema:ProductModel ;
   schema:isbn "0262033844" ;
   schema:isbn "9780262033848" ;
    .

<http://worldcat.org/isbn/9780262270830>
    a schema:ProductModel ;
   schema:isbn "0262270838" ;
   schema:isbn "9780262270830" ;
    .

<http://worldcat.org/isbn/9780262533058>
    a schema:ProductModel ;
   schema:isbn "0262533057" ;
   schema:isbn "9780262533058" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.