Instytut Informatyki Analitycznej

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

Seminaria

On the strongly generic undecidability of the Halting Problem by Alexander Rybalov

13.11.2013

Coloring subtree overlap graphs with O(log lgo n) colors.

12.11.2013

On some properties of (strongly) non-repetitive sequences

07.11.2013

Oblivious Algorithms for the Maximum Directed Cut Problem

06.11.2013

The Halting Problem Is Decidable on a Set of Asymptotic Probability One by Joel David Hamkins and Alexei Miasnikov

06.11.2013

On the construction of 3-chromatic hypergraphs with few edges.

05.11.2013

Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space

30.10.2013

Design and Implementation of a Parallel Priority Queue on Many-core Architectures by Xi He, Dinesh Agarwal, and Sushil K. Prasad

30.10.2013

Distortion-colouring of cubic bipartite multigraphs

24.10.2013

An Algorithmic Characterization of Polynomial Functions over Z_{p^n}

23.10.2013