Books: Difference between revisions

Jump to navigation Jump to search
110 bytes added ,  4 years ago
[unchecked revision][unchecked revision]
m (type)
Line 6:
|title=Algorithms
|author=Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
|year=2006
|supp=[http://www.cs.berkeley.edu/~vazirani/algorithms.html Penultimate draft], [http://cseweb.ucsd.edu/~dasgupta/book/index.html Errata], [http://highered.mcgraw-hill.com/sites/0073523402/ Link]
|description=This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest.
Line 18 ⟶ 19:
|review=}}
 
{{Book|ISBN=0130220051|titleASIN=Algorithms and Data Structures|author=Niklaus Wirth0130220051
|title=Algorithms and Data Structures|author=Niklaus Wirth
|year=1985
|supp=[http://www.inf.ethz.ch/personal/wirth/AD.pdf Oberon Version 2004]
|description=The classical textbook on algorithms and data structures. Citing the amazon review of "oversteer": The book goes over practically important algorithms and data structures. It may not include the latest and greatest advances, but it is still very relevant in today's practical applications.
Line 27 ⟶ 30:
|title=Algorithms, 4th ed.
|author=Kevin Wayne, and Robert Sedgewick
|year=2011
|supp=[http://algs4.cs.princeton.edu/ Link]
|description=The textbook ''Algorithms, 4th Edition'' by Robert Sedgewick and Kevin Wayne [ [http://www.amazon.com/Algorithms-4th-Robert-Sedgewick/dp/032157351X Amazon] · [http://www.pearsonhighered.com/educator/product/Algorithms/9780321573513.page Pearson] · [http://www.informit.com/store/product.aspx?isbn=032157351X InformIT] ] surveys the most important algorithms and data structures in use today. The textbook is organized into six chapters:
Line 42 ⟶ 46:
{|
|-
| rowspan="56" valign="top" align="center" width="200" |
[[Image:ISBN_0321751043.jpg|120px]]<br/>[http://www.amazon.com/exec/obidos/ASIN/0321751043/osdev-20/ http://wiki.osdev.org/images/3/3a/Buy_from_amazon.gif]<br/><br/>
[[Image:ISBN_0201853922.jpg|120px]]<br/>[http://www.amazon.com/exec/obidos/ASIN/0201853922/osdev-20/ http://wiki.osdev.org/images/3/3a/Buy_from_amazon.gif]
Line 48 ⟶ 52:
|-
| valign="top" height="10" | '''Author(s):''' Donald E. Knuth
|-
| valign="top" height="10" | '''Year:''' 2011
|-
| valign="top" height="10" | '''Supplementary material and/or errata:''' [http://www-cs-faculty.stanford.edu/~uno/taocp.html Link]
Line 59 ⟶ 65:
|title=Introduction to Algorithms, 3rd ed.
|author=Thomas H. Cormen, Charles E. Leiserson, Ronald L Rivest, Clifford Stein
|year=2009
|supp=[http://mitpress.mit.edu/algorithms/ Link]
|description=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.
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.

Navigation menu