Program

Thursday, October 16

–19:30	Arrival
19:30–20:30	Dinner

Friday, October 17

8:00–9:00	Breakfast
9:30–10:00	Massimo Equi Distributed Quantum Advantage
10:00–10:30	Aleksandrs Belovs Does your quantum subroutine err? Don’t be upset, we have a solution
10:30–11:00	Krišjānis Petručeņa Integrating True Random Number Generators into GNU/Linux via D-Bus
11:00–11:30	Break
11:30–12:00	Silvio Capobianco Giving grades to cellular automata
12:00–12:30	Callum Reader String Diagrams for Closed Symmetric Monoidal Categories
12:30–13:00	Alessandro Di Giorgio Tape Diagrams for Monoidal Monads
13:00–14:00	Lunch
14:30–15:00	Antonio Cruciani Highly Dynamic and Fully Distributed Data Structures
15:00–15:30	Peeter Laud Fail-Stop Server-Supported Signatures
15:30–16:10	Rebeka Birziņa, Kārlis Freivalds Deep Learning Methods for Combinatorial Optimization
16:10–16:30	Laura Leja Learning Robot Trajectory Control Using Differentiable Physics
16:30–17:00	Break
17:00–17:30	Danel Ahman Type inference for temporal resources
17:30–18:00	Cheng-Syuan Wan An Agda formalization of the nonassociative Lambek calculus
18:00–18:30	Vincent Moreau Higher-order regular languages and profinite $\lambda$-terms
19:30–20:30	Dinner
20:30–	Sauna & Discussion

Saturday, October 18

8:00–9:00	Breakfast
9:00–9:30	Francisco José Maldonado Torralba Modelling Nature and Mind via eigenfunctions: a bridge between Physics, Computer Science, and Neuroscience
9:30–10:00	Chad Mitchell Nester A categorical calculus of Interacting Processes
10:00–10:30	Matt Earnshaw Resourceful traces for commuting processes
10:30–11:00	Break
11:00–11:30	Jevgēnijs Vihrovs Quantum Algorithms for Hopcroft’s Problem
11:30–12:00	Maksim Dimitrijev Bridging Academia and Industry: Collaboration on Practical Applications of Quantum Computing
12:00–12:30	Abuzer Yakaryilmaz My Photonic Ship: Creative Pathways to Quantum Education
12:30–13:00	Alexey Leontyev Quantum-enhanced reliability modeling and optimization of economic systems using the Weibull distribution family
13:00–14:00	Lunch
14:00–17:00	Excursion
17:15–18:15	Russell Lai Fully-Succinct Lattice-based Arguments: A 5-Year Journey
18:15–18:30	Break
18:30–19:00	Janno Siim Constant-Size zk-SNARKs in ROM from Falsifiable Assumptions
19:00–19:30	Maiara F. Bollauf Gaussian Sampling for $q$-ary Lattices
19:30–20:30	Dinner
20:30–	Sauna & Discussion

Sunday, October 19

8:00–9:00	Breakfast
9:30–10:00	Niccolò Veltri Aczel-Mendler terminal coalgebra theorem in homotopy type theory
10:00–10:30	Ilja Sobolev Normalisation properties of programming languages with asynchronous algebraic effects
10:30–11:00	Michel Viana Smykalla Introduction to Forcing
11:00–11:30	Break
11:30–12:00	Vitaly Skachek Some Results on Batch Codes and Codes for Private Information Retrieval
12:00–12:30	Ago-Erik Riet New Construction of Unbalanced ${C_4,\theta_{3,t}}$-Free Bipartite Graphs
12:30–13:00	Baran Düzgün Some Explicit Constructions of Large $L$-nice Families
13:00–14:00	Lunch
14:20	Departure (of the chartered buses)