STACS

42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025)

Jena, March 04-07, 2025

Tutorial Speaker

Albert Atserias

Albert Atserias (UPC Barcelona)
Proof complexity and its relations to SAT solving

Invited Speakers

Daniel Dadush

Daniel Dadush (CWI Amsterdam)
A Strongly Polynomial Algorithm for Linear Programs with at most Two Non-zero Entries per Row or Column

Anupam Das

Anupam Das (University of Birmingham)
Algebras for automata: reasoning with regularity

Susanna F. de Rezende

Susanna F. de Rezende (Lund University)
Some Recent Advancements in Monotone Circuit Complexity