CAALM 2025 (Complexity, Algorithms, Automata and Logic Meet)
Theoretical Computer Science workshop
2-6 Jun 2025 Villetaneuse (France)
Login
Lost password ?
Create account
Main menu
Home
Speakers, titles, abstracts, slides
Program
Registration (free but mandatory)
List of Participants
Moving about Paris, and how to get to LIPN
Where to stay
Sponsors
HELP
@ Contact
Program
Week
Mon. 02
Tue. 03
Wed. 04
Thu. 05
Fri. 06
List
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
Welcome
9:00 - 9:30 (30min)
Welcome
Welcoming participants, coffee
Fair Division Beyond Monotone Valuations
9:30 - 10:20 (50min)
Fair Division Beyond Monotone Valuations
Siddharth Barman
https://caalm-2025.sciencesconf.org/data/program/Abstract_Siddharth_2.pdf
Coffee break
10:30 - 11:00 (30min)
Coffee break
Analyzing black-box optimization algorithms - why and how?
11:00 - 11:25 (25min)
Analyzing black-box optimization algorithms - why and how?
Carola Doerr
https://caalm-2025.sciencesconf.org/data/program/Abstract_Carola.pdf
A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
11:30 - 11:55 (25min)
A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
Georg Zetzsche
https://caalm-2025.sciencesconf.org/data/program/Abstract_Georg.pdf
Lunch
12:00 - 13:30 (1h30)
Lunch
The Success Story of Polyregular Functions: Why We Need Pebbles
13:30 - 14:20 (50min)
The Success Story of Polyregular Functions: Why We Need Pebbles
Sandra Kiefer
https://caalm-2025.sciencesconf.org/data/program/Abstract_Sandra.pdf
Coffee break
14:30 - 15:00 (30min)
Coffee break
Local Correction algorithms for low-degree polynomials
15:00 - 15:25 (25min)
Local Correction algorithms for low-degree polynomials
Amik Raj Behera
https://caalm-2025.sciencesconf.org/data/program/Abstract_Amik_Raj_Behera.pdf
Synthesizing Asynchronous Automata from Fair Specifications
15:30 - 15:55 (25min)
Synthesizing Asynchronous Automata from Fair Specifications
B. Srivathsan
https://caalm-2025.sciencesconf.org/data/program/Abstract_Srivathsan.pdf
Coffee break
16:00 - 17:00 (1h)
Coffee break
The other side of derandomization
9:30 - 10:20 (50min)
The other side of derandomization
Sylvain Perifel
https://caalm-2025.sciencesconf.org/data/program/Abstract_Sylvain_1.pdf
Coffee break
10:30 - 11:00 (30min)
Coffee break
Generalizing Roberts' characterization of unit interval graphs
11:00 - 11:25 (25min)
Generalizing Roberts' characterization of unit interval graphs
Stéphane Vialette
https://caalm-2025.sciencesconf.org/data/program/Abstract_Stephane.pdf
Edit Distance of Finite State Transducers
11:30 - 11:55 (25min)
Edit Distance of Finite State Transducers
C. Aiswarya
https://caalm-2025.sciencesconf.org/data/program/Abstract_Aiswarya.pdf
Lunch
12:00 - 13:30 (1h30)
Lunch
Proof complexity meets finite model theory
13:30 - 14:20 (50min)
Proof complexity meets finite model theory
Joanna Fijalkow
https://caalm-2025.sciencesconf.org/data/program/Abstract_Joanna.pdf
Coffee break
14:30 - 15:00 (30min)
Coffee break
Structural results for Arithmetic formulas
15:00 - 15:25 (25min)
Structural results for Arithmetic formulas
Sébastien Tavenas
https://caalm-2025.sciencesconf.org/data/program/Abstract_Sebastien.pdf
The Formula Synthesis Problem - Focus on Propositional Dynamic Logic
15:30 - 15:55 (25min)
The Formula Synthesis Problem - Focus on Propositional Dynamic Logic
Sophie Pinchinat
https://caalm-2025.sciencesconf.org/data/program/Abstract_Sophie.pdf
Coffee break
16:00 - 17:00 (1h)
Coffee break
Conference Dinner
19:00 - 22:00 (3h)
Conference Dinner
Estimating the Electoral Consequences of Legislative Redistricting in France
9:30 - 10:20 (50min)
Estimating the Electoral Consequences of Legislative Redistricting in France
Claire Mathieu
https://caalm-2025.sciencesconf.org/data/program/Abstract_Claire.pdf
Coffee break
10:30 - 11:00 (30min)
Coffee break
Trading Determinism for NonCommutativity in Singularity Testing
11:00 - 11:25 (25min)
Trading Determinism for NonCommutativity in Singularity Testing
Partha Mukhopadhyay
https://caalm-2025.sciencesconf.org/data/program/Abstract_Partha.pdf
Resolving Nondeterminism with Randomness
11:30 - 11:55 (25min)
Resolving Nondeterminism with Randomness
K.S. Thejaswini
https://caalm-2025.sciencesconf.org/data/program/Abstract_Thejaswini.pdf
Lunch
12:00 - 13:30 (1h30)
Lunch
Permissive Equilibria in Multiplayer Reachability Games
9:30 - 10:20 (50min)
Permissive Equilibria in Multiplayer Reachability Games
Benjamin Monmege
https://caalm-2025.sciencesconf.org/data/program/Abstract_Benjamin.pdf
Coffee break
10:30 - 11:00 (30min)
Coffee break
The Multiplicative Weights Update Technique
11:00 - 11:25 (25min)
The Multiplicative Weights Update Technique
Nabil Mustafa
https://caalm-2025.sciencesconf.org/data/program/Abstract_Nabil.pdf
On the Probabilistic and Statistical Verification of Infinite Markov Chains
11:30 - 11:55 (25min)
On the Probabilistic and Statistical Verification of Infinite Markov Chains
Patricia Bouyer-Decitre
https://caalm-2025.sciencesconf.org/data/program/Abstract_Patricia.pdf
Lunch
12:00 - 13:30 (1h30)
Lunch
On Dependent Outputs in Reactive Synthesis
13:30 - 14:20 (50min)
On Dependent Outputs in Reactive Synthesis
Supratik Chakraborty
https://caalm-2025.sciencesconf.org/data/program/Abstract_Supratik.pdf
Coffee break
14:30 - 15:00 (30min)
Coffee break
Stabilizer Limits and Orbit Closures in Geometric Complexity Theory
15:00 - 15:25 (25min)
Stabilizer Limits and Orbit Closures in Geometric Complexity Theory
K.V. Subrahmanyam
https://caalm-2025.sciencesconf.org/data/program/Abstract_KV.pdf
Decidable fragments of First Order Modal Logic
15:30 - 15:55 (25min)
Decidable fragments of First Order Modal Logic
Anantha Padmanabha
https://caalm-2025.sciencesconf.org/data/program/Abstract_Anantha.pdf
Coffee break
16:00 - 17:00 (1h)
Coffee break
FPT Approximation Algorithms for Coverage and Satisfiability Problems
9:30 - 10:20 (50min)
FPT Approximation Algorithms for Coverage and Satisfiability Problems
Saket Saurabh
https://caalm-2025.sciencesconf.org/data/program/Abstract_Saket.pdf
Coffee break
10:30 - 11:00 (30min)
Coffee break
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
11:00 - 11:25 (25min)
High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
Marie Fortin
https://caalm-2025.sciencesconf.org/data/program/Abstract_Marie.pdf
Proof complexity of quantified Boolean formulas
11:30 - 11:55 (25min)
Proof complexity of quantified Boolean formulas
Olaf Beyersdorff
https://caalm-2025.sciencesconf.org/data/program/Abstract_Olaf.pdf
Lunch
12:00 - 13:30 (1h30)
Lunch
Faster two-dimensional pattern matching with k mismatches
13:30 - 13:55 (25min)
Faster two-dimensional pattern matching with k mismatches
Jonas Ellert
https://caalm-2025.sciencesconf.org/data/program/Abstract_Jonas.pdf
Linear integer arithmetic and Gaussian elimination
14:00 - 14:50 (50min)
Linear integer arithmetic and Gaussian elimination
Dmitry Chistikov
https://caalm-2025.sciencesconf.org/data/program/Abstract_Dmitry.pdf
Coffee break
15:00 - 16:00 (1h)
Coffee break
Privacy
|
Accessibility
Loading...