![]() |
Mon. 02 | Tue. 03 | Wed. 04 | Thu. 05 | Fri. 06 |
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
18:00
19:00
20:00
21:00
22:00
|
9:00 - 9:30 (30min)
Welcome
Welcoming participants, coffee
9:30 - 10:20 (50min)
Fair Division Beyond Monotone Valuations
Siddharth Barman
10:30 - 11:00 (30min)
Coffee break
11:00 - 11:25 (25min)
Analyzing black-box optimization algorithms - why and how?
Carola Doerr
11:30 - 11:55 (25min)
A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
Georg Zetzsche
12:00 - 13:30 (1h30)
Lunch
13:30 - 14:20 (50min)
The Success Story of Polyregular Functions: Why We Need Pebbles
Sandra Kiefer
14:30 - 15:00 (30min)
Coffee break
15:00 - 15:25 (25min)
Local Correction algorithms for low-degree polynomials
Amik Raj Behera
15:30 - 15:55 (25min)
Synthesizing Asynchronous Automata from Fair Specifications
B. Srivathsan
16:00 - 17:00 (1h)
Coffee break
|
9:30 - 10:20 (50min)
The other side of derandomization
Sylvain Perifel
10:30 - 11:00 (30min)
Coffee break
11:00 - 11:25 (25min)
Generalizing Roberts' characterization of unit interval graphs
Stéphane Vialette
11:30 - 11:55 (25min)
Edit Distance of Finite State Transducers
C. Aiswarya
12:00 - 13:30 (1h30)
Lunch
13:30 - 14:20 (50min)
Proof complexity meets finite model theory
Joanna Fijalkow
14:30 - 15:00 (30min)
Coffee break
15:00 - 15:25 (25min)
Structural results for Arithmetic formulas
Sébastien Tavenas
15:30 - 15:55 (25min)
The Formula Synthesis Problem - Focus on Propositional Dynamic Logic
Sophie Pinchinat
16:00 - 17:00 (1h)
Coffee break
19:00 - 22:00 (3h)
Conference Dinner
|
9:30 - 10:20 (50min)
Estimating the Electoral Consequences of Legislative Redistricting in France
Claire Mathieu
10:30 - 11:00 (30min)
Coffee break
11:00 - 11:25 (25min)
Trading Determinism for NonCommutativity in Singularity Testing
Partha Mukhopadhyay
11:30 - 11:55 (25min)
Resolving Nondeterminism with Randomness
K.S. Thejaswini
12:00 - 13:30 (1h30)
Lunch
|
9:30 - 10:20 (50min)
Permissive Equilibria in Multiplayer Reachability Games
Benjamin Monmege
10:30 - 11:00 (30min)
Coffee break
11:00 - 11:25 (25min)
The Multiplicative Weights Update Technique
Nabil Mustafa
11:30 - 11:55 (25min)
On the Probabilistic and Statistical Verification of Infinite Markov Chains
Patricia Bouyer-Decitre
12:00 - 13:30 (1h30)
Lunch
13:30 - 14:20 (50min)
On Dependent Outputs in Reactive Synthesis
Supratik Chakraborty
14:30 - 15:00 (30min)
Coffee break
15:00 - 15:25 (25min)
Stabilizer Limits and Orbit Closures in Geometric Complexity Theory
K.V. Subrahmanyam
15:30 - 15:55 (25min)
Decidable fragments of First Order Modal Logic
Anantha Padmanabha
16:00 - 17:00 (1h)
Coffee break
|
9:30 - 10:20 (50min)
FPT Approximation Algorithms for Coverage and Satisfiability Problems
Saket Saurabh
10:30 - 11:00 (30min)
Coffee break
11:00 - 11:25 (25min)
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
Marie Fortin
11:30 - 11:55 (25min)
Proof complexity of quantified Boolean formulas
Olaf Beyersdorff
12:00 - 13:30 (1h30)
Lunch
13:30 - 13:55 (25min)
Faster two-dimensional pattern matching with k mismatches
Jonas Ellert
14:00 - 14:50 (50min)
Linear integer arithmetic and Gaussian elimination
Dmitry Chistikov
15:00 - 16:00 (1h)
Coffee break
|