Introduction to Algorithms, fourth edition

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

$340

Hardback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

MIT Press
03 May 2022

Mathematics & Sciences; Algorithms & data structures

A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics.

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.

By: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Imprint: MIT Press
Country of Publication: United States
Dimensions: Height: 229mm, Width: 203mm,
Weight: 567g
ISBN: 9780262046305
ISBN 10: 026204630X
Pages: 1332
Publication Date: 03 May 2022
Audience: General/trade , ELT Advanced
Format: Hardback
Publisher's Status: Active

Thomas H. Cormen is Emeritus Professor of Computer Science at Dartmouth College. Charles E. Leiserson is Edwin Sibley Webster Professor in Electrical Engineering and Computer Science at MIT. Ronald L. Rivest is Institute Professor at MIT. Clifford Stein is Wai T. Chang Professor of Industrial Engineering and Operations Research, and of Computer Science at Columbia University.