Ajakava / Programme

Reede, 27. jaanuar / Friday, 27 January

  saabumine / arrival
14.00-15.00lõunasöök / lunch
15.00-16.00 Dominique Unruh Termination-Insensitive Computational Indistinguishability
16.00-16.30paus / break
16.30-18.00 Elmo Todurov A finer module system and separate compilation for ABS
Keiko Nakata On streams that are finitely red
Andri Saar Compiling ABS to Scala
18.00-19.00õhtusöök / dinner
19.00- saun & diskussioon / sauna & discussion
 

Laupäev, 28. jaanuar / Saturday, 28 January

08.00-09.00 hommikusöök / breakfast
09.00-10.00 Rusins Freivalds Quantum finite automata on infinite words
10.00-10.30paus / break
10.30-11.30 Anna Aljanaki Trajectory Clustering on GPS Data
Liina Kamm How to make proving cryptographic protocols less tedious
11.30-14.00 aktiivne ajaviide / activities
14.00-15.00lõunasöök / lunch
15.00-16.30 Dan Bogdanov Building a universal secure computation platform based on protection domains
Riivo Talviste The AES block cipher implementation on the Sharemind secure multi-party computation framework
Peeter Laud The design of SecreC for Sharemind 3
16.30-17.00paus / break
17.00-18.30 Helger Lipmaa Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Rafik Chaabouni Set membership and range proofs
Sven Laur Secret sharing and arcs from projective geometry
18.30-19.30õhtusöök / dinner
19.30- saun & diskussioon / sauna & discussion
 

Pühapäev, 29. jaanuar / Sunday, 29 January

08.00-09.00 hommikusöök / breakfast
09.00-10.30 Alejandro Russo Information-flow security via libraries
Tarmo Uustalu Context-dependent notions of computation and comodels of theories
10.30-11.00paus / break
11.00-12.30 Danel Ahman When is a Container a Comonad?
James Chapman Relative Monads and Lambda Calculus
Denis Firsov Certified parsing
12.30-13.30lõunasöök / lunch
  ärasõit / departure

Liina Kamm
Peeter Laud
Helger Lipmaa
Tarmo Uustalu
Varmo Vene
Viimane uuendus 27.01.2012