  Thesis title |
Year of announcement |
Year of defence |
Thesis type | Thesis discipline | Supervisor |
Author |
Announced |
Assigned | Department | Faculty | |
 |
Communication complexity and data structures | 2018/2019 | dissertation | 4I4 | prof. Mgr. Michal Koucký, Ph.D. | 22.04.2016 | Ne | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | ||
|
Efficient algorithms and their limits in various models of computation | 2023/2024 | dissertation | prof. Mgr. Michal Koucký, Ph.D. | 15.04.2024 | Ne | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | |||
|
Explicit construction of expanders | 2016/2017 | dissertation | prof. Mgr. Michal Koucký, Ph.D. | 29.08.2014 | Ne | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | |||
|
Efficient parallel data structures | 2023/2024 | dissertation | P4I4 | prof. Mgr. Michal Koucký, Ph.D. | 26.04.2022 | Ne | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | ||
|
Bounds on existence of odd and unique expanders | 2016/2017 | diploma thesis | ITI | prof. Mgr. Michal Koucký, Ph.D. | 29.08.2014 | Ne | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
Results 1-5 of 5 1