Introduction to Algorithms

Zusammenfassung A new edition of the essential text and professional reference! with substantial new material on such topics as vEB trees! multithreaded algorithms! dynamic programming! and edge-base flow. Informationen zum Autor Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson! Ronald L. Rivest! and Clifford Stein) of the leading textbook on computer algorithms! Introduction to Algorithms (third edition! MIT Press! 2009). Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University. Klappentext A new edition of the essential text and professional reference! with substantial new material on such topics as vEB trees! multithreaded algorithms! dynamic programming! and edge-base flow.

Auteur

Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

Texte du rabat

NOT AVAILABLE IN THE US OR CANADA. International Student Paperback Edition. A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.

Résumé
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.