Instytut Informatyki Analitycznej

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

Seminaria

Succinct progress measures for solving parity games

21.06.2017

On the asymptotic density of valid sentences in first-order logic about one binary relation

14.06.2017

Helios: Web-based Open-Audit Voting

13.06.2017

Generic Complexity of Presburger Arithmetic by Alexander N. Rybalov

07.06.2017

Ulam Sequences and Ulam Sets

01.06.2017

The Undecidability of the Generalized Collatz Problem by Stuart A. Kurtz and Janos Simon

31.05.2017

Ramsey Theory for Binary Trees and the Separation of Tree-chromatic Number from Path-chromatic Number

31.05.2017

Subquadratic Greatest Common Divisor

30.05.2017

On the complexity of the chip-firing reachability problem

25.05.2017

Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and Applications by O.Bodini, J. David, and Ph. Marchal

24.05.2017