Speakers, titles, abstracts, slides

Speakers, titles, abstracts and slides or other links

C. Aiswarya, CMI, Chennai. Edit Distance of Finite State Transducers. Abstract. Slides

Siddharth Barman, IISc Bengaluru. Fair Division Beyond Monotone Valuations. Abstract.

Amik Raj Behera, Copenhagen University. Local Correction algorithms for low-degree polynomials. Abstract. Slides.

Olaf Beyersdorff, Friedrich Schiller Universität Jena. Proof complexity of quantified Boolean formulas. Abstract. Slides.

Patricia Bouyer-Decitre, LMF, ENS Paris-Saclay. On the Probabilistic and Statistical Verification of Infinite Markov Chains. Abstract. Slides.

Supratik Chakraborty, IIT Bombay. On Dependent Outputs in Reactive Synthesis. Abstract. Slides.

Dmitry Chistikov, Warwick University. Linear integer arithmetic and Gaussian elimination. Abstract.

Carola Doerr, LIP6, CNRS, Paris Centre. Analyzing black-box optimization algorithms - why and how? Abstract. Slides.

Jonas Ellert, ENS Paris. Faster two-dimensional pattern matching with k mismatches. Abstract. Slides.

Marie Fortin, IRIF, CNRS, Paris Centre. High-Level Message Sequence Charts: Satisfiability and Realizability Revisited. Abstract.

Joanna Fijalkow, LaBRI, CNRS, Bordeaux. Proof complexity meets finite model theory. Abstract. Slides.

Sandra Kiefer, University of Oxford. The Success Story of Polyregular Functions: Why We Need Pebbles. Abstract.

Claire Mathieu, IRIF, CNRS, Paris Centre. Estimating the Electoral Consequences of Legislative Redistricting in France. Abstract. Slides.

Benjamin Monmège, LIS, Université Aix-Marseille. Permissive Equilibria in Multiplayer Reachability Games. Abstract. Slides.

Partha Mukhopadhyay, CMI, Chennai. Trading Determinism for NonCommutativity in Singularity Testing. Abstract. Slides.

Nabil Mustafa, LIPN, Université Sorbonne Paris Nord. The Multiplicative Weights Update Technique. Abstract. Lecture notes.

Anantha Padmanabha, IIT Madras. Decidable fragments of First Order Modal Logic. Abstract. Slides.

Sylvain Perifel, LIPN, Université Sorbonne Paris Nord. The other side of derandomization. Abstract.

Sophie Pinchinat, IRISA, Université de Rennes. The Formula Synthesis Problem - Focus on Propositional Dynamic Logic. Abstract.

Saket Saurabh, IMSc, Chennai. FPT Approximation Algorithms for Coverage and Satisfiability Problems. Abstract.

B. Srivathsan, CMI, Chennai. Synthesizing Asynchronous Automata from Fair Specifications. Abstract. Slides.

K.V. Subrahmanyam, CMI, Chennai. Stabilizer Limits and Orbit Closures in Geometric Complexity Theory. Abstract.

Sébastien Tavenas, LAMA, Université de Savoie Mont-Blanc. Structural results for Arithmetic formulas. Abstract.

K.S. Thejaswini, IST Austria. Resolving Nondeterminism with Randomness. Abstract.

Stéphane Vialette, LIGM, CNRS, Paris Est. Generalizing Roberts' characterization of unit interval graphs. Abstract.

Georg Zetzsche, Max Planck Institut for Software Systems, Kaiserslautern. A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter. Abstract. Slides.