Instytut Informatyki Analitycznej

Wydział Matematyki i Informatyki Uniwersytet Jagielloński

Seminaria

Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms

17.11.2016

Succinct Data Structures

17.11.2016

Most programs stop quickly or never halt by Cristian S. Calude and Michael A. Stay

16.11.2016

Every digraph is majority 4-choosable

16.11.2016

Teoretyczne podstawy kryptoanalizy

15.11.2016

Max flows in O(nm) time, or better

10.11.2016

On more variants of the Majority Problem

10.11.2016

On the generic undecidability of the Halting Problem for normalized Turing machines by Alexander Rybalov

09.11.2016

Advanced Encryption Standard

08.11.2016

Fast and simple connectivity in graph timelines

03.11.2016