Reede, 28. oktoober 2005 | ||
saabumine | ||
15.00-16.00 | lõunasöök | |
16.00-17.15 | Tanel Tammet | Joining databases: social networks and explicit semantics |
17.15-17.45 | paus | |
17.45-19.30 | Sven Laur | Private itemset support counting |
Emilia Käsper | On hardware-assisted cryptanalysis of A5/1 | |
Helger Lipmaa | On delegatability of four designated verifier signatures | |
19.30-20.30 | õhtusöök | |
20.30- | saun & diskussioon | |
Laupäev, 29. oktoober 2005 | ||
08.00-09.00 | hommikusöök | |
09.00-10.45 | Aristides Gionis | Models and algorithms for network immunization |
Jan Willemson | Monte-Carlo methods in complete-information no-randomness two-player games | |
10.45-11.15 | paus | |
11.15-13.00 | Olha Shkaravska | Arrays with garbage |
Tarmo Uustalu | A compositional natural semantics and Hoare logic for low-level languages | |
Ando Saabas | Compositional type systems for stack-based low-level languages | |
13.00-14.00 | lõunasöök | |
14.00-16.00 | aktiivne ajaviide | |
16.00-17.15 | Risto Vaarandi | Event correlation and data mining for event logs |
17.15-17.45 | paus | |
17.45-19.30 | Jelena Sanko | Deductive and inductive methods for program synthesis |
Vahur Kotkas | Algorithms of SSP | |
Theory days business meeting | ||
19.30-20.30 | õhtusöök | |
20.30- | saun & diskussioon | |
Pühapäev, 30. oktoober 2005 | ||
NB! Talveaeg! | ||
08.00-09.00 | hommikusöök | |
09.00-10.45 | Edith Elkind | How hard is it to manipulate voting? |
Ilja Tahhirov | Digital signature in automatic analyses for confidentiality against active adversaries | |
10.45-11.15 | paus | |
11.15-13.00 | Vesal Vojdani | Linting multithreaded C programs with the Goblin |
Jevgeni Kabanov | Dynamic programming using histomorphisms | |
Peeter Laud | Secrecy types for a simulatable cryptographic library | |
13.00-14.00 | lõunasöök | |
ärasõit |
Peeter Laud