Graph Algorithms

http://theory.stanford.edu/~virgi/cs267/

Algorithms and Uncertainty Boot Camp

https://simons.berkeley.edu/workshops/schedule/3424

Algorithmic Graph Theory

http://www.cs.cmu.edu/~yangp/15859G/

Beyond Worst-Case Analysis

http://theory.stanford.edu/~tim/notes.html

Matroids and the greedy algorithm

http://www.win.tue.nl/~rudi/IPPC3_matroid.pdf

CSE 522: Sublinear (and Streaming) Algorithms

http://courses.cs.washington.edu/courses/cse522/14sp/lectures/index.html

6.893 Sub-linear Algorithms

http://stellar.mit.edu/S/course/6/sp13/6.893/materials.html

کاهش با حفظ ضریب تقریب

http://www.cs.umd.edu/~hajiagha/ALB14/scribe-10-07-2014.pdf

Algorithms and Complexity Seminar: 2013-2014

http://www.ilyaraz.org/acseminar/index1314.html

 Beyond XOR Games: Information causality, Szemerédi-Trotter and Algebraic Variants of CHSH

Approximate Constraint Satisfaction Requires Large LP Relaxations

Approximating matching size from random streams

Approximating Graph Problems: The Old and the New

“Improved Approximation Algorithms for Degree-bounded Network Design Problems with Node Connectivity Requirements”

داده کاوی داده‌های حجیم (دانشگاه استنفورد)

http://web.stanford.edu/class/cs246/handouts.html