15-853: Algorithms in the "Real World"
Carnegie Mellon University, Computer Science Department
Fall 2005

Fluid Flow Image

Instructors: Guy Blelloch and Bruce Maggs
Time: Monday and Wednesday 10:30 - 11:50
Place: 5409 Wean Hall
Credit: 12 Units
Prerequisites: An advanced undergrad course in algorithms (15-451 or equivalent will suffice).
Office Hours: Monday 1:30-2:30pm (Guy)
  • Course overview and topic list.
  • Readings, Notes and Slides
  • Course Requirements and Grading Criteria.
  • Approximate schedule.
  • Assignments.
  • Information on algorithms available on the web
  • Companies that sell products that use various algorithms

    • Course Overview:

    This course covers how algorithms and theory are used in "real-world" applications. The course will cover both the theory behind the algorithms and case studies of how the theory is applied. It is organized by topics and the topics change from year to year.

    This year we will cover the following topics. The exact subtopics might change

  • Compression
    Information Theory
    Huffman/Arithmetic/Gamma Codes
    Context Coding/PPM
    Lempel Ziv/Gzip/Burrows Wheeler
    Graph Compression

  • String Searching/Matching
    Suffix Arrays and Suffix Trees

  • Error Correcting Codes
    Hamming Codes, Linear Codes
    Reed Solomon Codes, Cyclic Codes (uses in CDs, DVDs, DSL, ...)
    Expander graphs and Tornado codes

  • Cryptography
    One-way functions, basic protocols
    Number theory review: groups, fields, Galois fields
    Private key cryptosystems (Block Ciphers, Rijdael)
    Public key cryptosystems (SSL, RSA, ElGamal, Diffie-Hellman key exchange)
    Kerberos and Digital Cash

  • Computational Biology
    Approximate String Matching
    Various gap and cost models
    BLAST/FAST
    Sequencing the Human Genome

  • Linear and Integer programming
    Flow problems as Linear programs
    Simplex, Elipsoid and Interior point methods
    Reductions to integer programs
    Basic techniques for solving integer programs
    Airline crew scheduling

  • Graphs in the Real World
    Shortest Paths (Mapquest)
    Graph Separators
    Flow and Matching

    •

    Requirements and Grading Criteria

  • Readings (handed out per topic)
  • Homework Assignments (1 or 2 per topic) (50%)
  • Take-home Midterm (10%)
  • Take-home final exam (20%)
  • Grading Assignments (1 over the semester) (10%)
  • Class participation (10%)

    • Assignments

  • Assign 1: Compression, Due October 4
  • Assign 2: ECC, Due Nov 2
  • Assign 3: Cryptography, Due Nov 16
  • Assign 4: Computational Biology, Due Dec 5
    •

    Relevant Books

    See the lists within each of the topic pages

    Guy Blelloch, guyb@cs.cmu.edu.