Instytut Informatyki Analitycznej

数学与计算机系 uj-lift-theme.uniwersytet-jagiellonski

Seminaria

SOFSEM2026

09.02.2026 - 13.02.2026

Encoding Dependently-Typed Constructions into Simple Type Theory by Anthony Bordg and Adrián Dona Mateo

28.01.2026

The spanning tree spectrum

28.01.2026

Alon-Tarsi number and choosability of line graphs

22.01.2026

Recognizability in the Simply Typed Lambda-Calculus by Sylvain Salvati

21.01.2026

Cycle bases with low congestion in minor-excluded graphs

21.01.2026

Decremental Strongly-Connected Components and Single-Source Reachability in Near-Linear Time

15.01.2026

An O(log n) fully dynamic algorithm for maximum matching in a tree

15.01.2026

Lambda calculus with patterns by Jan Klop, Vincent van Oostromd and Roel de Vrijer

14.01.2026

Cycle lengths in graphs of given minimum degree

14.01.2026