Fakultät für Informatik - Technische Universität MünchenLehrstuhl für Effiziente Algorithmen |
Exercise Sheet 1[PS] [PDF] | Solution 1[PS] [PDF] | |
Exercise Sheet 2[PS] [PDF] | Solution 2[PS] [PDF] | |
Exercise Sheet 3[PS] [PDF] | Solution 3[PS] [PDF] | |
Exercise Sheet 4[PS] [PDF] | Solution 4[PS] [PDF] | |
Exercise Sheet 5[PS] [PDF] | Solution 5[PS] [PDF] | |
Exercise Sheet 6[PS] [PDF] | Solution 6[PS] [PDF] | |
Exercise Sheet 7[PS] [PDF] | Solution 7[PS] [PDF] | |
Exercise Sheet 8[PS] [PDF] | Solution 8[PS] [PDF] | |
Exercise Sheet 9[PS] [PDF] | Solution 9[PS] [PDF] | |
Exercise Sheet 10[PS] [PDF] | Solution 10[PS] [PDF] |
Input Files for the Suffix Tree Project: text1 text1.sol text2 text2.sol text3 text3.sol text4 text4.sol text5 text5.sol text6 text6sol |
Letzte Änderung: Johannes Nowak am 11.04.2005 |