Theoretical Computer Science

Faculty of Mathematics and Computer Science Jagiellonian University

Seminaria

Posets omitting two incomparable chains of the same height

29.04.2009

Cleaning Regular Graphs with Brushes and Brooms

23.04.2009

Basic Simple Type Theory

22.04.2009

Spectral gaps and sum-sets

22.04.2009

Coloring numbers of co-comparability graphs

16.04.2009

Higher-order Unificatrion and Matching

08.04.2009

On Large Quadrant-Depth

02.04.2009

Chip-Firing, Antimatroids, and Polyhedra

01.04.2009

Sampling from distributive lattices - the Markov chain approach

26.03.2009

A Lazy Introduction to Goedel's Theorems

25.03.2009