Now showing items 1-2 of 2

    • 6.046J Introduction to Algorithms (SMA 5503), Fall 2004 

      Leiserson, Charles Eric; Indyk, Piotr (2004-12)
      Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph ...
    • 6.895 / 6.095J Computational Biology: Genomes, Networks, Evolution, Fall 2005 

      Kellis, Manolis; Indyk, Piotr (2005-12)
      This course is offered to both undergraduates and graduates. The undergraduate version of the course includes a midterm and final project. The graduate version of the course includes additional assignments and a more ...