Introduction to Algorithms

Taal: Engels
Introduction to Algorithms
Afbeelding 1 van 2
  • Engels
  • Hardcover
  • 9780262033848
  • Druk: third edition
  • juli 2009
  • 1320 pagina's
Alle productspecificaties

Thomas H. Cormen

"Thomas H. Cormen is the co-author of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. In 2013, he published a new book titled Algorithms Unlocked. He is a professor of computer science at Dartmouth College and former Chair of the Dartmouth College Department of Computer Science. Between 2004 and 2008 he directed the Dartmouth College Writing Program. His research interests are algorithm engineering, parallel computing, speeding up computations with high latency.

(Bron: Wikipedia. Beschikbaar onder de licentie Creative Commons Naamsvermelding/Gelijk delen.)"

Samenvatting

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. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called Divide-and-Conquer ), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

Lees de eerste pagina's

Productspecificaties

Inhoud

Taal
Engels
Bindwijze
Hardcover
Druk
third edition
Verschijningsdatum
juli 2009
Afmetingen
24,1 x 21,6 x 5,1 cm
Aantal pagina's
1320 pagina's
Aanbevolen leeftijd
18 jaar
Illustraties
Nee

EAN

EAN
9780262033848

Overige kenmerken

Extra groot lettertype
Nee
NUR code
989

Je vindt dit artikel in

Categorieën
Taal
Engels
Boek, ebook of luisterboek?
Boek
Snelle bezorgopties
Vandaag Bezorgd, Vandaag Ophalen, Avondbezorging, Zondagbezorging, Gratis verzending
Nog geen reviews
Editie: third edition
93 66
Op voorraad
Select
Voor 23:59 besteld, morgen in huis Tooltip
Verkoop door bol.com
In winkelwagen
Andere verkopers (2)

Bezorgopties

  • Vandaag nog in huis (bestel doordeweeks voor 14:00, bezorging tussen 18:00 en 22:00)
  • Doordeweeks ook ’s avonds in huis
  • Ook zondag in huis (bestel voor za 23:59)
Bekijk alle bezorgopties
  • Gratis verzending door bol.com
  • Ophalen bij een bol.com afhaalpunt mogelijk
  • 30 dagen bedenktijd en gratis retourneren
  • Dag en nacht klantenservice