SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Seminar on Dynamic Data Structures - NTIN032
Title in English: Seminář o dynamických datových strukturách
Guaranteed by: Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty: Faculty of Mathematics and Physics
Actual: from 2015
Semester: summer
E-Credits: 3
Hours per week, examination: summer s.:0/2 C [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech
Teaching methods: full-time
Guarantor: Mgr. Vladan Majerech, Dr.
Class: Informatika Mgr. - volitelný
Classification: Informatics > Theoretical Computer Science
Pre-requisite : NTIN023
Annotation -
Last update: T_KTI (10.04.2001)
Report seminar concerning problems from TIN023.
Aim of the course - Czech
Last update: T_KTI (23.05.2008)

Referovat o nových a aktuáních výsledcích z dynamických datových struktur

Course completion requirements - Czech
Last update: Mgr. Vladan Majerech, Dr. (06.10.2017)

Podmínkou udělení zápočet je aktivita na semináři (například ve formě referátu přiděleného článku).

Syllabus -
Last update: T_KTI (24.05.2004)

Fully dynamic maintainance (both inserts and deletes) of bridge blocks and blocks in amortized polylog time using Top trees. Fully dynamic maintainance of components in $O(\log^2 n)$ amortized time.

Global search on Top trees and its application on maintaing tree center in $O(\log n)$ time.

Simillar problems for plan(e/ar) and/or directed graphs. Depends on current state of art dealing with dynamic graph problems.

Charles University | Information system of Charles University |