CS 591 A1: Algorithms for the New Age 
COURSE INFO
Professor:  ShangHua Teng 
Lecture Time:  Monday 3:00  6:00 PM at CAS 223

Office Hour:  Monday 1:00  2:30pm or by appointment (Room 276) 
Prerequisites:  CS 530 or consent of the instructor. 
The Class: 
I would like take the opporunity of
this seminar to discuss some basic and
advanced algorithms that are used in
modern practical applications. I would
also like to cover a new framework
for algorithm analysis,
the smoothed analysis of algorithms which is recently developed
by Dan Spielman (MIT) and myself to help explain the success of
many algorithm that both worstcase and averagecase cannot:
Sample topics include:

Requirements and Performance Evaluation: 
The class will not have any exams, but instead, the performance
will be evaluated based on the following:

LECTURE TOPICS (This section of the webpage will be growing and evolving)
Number  Topic  Notes  
1 (Sept 16)  Spectral Techniques I: Graph Partitioning  pdf , latex  
2 (Sept 23)  Spectral Techniques II: Spetral Embedding  pdf , latex  
3 (Sept 30)  Spectral Techniques III: LSI and Data Mining  pdf , latex  
4 (Oct 7)  Spectral Technique IV: Web link structures /Resource Management for DNS  pdf1 , latex  
5 (Oct 14)  Web Authorities  pdf, latex  
6 (Oct 21)  More on Kleinberg and Semidefinite Programming for Combinatorial Optimization  pdf , latex  
7 (Oct 28)  Mathematical Programming and OnLine Algorithms  pdf , latex  
8 (Nov 4)  Smoothed Analysis II  pdf , latex  
9 (Nov 11)  Smoothed Analysis I: Optimization  pdf , latex  
10 (Nov 18)  Presentation: Ben Hescott on Random Walk; Mohamed Alimi on Expanders , Anna Karpovsky on Network Topology  pdf1 pdf2 pdf1 , latex  
11 (Nov. 25)  Guest Lecture on Coding theory by Dan Spielman (MIT)  pdf , latex  
12 (Dec. 2nd)  Presentation: Marwan Fayed on Searching in unstructured topologies , Anukool Lakhina on Network topology discovery from traceroute Dhiman Barman on clustering data streams , Chase Seibert and Macdowell on Grid Computing and Cheng Dihan on Interior Point Methods  pdf , latex  
13 (Dec. 9th)  Presentation: Robert McNerney on Expander Codes , ChunYun Hsiao on list decoding , Raj Ashar on Evolutionary Algorithms, Ernest Kim on DNS, and Weichao and Manish on sketchbased summarization method to summarize streaming data  words latex  