Instytut Informatyki Analitycznej

Wydział Matematyki i Informatyki Uniwersytet Jagielloński

Seminaria

On the Lonely Runner Problem II

05.11.2015

Computing Tree-Depth Faster Than 2^n

04.11.2015

Card-Based Protocols for Any Boolean Function (by Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, and Hideaki Sone )

04.11.2015

On the Lonely Runner Problem I

29.10.2015

Fast Algorithm for Partial Covers in Words

28.10.2015

Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs

28.10.2015

On the number of lambda terms with prescribed size of their De Bruijn representation

28.10.2015

The chromatic number of the plane

22.10.2015

Representative sets for multisets

21.10.2015

On the Recursive Enumerability of Fixed-Point Combinators (by Mayer Goldberg)

21.10.2015