Books Wishlist: Difference between revisions

From CSCWiki
Jump to navigation Jump to search
(Page creation with format and such. Placing TAOCP under the Actual Books section fasicle wise. The library wishlist is a little out of touch with the actual library, and that needs to be tweaked.)
 
No edit summary
Line 21: Line 21:
** Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation
** Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation
*** ISBN-13: 978-0321335708
*** ISBN-13: 978-0321335708
* Wirth, Algorithms + Data Structures = Programs
** ISBN-13: 978-0130224187
* Dijkstra, A Discipline of Programming
** ISBN-13: 978-0132158718


= Vague Ideas =
= Vague Ideas =

Revision as of 22:36, 2 February 2009

This page consists of books we'd like to get to stock the library. It is divided into 3 sections. The first is books going on this term's MEF proposal, this should be done by whoever is writing the proposal. The second is a list of actual books with ISBN. The third is vague ideas of what kind of books we need. The goal is for this page to be emptied by way of moving things from section three up to section one and then off.

MEF Proposal

MEF Proposal books should include a quote and a sentence or two of justification.

Actual Books

Actual books should have a precise title and ISBN for edition desired.

Foundations/Field Surveys

  • Knuth, The Art of Computer Programming
    • Volume 1, Fascicle 1: MMIX -- A RISC Computer for the New Millennium
      • ISBN-13: 978-0201853926
    • Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions
      • ISBN-13: 978-0321534965
    • Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams
      • ISBN-13: 978-0321580504
    • Volume 4, Fascicle 2: Generating All Tuples and Permutations
      • ISBN-13: 978-0201853933
    • Volume 4, Fascicle 3: Generating All Combinations and Partitions
      • ISBN-13: 978-0201853940
    • Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation
      • ISBN-13: 978-0321335708
  • Wirth, Algorithms + Data Structures = Programs
    • ISBN-13: 978-0130224187
  • Dijkstra, A Discipline of Programming
    • ISBN-13: 978-0132158718

Vague Ideas

These can be anything from a title missing an edition choice to a topic name to a binding style/colour.

Theory

  • Approximation Algorithms
  • Randomized Algorithms
  • Computer and Intractability (Grey & Johnson)
  • Human Computer Interaction (HCI)
  • Project Management
    • Software Requirements
    • Software Design & Architecture
    • Software Testing
  • Concurrency/Multithreading
  • Security (Firewalls)
  • Introduction to the Theory of Computation
  • Numerical Analysis
  • Numerical Methods? (Stoer & Bulirsch)
    • This is probably not the actual title. We want a book on numerical methods by Stoer & Bulirsch
  • Computer Systems: A Programmer's Perspective (Bryant & O'Hallaron)

Programming Languages

  • Python
  • Haskell
  • Ruby
  • C#
  • Visual Basic .NET
  • OCaml
  • Scheme
  • F#
  • Basic
  • Groovy
  • Javascript
  • C/C++
  • Assembly
  • Databases [SQL]

Technology Books

  • Ubuntu
  • Unix/Linux Beginner Books
  • OpenGL/DirectX
  • GTK
  • Unix Network Programming

Miscellaneous