Your cart is empty.
  • Home

    Introduction to algorithms / Thomas H. Cormen ... [et al.].

    Contributor(s): Cormen, Thomas HMaterial type: TextTextPublisher: Cambridge, Mass. : MIT Press, c2009Edition: 3rd edDescription: xix, 1292 p. : ill. ; 24 cmISBN: 9780262033848 (hardcover : alk. paper); 0262033844 (hardcover : alk. paper); 9780262533058 (pbk. : alk. paper); 0262533057 (pbk. : alk. paper)Subject(s): Computer programming | Computer algorithmsDDC classification: 005.1 LOC classification: QA76.6 | .C662 2009
    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.
    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]
    Tags from this library: No tags from this library for this title. Log in to add tags.
        Average rating: 0.0 (0 votes)
    Item type Current library Call number Copy number Status Notes Date due Barcode
    Books Books Female Library
    		QA76.6 .C662 2009 (Browse shelf (Opens below)) 1 Available STACKS 51952000096917
    Books Books Main Library
    		QA76.6 .C662 2009 (Browse shelf (Opens below)) 1 Available STACKS 51952000124900

    Includes bibliographical references (p. [1231]-1250) and index.

    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]

    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.

    1 2

    There are no comments on this title.

    to post a comment.