Program & abstracts – booklet. (updated May 5, 16:00)
Friday, May 6
| 14:00 |
Igors Stepanovs, Four Attacks and a Proof for Telegram |
| 17:10 | Martins Kokainis, Random walk-based benchmarking of single-electron circuits |
| 15:10 | Jelizaveta Vakarjuk, Nikita Snetkov, Analysis of Russian Federal Remote E-voting Scheme of 2021 |
| 15:40 | Coffee Break |
| 16:10 | Jevgēnijs Vihrovs, Quantum algorithms for treewidth |
| 16:40 | Andris Locāns, Quantum speedup for track reconstruction in particle accelerators |
| 17:10 | Aleksandrs Belovs, Tight Quantum Lower Bounds for Approximate Counting with Quantum States |
Saturday, May 7
| 9:00 | Tarmo Uustalu, List monads |
| 9:30 | Silvio Capobianco, Additive cellular automata monadically |
| 10:00 | Niels Voorneveld, Stateful relators for algebraic effects |
| 10:30 | Artjoms Šinkarovs, Rank-Polymorphic Arrays in Dependently-Typed Languages |
| 11:00 | Coffee break |
| 11:30 | Māris Ozols, Quantum Majority Vote |
| 12:10 | Maksims Dimitrijevs, Implementation of a quantum walk on a tree and DAG size estimation algorithms for real quantum computers |
| 12:30 | Sergejs Kozlovičs, Towards the Post-Quantum Era: Quantum Entropy via a Quantum-Resistant Network |
| 13:00 | Lunch break |
| 14:30 | Vitaly Skachek, Some results related to synchronization of data in distributed storage systems |
| 15:00 | Ago-Erik Riet, Coding for storage and networks with subspaces, Tartu University |
| 15:30 | Coffee break |
| 16:00 | Junming Ke, Constructing Update-Efficient Storage Codes via Finite Projective Planes |
| 16:30 | Gatis Melkus, Functional significance of topology in chromatin interaction networks |
| 17:00-19:00 | Excursion (starting and ending at the entrance to the University building) |
| 19:30 | Banquet at the restaurant Andalūzijas suns (directions, map) |
Sunday, May 8
| 9:30 | Sander Mikelsaar, NB LDPC and GLDPC Codes for Future Communication Standards |
| 10:00 | Martin Puškin, Unequal-Data-Demand PIR codes: bounds and constructions |
| 10:30 | Urmas Luhaäär, Optimal possibly nonlinear 3-PIR codes of small size |
| 11:00 | Hendrik Dirk Lodewijk Hollman, Permutation automorphisms of cyclic codes |
| 11:30 | Coffee break |
| 12:00 | Hsuan-Yin Lin, Coding for information-theoretic private information retrieval |
| 12:30 | Peeter Laud, Efficient oblivious permutations for privacy-preserving computations |
| 13:00 | Härmel Nestra, ZK-SecreC: a Domain-Specific Language for Zero-Knowledge Proofs |
| 13:30 | Lunch break |
| 15:00 | Cheng-Syuan Wan, Proof theory of skew non-commutative MILL |
| 15:30 | Niccolò Veltri, Finitary Functors and Final Semantics in Type Theory |
| 16:00 | Coffee break |
