Instytut Informatyki Analitycznej

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

Seminaria

A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy by JAKOB GRUE SIMONSEN

18.11.2020

Explicit two-deletion codes with redundancy matching the existential bound

12.11.2020

Harmonious Coloring of Hypergraphs

12.11.2020

Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs

05.11.2020

Polynomial algorithms for CFGs via semiring embeddings

05.11.2020

COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS by IGOR PAK

04.11.2020

Range queries and triangles

29.10.2020

Majority choosability of digraphs

29.10.2020

COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS by IGOR PAK

28.10.2020

A Double-Exponential Lower Bound for the Distinct Vectors Problem

22.10.2020