Advanced Algorithms


Instructor:
Yijia Chen

Time:
1:30pm - 4:30pm every Monday

References:

[DPV07] Algorithms
by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, 2007.

[Bod90] Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
by Hans L Bodlaender, 1990.

[AS08] The Probabilistic Method
by Noga Alon and Joel H. Spencer, 2008.

[MT14] A constructive proof of the general Lovász Local Lemma
by Robin A. Moser and Gábor Tardos, 2010.

[Ros99] On the constant-depth complexity of k-clique
by Benjamin Rossman, 2008.

[Rub14] Randomness and Computation
by Ronitt Rubinfeld, 2014.

[Sch99] A probabilistic algorithm for k-SAT and constraint satisfaction problems
by Uwe Schöning, 1999.



Slides:

(1) 24/02/2014
(2) 03/03/2014
(3) 10/03/2014
(4) 17/03/2014
(5) 24/03/2014
(6) 14/04/2014
(7) 21/04/2014
(8) 28/04/2014
(9) 05/05/2014
(10) 12/05/2014
(11) 19/05/2014
(12) 26/05/2014
(13) 16/06/2014


Homework:


To view the ps and pdf files, you need GSview and Acrobat Reader.

Back


Yijia Chen, last modified: 17. 06. 2014