Datové struktury
| Thesis title in Czech: | |
|---|---|
| Thesis title in English: | Data structures |
| Key words: | univerzalni hashovani, delka nejdelsiho retezce, c-univerzalni systemy |
| English key words: | universal hashing, length of the longest chain, c-universal systems |
| Academic year of topic announcement: | 2010/2011 |
| Thesis type: | dissertation |
| Thesis language: | angličtina |
| Department: | Department of Theoretical Computer Science and Mathematical Logic (32-KTIML) |
| Supervisor: | prof. Mgr. Michal Koucký, Ph.D. |
| Author: | hidden - assigned and confirmed by the Study Dept. |
| Date of registration: | 18.11.2010 |
| Date of assignment: | 18.11.2010 |
| Guidelines |
| Studium vlastností univerzálního hashovaní s možností jejího praktického použití. Teoreticky i experimentálně ověřit získané
možnosti a modely. |
| References |
| J. L. Carter a M. N. Wegman: Universal classes of hash functions, J. Comp. Sys. Sci. 18(1979), 143-154.
Y. Manson, N. Nisan a P. Tiwari: The computational complexity of universal hashing, Theoretical Computer Science 107(2002), 235-243. K. Mehlhorn: Data Structures and algorithms, Searching and sorting, Springer, 1984 Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis 2005. |