Program
The Theory Days will take place on April 24-26. On Friday, April 24th, the event will take place in room 1018 of the Delta Center, and on Saturday, April 25th, and Sunday, April 26th, the event will take place in room 1037 of Delta Center.
| Friday, April 24th |
|---|
| Time | Name | Title |
|---|
| 15:00-15:30 | - | Registration and Coffee Break |
| 15:30-15:50 | Dominique Unruh | Poor man’s dependent types for Isabelle/HOL |
| 15:50-16:10 | Toomas Krips | Lattice-Based Shuffle Arguments with Short Proofs |
| 16:10-16:30 | Kübra Seyhan | A Fully Quantum Secure Communication: PQC+QKD Hybridization For Authenticated Key Sharing |
| 16:30-16:50 | Maiara Bollauf | Coset Shaping for Coded Modulation |
| 16:50-17:10 | Abuzer Yakaryilmaz | Teaching Quantum Globally: Experiences and Perspectives |
| 17:10-17:40 | - | Coffee Break |
| 17:40-18:00 | Matthew Earnshaw | Monoidal categories graded by partial commutative monoids |
| 18:00-18:20 | Mariana Milicich | A Quantitative Interpretation for Useful Call-by-Value |
| 18:20-18:40 | Ulrik Sørgaard Djupvik | Introduction to Sweedler Theory |
| 18:40-19:40 | - | Dinner |
| 19:40-23:00 | - | Sauna |
| Saturday, April 25th |
|---|
| Time | Name | Title |
|---|
| 09:30-11:00 | - | Excursion to the University Art Museum, Ülikooli str. 18 |
| 11:00-11:30 | - | Coffee Break |
| 11:30-11:50 | Liisi Nõojärv | Formal Verification of Proof Search and Countermodel Construction for Intuitionistic Propositional Logic |
| 11:50-12:10 | Michel Smykalla | Equality of Proofs in Substructural Intuitionistic Modal Logics |
| 12:10-12:30 | Pavla Procházková | Representability theory for multiactions |
| 12:30-12:50 | Jevgenijs Protopopovs | RaceHarness: Environment Modelling for Sound Static Race Detection |
| 12:50-14:00 | - | Lunch |
| 14:00-15:00 | Robert Tarjan | Fast and Simple Sorting Using Partial Information |
| 15:00-15:20 | - | Break |
| 15:20-15:40 | Dirk Draheim | Conditional Events, Conditional Random Variables and the Strong Law of Large Numbers |
| 15:40-16:00 | Tanel Tammet | From Natural Language to Explainable Question Answering via a Neurosymbolic First-Order Logic Pipeline |
| 16:00-16:20 | Alexander Rivosh | The Dice are Loaded: Large Language Models and Random Numbers |
| 16:20-16:40 | Silvio Capobianco | Two approaches to convergence of trajectories |
| 16:40-17:10 | - | Coffee Break |
| 17:10-17:30 | Matteo Campanelli | Subvector Commitments with Optimal Opening Complexity |
| 17:30-17:50 | Christoph Egger | Domino: Verifying Cryptographic Protocols |
| 17:50-18:10 | Chris Brzuska | On Bounded Storage Key Agreement and One-Way Functions |
| 18:10-18:30 | Aleksi Kalsta | Simple Attacks against (Extended) Fiat-Shamir |
| 18:30-18:50 | Wulf Harder | Shaping Loss Landscapes for SAT: From Hamiltonian Cycle Encodings to Integer Factorisation |
| 18:50-19:50 | - | Dinner |
| 19:50-23:00 | - | Sauna |
| Sunday, April 26th |
|---|
| Time | Name | Title |
|---|
| 09:20-09:40 | Aleksandrs Belovs | Tight Quantum Lower Bound for k-Distinctness |
| 09:40-10:00 | Jevgēnijs Vihrovs | Quantum Time-Space Tradeoffs for Exponential Dynamic Programming |
| 10:00-10:20 | Massimo Equi | Limits of Distributed Quantum Advantage |
| 10:20-10:40 | Krišjānis Petručeņa | Random-Walk Key Relaying for Decentralized QKD Networks |
| 10:40-11:00 | Juris Smotrovs | Low degree representing polynomials of high sensitivity Boolean functions |
| 11:00-11:30 | - | Coffee Break |
| 11:30-11:50 | Maksims Dimitrijevs | Lights Out Problem to Benchmark Real Quantum Hardware |
| 11:50-12:10 | Kristiina Oksner | On the Minimum Length of Functional Batch Codes with Small Recovery Sets |
| 12:10-12:30 | Igors Stepanovs | You Read It Out of Context: Causality in Secure Messaging |
| 12:30-12:50 | Alisa Pankova | Coppercloud: Blind Server-Supported RSA Signatures |
| 12:50-13:50 | - | Lunch |
| 13:50-14:10 | Niels Voorneveld | Towards an equational theory of information leakage and corruption |
| 14:10-14:30 | Álvaro Montes | Improving the Efficiency of Function-Hiding Functional Commitments |
| 14:30-14:50 | Urmas Luhaäär | Cyclo: Lightweight Lattice-based Folding via Partial Range Checks |
| 14:50-15:10 | Russell W. F. Lai | Hardness of hinted ISIS from space-time hardness of lattice problems |
| 15:10-15:40 | - | Coffee Break |
| 15:40-16:00 | Roberto Parisella | On Knowledge-Soundness of Plonk in ROM from Falsifiable Assumptions |
| 16:00-16:20 | Janno Siim | Linearization Trick in SNARKs |
| 16:20-16:40 | Erki Külaots | Special Soundness and Binding Properties: A Framework for Tightly Secure zk-SNARKs |
| 16:40-17:00 | Helger Lipmaa | Plonk is Simulation Extractable in ROM Under Falsifiable Assumptions |
| 17:00-18:00 | - | Dinner |
| 18:30 | - | Bus to Riga |