| Place: | Bielefeld University, U10-146 |
| Date: | July 27, 2009 |
| Time | Speaker | Topic |
| 10:00 - 10:30 | Giovanni Manzini | Succinct Representations of Trees |
| 10:40 - 11:10 | Ferdinando Cicalese | Searching with little structure |
| 11:20 - 11:50 | Bernhard Balkenhol | The BWT with a generalized source model and the influence of the LZ-Switching Method |
| 12:00 - 13:00 | Lunch in the Westend Cafeteria | |
| 13:15 - 15:00 | Travis Gagie | Disputation: New Algorithms and Lower Bounds for Sequential-Access Data Compression |
| 15:00 | Sergei Adian | Upper bound on the derivational complexity in some word rewriting system |