Recommended References
  • Union + Find Analysis (using Ackermann)

http://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15750-s01/www/notes/lect0201

* Balanced search trees + Amortized analysis:

http://www.cs.iupui.edu/~xkzou/teaching/CS580/

* Presentations in Hebrew :

http://www.cs.huji.ac.il/~mary/dast

* Amortized Analysis:

http://www.csie.nctu.edu.tw/~sctsai/algo/notes/

* huffman coding:

http://www.dii.unisi.it/~marco/bdm/Materiale_didattico/materiale_didattico.html

* Recursions (see Lecture 1):

http://linux.cs.sonoma.edu/~ravi/ces512su04/Lectures/

* Red black trees:

http://www.cs.virginia.edu/~luebke/cs332.fall00/

http://www.cs.iupui.edu/~xkzou/teaching/CS580/Red-black_trees.ppt#3

* Radix sort (see Lecture 16):

http://www.cs.tau.ac.il/~scheme/mavo-fall-2003/

* Union and Find-sets:

http://www.cs.bu.edu/~steng/teaching/Fall2003/

* See also the 5th presentation of:

http://ranger.uta.edu/~gdas/Courses/Fall2004/advAlgos/student_slides/

* and:

http://crystal.uta.edu/~gdas/Courses/Courses/Fall2005/advAlgos/student_slides/Week6.ppt

* Compression:

http://discovery.bits-pilani.ac.in/discipline/physics/pkthiru/compression-II.ppt

http://www.cs.cmu.edu/afs/cs/academic/class/15853-f00/slides/compress1.ppt

* Suffix trees:

http://www.cs.helsinki.fi/u/ukkonen/Erice2005.ppt

http://mars.netanya.ac.il/~eidmoha/seminar.ppt

http://cs.haifa.ac.il/LANDAU/courses/String/String_files/UK.ppt

http://dit.unitn.it/~pavel/Publications/Suffix%20Trees.ppt

http://www.cs.ualberta.ca/~poulin/research/presentations/SuffixTrees.ppt

http://www.csie.ntu.edu.tw/~kmchao/seq04spr/Suffix%20Tree%20and%20Suffix%20Array_fin5.ppt

Unless otherwise stated, the content of this page is licensed under Creative Commons Attribution-ShareAlike 3.0 License