| 10:40 | Introduction |
|---|
| 10:45 | Session 1: Semantics |
|---|
| 10:45 | Härmel Nestra | Double Applicative Functors |
| 11:10 | Hendrik Maarand | Certified Foata Normalization for Generalized Traces |
| 11:35 | Coffee break |
|---|
| 12:05 | Session 2: Misc |
|---|
| 12:05 | Silvio Capobianco | Nonuniversality in Computation: a (non)-disproof of the Church-Turing thesis |
| 12:30 | Abdullah Makkeh | Bivariate Partial Information Decomposition: The Optimization Perspective |
| 12:55 | Lunch (in Restaurant "Gunpowder Cellar") |
|---|
| 14:25 | Session 4: Cryptography |
|---|
| 14:25 | Bingsheng Zhang | Statement Voting and Liquid Democracy |
| 14:50 | Alisa Pankova | Privacy-preserving duplication detection |
| 15:15 | Toomas Krips | Golden Section Numbers in Secure Multiparty Computation |
| 15:40 | Peeter Laud | Secure Multiparty Sorting Protocols with Covert Privacy |
| 16:05 | Coffee break |
|---|
| 16:35 | Session 3: Coding Theory etc |
|---|
| 16:35 | Ivo Kubjas | Two-Party Function Computation on the Reconciled Data |
| 17:00 | Vitaly Skachek | Constructions and Bounds for Batch Codes with Small Parameters |
| 17:25 | Yauhen Yakimenka | Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance |
| 17:50 | Ludmila Glinskih | Satisfiable Tseitin formulas are hard for nondeterministic read-once branching programs |
| 18:15 | Adjourn |
|---|
| 19:00 | Dinner (in restaurant "Polpo") |
|---|
| 09:30 | Session 5: Automata |
|---|
| 09:30 | Hellis Tamm | Theoretical aspects of symbolic automata |
| 09:55 | Aliya Khadieva | Reordering Method for Quantum and Classical Ordered Binary Decision Diagrams |
| 10:20 | Markus Whiteland | On $k$-Abelian Equivalence Classes via Regularity |
| 10:45 | Juhani Karhumäki | Reachability via co-operating morphism |
| 11:10 | Coffee break |
|---|
| 11:40 | Session 6: Quantum Cryptography |
|---|
| 11:40 | Aleksandrs Belovs | Provably secure key establishment against quantum adversaries |
| 12:05 | Ehsan Ebrahimi | On Quantum Indifferentiability |
| 12:30 | Tore Vincent Carstens | On quantum indistinguishability under chosen plaintext attacks |
| 12:55 | Lunch (in Restaurant "Gunpowder Cellar") |
|---|
| 14:25 | Session 7: Cryptography |
|---|
| 14:25 | Marek Sýs | Factorization of widely used RSA moduli |
|---|
| 15:25 | Michal Zajac | A Subversion-resistant SNARK |
| 15:50 | Janno Siim | An Efficient Pairing-Based Shuffle Argument |
| 16:15 | Coffee break |
|---|
| 16:45 | Session 8: Quantum Computing |
|---|
| 16:45 | Andris Ambainis | Quantum algorithms for trees of unknown structure |
| 17:10 | Kamil Khadiev | Quantum versus Classical Online Algorithms with Advice and Restricted Memory |
| 17:35 | Jevgenijs Vihrovs | All Classical Adversary Methods are Equivalent for Total Functions |
| 18:00 | Adjourn |
|---|
| 19:00 | Dinner (in restaurant "Vilde ja Vine") |
|---|
| 20:30 | Sauna (in the Institute of Political Studies) |
|---|
| 09:30 | Session 9: Image Recognition and Crypto |
|---|
| 09:30 | Egils Avots | Audio based emotion recognition in an uncontrolled environment |
| 09:55 | Fatemeh Noroozi | Audio-Visual Emotion Recognition in Video Clips |
| 10:20 | Mohammad Fawaz Yousef Anagreh | Accelerate Performance of Calculation for Elliptic Curve Cryptosystem Based on MOF by Parallel Computing |
| 10:45 | City tour |
|---|
| 12:15 | Session 10: Quantum Complexity |
|---|
| 12:15 | Abuzer Yakaryilmaz | Magic coins are useful for small-space quantum machines |
| 12:40 | Maksims Dimitrijevs | Uncountable realtime probabilistic classes |
| 13:05 | Lunch (in Restaurant "Gunpowder Cellar") |
|---|
| 14:35 | Session 11: Distributed and Graph Algorithms |
|---|
| 14:35 | Jukka Suomela | Understanding Computation via Computation |
|---|
| 15:35 | Petteri Kaski | Delegatable and error-tolerant algorithms |
| 16:00 | Ivan Bliznets | Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters |
| 16:25 | Coffee break |
|---|
| 16:50 | Adjourn |
|---|