  Thesis title |
Year of announcement |
Year of defence |
Thesis type | Thesis discipline | Supervisor |
Author |
Announced |
Assigned | Department | Faculty | |
 |
Variants of Reed-Solomon codes over other algebraic structures | 2020/2021 | 2021/2022 | diploma thesis | ITI | prof. Mgr. Michal Koucký, Ph.D. | hidden |
21.02.2021 | 21.02.2021 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Data structures | 2010/2011 | dissertation | 4I1 | prof. Mgr. Michal Koucký, Ph.D. | hidden |
23.04.2010 | 18.11.2010 | Katedra teoretické informatiky a matematické logiky (32-KTIML) | MFF | |
|
Bounds on existence of odd and unique expanders | 2015/2016 | 2015/2016 | diploma thesis | ITI | prof. Mgr. Michal Koucký, Ph.D. | hidden |
29.04.2016 | 29.04.2016 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Complexity of dynamic data structures | 2016/2017 | 2020/2021 | dissertation | P4I4 | prof. Mgr. Michal Koucký, Ph.D. | hidden |
29.08.2014 | 20.09.2017 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Data structure behavior with variable cache size | 2015/2016 | 2016/2017 | diploma thesis | IDMA | prof. Mgr. Michal Koucký, Ph.D. | hidden |
29.01.2016 | 29.01.2016 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Dyck edit distance of random strings | 2024/2025 | 2023/2024 | diploma thesis | prof. Mgr. Michal Koucký, Ph.D. | hidden |
15.05.2024 | 15.05.2024 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | |
|
Sorting using Splay trees | 2025/2026 | 2024/2025 | diploma thesis | ITIP | prof. Mgr. Michal Koucký, Ph.D. | hidden |
04.07.2025 | 16.07.2025 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Aplikace algebraických metod ve výpočetní složitosti | 2008/2009 | dissertation | 4I1 | prof. Mgr. Michal Koucký, Ph.D. | hidden |
17.09.2008 | 26.09.2008 | Matematický ústav AV ČR, v.v.i. (32-MUAV) | MFF | |
|
New Bounds for Combinatorial Problems and Quasi-Gray Codes | 2010/2011 | 2018/2019 | dissertation | 4I4 | prof. Mgr. Michal Koucký, Ph.D. | hidden |
28.04.2010 | 02.10.2014 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Kolmogorov complexity and Shannon information | 2018/2019 | 2019/2020 | Bachelor's thesis | MMIB | prof. Mgr. Michal Koucký, Ph.D. | hidden |
26.04.2019 | 07.05.2019 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Limits of Data Structures, Communication, and Cards | 2015/2016 | 2020/2021 | dissertation | P4I4 | prof. Mgr. Michal Koucký, Ph.D. | hidden |
19.05.2015 | 15.09.2015 | 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 | ||
|
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 | ||
|
Embedding of edit distance in Hamming distance | 2024/2025 | diploma thesis | ITIP | prof. Mgr. Michal Koucký, Ph.D. | Bc. Jiří Kalvoda | 19.09.2025 | 19.09.2025 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | |
|
String Similarity Measures: Metric Embeddings and Applications | 2020/2021 | 2024/2025 | dissertation | P4I4A | prof. Mgr. Michal Koucký, Ph.D. | Sudatta Bhattacharya, M.Sc., Ph.D. | 12.06.2020 | 22.10.2020 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Pseudorandom walks and chip firing games | 2020/2021 | 2020/2021 | diploma thesis | prof. Mgr. Michal Koucký, Ph.D. | hidden |
21.02.2021 | 21.02.2021 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | |
|
Efficient parallel data structures | 2025/2026 | dissertation | P4I4 | prof. Mgr. Michal Koucký, Ph.D. | 26.04.2022 | Ne | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | ||
|
Current problems in computational complexity | 2021/2022 | dissertation | P4I4 | prof. Mgr. Michal Koucký, Ph.D. | hidden |
26.04.2022 | 19.09.2022 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | |
|
The Online Labeling Problem | 2010/2011 | 2013/2014 | dissertation | 4I1 | prof. Mgr. Michal Koucký, Ph.D. | hidden |
23.04.2010 | 19.11.2010 | Matematický ústav AV ČR, v.v.i. (32-MUAV) | MFF |
|
Data structures for file maintenance problem | 2009/2010 | 2009/2010 | diploma thesis | I | prof. Mgr. Michal Koucký, Ph.D. | hidden |
03.10.2009 | 03.10.2009 | Katedra teoretické informatiky a matematické logiky (32-KTIML) | MFF |
|
Constructions of Bounded-depth Superconcentrators | 2021/2022 | 2020/2021 | Bachelor's thesis | IOI | prof. Mgr. Michal Koucký, Ph.D. | hidden |
04.05.2021 | 04.05.2021 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Distinguishing pairs of words using finite automata | 2022/2023 | 2022/2023 | diploma thesis | IDMP | prof. Mgr. Michal Koucký, Ph.D. | Mgr. Daria Bilan | 03.07.2023 | 03.07.2023 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF |
|
Efficient algorithms and their limits in various models of computation | 2024/2025 | dissertation | P4I4A | prof. Mgr. Michal Koucký, Ph.D. | hidden |
15.04.2024 | 24.09.2024 | Informatický ústav Univerzity Karlovy (32-IUUK) | MFF | |
|
Efficient sorting algorithms for memory hierarchies | 2024/2025 | 2023/2024 | diploma thesis | ITIP | prof. Mgr. Michal Koucký, Ph.D. | Mgr. Josef Matějka | 16.07.2024 | 16.07.2024 | 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 |
Results 1-25 of 25 1