Speaker: Dr. Sankar Deep Chakraborty (The University of Tokyo)
Title: Space Efficient Data Structures and Graph Algorithms
Due to the rapid growth of data, algorithms that utilize the space efficiently are increasingly becoming important. Another major motivation comes from the proliferation of the handheld devices. Under such a setting, we would ideally like to have algorithms that are space efficient as well as practical and time efficient. In this talk, we explain and briefly survey on an emerging area of designing such algorithms for fundamental graph problems using little space without compromising on the speed as well.
|Date||July 19, 2018 (Thu) 15:00 - 15:45|