TCS Seminar @ UA
The TCS Seminar is meant to expose master’s students from the University of Antwerp to theoretical topics in computer science. For the academic year 2024-2025, the seminar will take place on Wednesdays at 13:45 in M.A.143 (Middelheim campus). The preliminary agenda is as follows.
- 26/02/2025 - Bart Bogaerts: Combinatorial Solving with Provably Correct Results
- 05/03/2025 - Jan Van den Bussche: Reasoning About Expressiveness and Decidability of Query Languages
- 12/03/2025 - Floris Geerts: Expressiveness and Generalisation in Graph Neural Networks
- 19/03/2025 - Sarah Leyder: Causal discovery, modeling and inference: introduction
- 26/03/2025 - Benny Van Houdt: Randomized Load Balancing: the queue at the cavity at work
- 02/04/2025 - Ingo Blechschmidt: Can abstract mathematical proofs be ran as programs?
You will find below posts regarding upcoming and past talks given during the seminar. If you want to attend the seminar, please sign up via the corresponding form so that we book a large enough room for that talk and buy enough sandwiches for everyone.
Posts
-
Can abstract mathematical proofs be ran as programs?
-
Randomized Load Balancing: the Queue at the Cavity at Work
-
Causal discovery, modeling and inference: introduction
-
Expressiveness and Generalisation in Graph Neural Networks
-
Reasoning About Expressiveness and Decidability of Query Languages
-
Combinatorial Solving with Provably Correct Results
-
How to Decompose Planar Graphs
-
Weakly-supervised object localization via class activation mapping
-
Systems of polynomial equations over finite fields
-
Confident peptide-spectrum matching in the absence of ground truth data
-
Discrimination and bias detection in AI models
-
Transducers and Their Decision Problems
-
Explicit back-off rates for achieving target throughputs in CSMA/CA networks
-
Expressive Power of Graph Neural Networks
-
Parameter Synthesis Problems for One-Counter Automata
-
Solving Problems with Logic - Decidable Theories
subscribe via RSS