Teooriapäevad Sakal / Theory Days at Saka: Ajakava / Programme

Reede, 25. oktoober 2013 / Friday, 25 October 2013
	saabumine / arrival
14.30-15.30	lõunasöök / lunch
15.30-16.40	Vitaly Skachek	Optimal index codes with near-extreme rates
	Sergey Bezzateev	A new private information retrieving protocol with low computation complexity
16.40-17.10	paus / break
17.10-18.55	Silvio Capobianco	Normality and preservation of measure in cellular automata
	Hellis Tamm	Recent developments in the theory of átomata
	Denis Firsov	Formalizing attribute grammars and circularity checking
19.00-20.00	õhtusöök / dinner
20.00-	saun & diskussioon / sauna & discussion
Laupäev, 26. oktoober 2013 / Saturday, 26 October 2013
08.00-09.00	hommikusöök / breakfast
09.00-10.10	Marjan Mernik	The application of grammar inference to software language engineering
10.10-10.40	paus / break
10.40-12.25	Marlon Dumas	Discovering business rules from event logs
	Dominique Unruh	Non-interactive zero-knowledge with quantum random oracles
	Alisa Pankova	On the (im)possibility of privately outsourcing linear programming
12.30-13.30	lõunasöök / lunch
13.30-16.00	aktiivne ajaviide / activities
16.00-17.10	Petteri Kaski	Selected surprises in subgraph counting
17.10-17.40	paus / break
17.40-18.50	Helger Lipmaa	Secure equality and greater-than tests with sublinear online complexity
	Risto Laanoja	Security proofs for hash tree time-stamping using hash functions with small output size
19.00-20.00	õhtusöök / dinner
20.00-	saun & diskussioon / sauna & discussion
Pühapäev, 27. oktoober 2013 / Sunday, 27 October 2013
NB! Talveaeg!
08.00-09.00	hommikusöök / breakfast
09.00-10.10	Jukka Suomela	New lower bounds for distributed algorithms
10.10-10.40	paus / break
10.40-12.25	Wolfgang Jeltsch	A categorical foundation of functional reactive programming with mutable state
	Niccolò Veltri	The delay monad and restriction categories
	Tarmo Uustalu	Update monads: cointerpreting directed containers
12.30-13.30	lõunasöök / lunch
14.00	ärasõit / departure