Reede, 3. veebruar | ||
| saabumine & suusatamine | ||
| 14.30-15.30 | lõunasöök | |
| 15.30-17.00 | Juhan Ernits | Speeding up reachability checks: bit state hashing and bit state abstraction |
| Hellis Tamm | Size reduction of multitape automata | |
| Härmel Nestra | Rational Semantics | |
| 17.00-17.30 | paus | |
| 17.30-19.00 | Jelena Zaitseva | An Extension of PWMs for the Study of Insertions/Deletions in the TFBS |
| Leo Võhandu | How to build polynomial time heuristics for NP-hard problems | |
| 19.30-20.30 | õhtusöök | |
| 20.30- | saun & diskussioon | |
Laupäev, 4. veebruar | ||
| 08.30-09.30 | hommikusöök | |
| 09.30-11.00 | Marino Miculan | Behind the name: the many faces of atomic terms |
| Olha Shkaravska | Arrays and Memory Allocation | |
| 11.00-14.30 | suusatamine | |
| 14.30-15.30 | lõunasöök | |
| 15.30-16.30 | Eero Vainikko | Aggregation-based Domain Decomposition methods |
| Konstantin Tretjakov | Duaalsed meetodid hõredate lineaarsete mudelite leidmiseks | |
| 16.30-17.00 | paus | |
| 17.00-19.00 | Meelis Kull | Interactive Search for Needles in the Haystack... (inspired by Planted Motif Problem and Bioinformatics) |
| 19.30-20.30 | õhtusöök | |
| 20.30- | saun & diskussioon | |
Pühapäev, 5. veebruar | ||
| 08.30-09.30 | hommikusöök | |
| 09.30-10.30 | Peeter Laud | Introduction to secure information flow |
| 10.30-11.00 | paus | |
| 11.00-12.30 | Tarmo Uustalu | Structured computation on trees |
| Ahto Buldas | Do Broken Hash Functions Affect the Security of Time-Stamping Schemes? | |
| Varmo Vene | Modelling Cyclic Structures by Nested Datatypes | |
| 13.00-14.00 | lõunasöök | |
| suusatamine / ärasõit | ||
Peeter Laud