Theory Days / Teooriapäevad / Teorijas dienas:

Programme / Ajakava / Laikplāns

Thursday, October 13, 2016 / Neljapäev, 13. oktoober 2016 / Ceturtdiena, 2016. gada 13. oktobris

 .........-19.30 arrival / saabumine / ierašanās
19.30-20.30 dinner / õhtusöök / vakariņas
 
 

Friday, October 14, 2016 / Reede, 14. oktoober 2016 / Piektdiena, 2016. gada 14. oktobris

08.00-09.00 breakfast / hommikusöök / brokastis
09.20-11.00
Opening
Alexander Belov Recent progress in monotonicity testing
Nikolajs Nahimovs Adjacent vertices can be hard to find by quantum walks
Krišjānis Prūsis Limitations of quantum walks and search
11.00-11.30 break / paus / starpbrīdis
11.30-13.00 Vitaly Skachek Minimum Pearson distance detection in the presence of unknown slowly varying offset
Ivo Kubjas Information-theoretic bounds for cooperative computation
Yauhen Yahimenka On failing sets of the interval-passing algorithm for compressed sensing
13.00-14.00 lunch / lõunasöök / pusdienas
14.30-16.15 Andris Ambainis What is the biggest possible quantum speedup?
Mārtiņš Kokainis Polynomials, quantum query complexity, and Grothendieck’s inequality
Ashutosh Rai d-level random access codes: a variant and its application
16.15-16.45 break / paus / starpbrīdis
16.45-18.15 Dominique Unruh Quantum secure commitments and hash functions
Ehsan Ebrahimi Post-quantum security of the Fujisaki-Okamoto and OAEP transforms
Helger Lipmaa A shuffle argument secure in the generic model
19.30-20.30 dinner / õhtusöök / vakariņas
20.30- sauna & discussion / saun & diskussioon / pirts & sarunas
 
 

Saturday, October 15, 2016 / Laupäev, 15. oktoober 2016 / Sestdiena, 2016. gada 15. oktobris

08.00-09.00 breakfast / hommikusöök / brokastis
09.30-11.15 Laura Mančinska Complexity classification of two-qubit commuting Hamiltonians (invited talk)
Kamil Khadiev On the hierarchies for deterministic, nondeterministic and probabilistic ordered  read-k-times branching programs
Maksims Dimitrijevs Uncountable classical and quantum complexity classes
11.15-11.45 break / paus / starpbrīdis
11.45-12.45 Hendrik Maarand Generating representative executions
Härmel Nestra Indentation and priorities
13.00-14.00 lunch / lõunasöök / pusdienas
14.00-16.30 excursion / ekskursioon / ekskursija
16.45-17.45 Eimear Byrne Optimal transmission rates in index coding (invited talk)
Eldho K. Thomas Group theoretic construction of quasi-uniform codes
17.45-18.15 break / paus / starpbrīdis
18.15-19.15 Jans Glagoļevs New method for object counting from images
Kirils Solovjovs SIPSA  one step closer to real anonymity on the Internet
19.30-20.30 dinner / õhtusöök / vakariņas
20.30- sauna & discussion / saun & diskussioon / pirts & sarunas
 
 

Sunday, October 16, 2016 / Pühapäev, 16. oktoober 2016 / Svētdiena, 2016. gada 16. oktobris

08.00-09.00 breakfast / hommikusöök / brokastis
09.30-11.00 Silvio Capobianco Post-surjectivity: an example of "almost dualization"
Hellis Tamm New interpretation and generalization of the Kameda-Weiner method
Abuzer Yakaryilmaz Affine automata
11.00-11.30 break / paus / starpbrīdis
11.30-13.00 Peeter Laud Composable quantitative measures of privacy
Niccolò Veltri Partiality as an effect, made rigorous
Tarmo Uustalu Interaction morphisms
13.00-14.00 lunch / lõunasöök / pusdienas
14.00-......... departure / ärasõit / izbraukšana

Last modified / Viimane uuendus / Pēdējais atjaunojums 15.10.2016