Succinct Graph Structures and Their Applications (Spring 2018)

 

Lecture Time & Place: Wednesday 11:00-12:30, Ziskind 155 
TA: Yinon Nahum
Prerequisite: Sufficient comfort with both algorithm design & analysis.

Course Schedule:

Useful Probabilities Inequalities: Handout by Avrim Blum and Anupam Gupta (15-859 Randomized Algorithms, CMU, Spring'11).