Date:
2nd semester , Wednesday 19:30
| Lecture 1: Two very efficient approximation algorithms for the longest increasing subsequence | 18/03/2013 | Prof. Michael Saks, Rutgers University |
| Lecture 2: Tight lower bounds for file maintenance | 20/03/2013 | Prof. Michael Saks, Rutgers University |
| Lecture 3: Population recovery under high erasure probability | 21/03/2013 | Prof. Michael Saks, Rutgers University |