Professor Charles E. Leiserson discusses the latest edition of the Introduction to Algorithms textbook: 1) Why do a new edition? 2) What's new in the 3rd edition? 3) What did each author focus on, and how did they work together? 4) What's in the Multithreaded Algorithms section? In addition to answering the questions, Charles makes a decent case for why algorithms are both fun and important :)
Tags: algorithms, multithreading, leiserson, cilk++
No comments:
Post a Comment