Complexity of dynamic data structures
| Thesis title in Czech: |
Časová složitost dynamických datových struktur |
| Thesis title in English: |
Complexity of dynamic data structures |
| Key words: |
Třídění|Booleovské obvody|online Oblivious RAM |
| English key words: |
Sorting|Boolean Circuit|online Oblivious RAM |
| Academic year of topic announcement: |
2016/2017 |
| Thesis type: |
dissertation |
| Thesis language: |
angličtina |
| Department: |
Computer Science Institute of Charles University (32-IUUK) |
| Supervisor: |
prof. Mgr. Michal Koucký, Ph.D. |
| Author: |
hidden - assigned and confirmed by the Study Dept. |
| Date of registration: |
20.09.2017 |
| Date of assignment: |
20.09.2017 |
| Confirmed by Study dept. on: |
05.10.2017 |
| Date and time of defence: |
25.08.2021 15:00 |
| Date of electronic submission: | 16.06.2021 |
|---|
| Date of submission of printed version: | 29.06.2021 |
|---|
| Date of proceeded defence: |
25.08.2021 |
| Opponents: |
Andrew Drucker |
| |
Yuval Ishai |
| |
|
| |
|
