Scalable Algorithms (ITI)

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
teaching:2026ss:param_algo:start [2026/06/15 09:39] blaesiusteaching:2026ss:param_algo:start [2026/06/18 15:38] (current) – [Exercise Sheets] eschmidt
Line 1: Line 1:
-\\ 
-\\ 
-\\ 
-**NOTE:** There is no lecture on the 15th of June. 
-\\ 
-\\ 
-\\ 
- 
 ====== Parameterized Algorithms ====== ====== Parameterized Algorithms ======
  
Line 77: Line 69:
   * {{ :teaching:2026ss:param_algo:sheet03.pdf | Sheet 3}}, files for implementation task: {{ :teaching:2026ss:param_algo:closest_string.zip | closest_string.zip}}, {{ :teaching:2026ss:param_algo:solution03.pdf | Solution 3}}   * {{ :teaching:2026ss:param_algo:sheet03.pdf | Sheet 3}}, files for implementation task: {{ :teaching:2026ss:param_algo:closest_string.zip | closest_string.zip}}, {{ :teaching:2026ss:param_algo:solution03.pdf | Solution 3}}
   * {{ :teaching:2026ss:param_algo:sheet04.pdf | Sheet 4}}   * {{ :teaching:2026ss:param_algo:sheet04.pdf | Sheet 4}}
 +  *   {{ :teaching:2026ss:param_algo:sheet05.pdf | Sheet 5}}, files for implementation task: {{ :teaching:2026ss:param_algo:closest_string_ilp.zip |}}
 ===== Active Sessions ===== ===== Active Sessions =====
   - Bounded Search Trees: {{ :teaching:2026ss:param_algo:01-active-search-tree.pdf |slides}} {{ :teaching:2026ss:param_algo:01-active-search-tree-notes.pdf |solution notes}}   - Bounded Search Trees: {{ :teaching:2026ss:param_algo:01-active-search-tree.pdf |slides}} {{ :teaching:2026ss:param_algo:01-active-search-tree-notes.pdf |solution notes}}
 +  - Color Coding: {{ :teaching:2026ss:param_algo:05-color-coding.pdf |slides}}