Theoretical Computer Science

Faculty of Mathematics and Computer Science Jagiellonian University

Seminaria

An upper bound for reduction sequences in the typed lambda-calculus by H. Schwichtenberg

22.01.2014

Scheduling with an Orthogonal Resource Constraint

22.01.2014

On the number of edges in families of pseudo-discs

21.01.2014

Three variations on the theme of Szemeredi

16.01.2014

Analytic aspects of the shuffle product by Marni Mishna, Mike Zabrocki

15.01.2014

Linear-Time Algorithms for Tree Root Problems

15.01.2014

List Colouring When The Chromatic Number Is Close To the Order Of The Graph

14.01.2014

Coloring intersection graphs of pseudo-discs

09.01.2014

Generalized satisfability problems: minimal elements and phase transitions by Nadia Creignoua, Herve Daud

08.01.2014

Linear Recognition and Embedding of Fibonacci Cubes

08.01.2014