Huacheng Yu: Succint Data Structures

4 Просмотры
Издатель
Join us on Saturday, August 1st at UTC+0 (00:00) for the next edition of our ICPC University Alumni Lecture Series from Huacheng Yu. Huacheng currently serves as an Associate Research Scholar at Princeton University and was an ICPC 2010 World Finalist, representing Tsinghua University.
In his lecture, Huacheng will give an introduction to the succinct data structures. He will explain what is a succinct data structure, and present two such data structures in detail, for the rank problem and the problem of storing base-B vectors respectively. Finally, he will list a few more results in this area and state an open question. Mark your calendar today to tune into bit.ly/ICPCNewsFB or bit.ly/ICPCLiveYT for this exciting learning opportunity!
Комментариев нет.
Яндекс.Метрика