Doorkeeper

Talk by Dr. Sankar Deep Chakraborty (The University of Tokyo)

Thu, 19 Jul 2018 15:00 - 15:45 JST

RIKEN AIP Meeting room 3 & Kyoto University Seminar Room (Video Conference)

RIKEN AIP: Nihonbashi 1-chome Mitsui Building, 15th floor, 1-4-1 Nihonbashi, Chuo-ku, Tokyo 103-0027, Japan

Register

Registration is closed

Get invited to future events

Free admission

Description

Speaker: Dr. Sankar Deep Chakraborty (The University of Tokyo)

Title: Space Efficient Data Structures and Graph Algorithms

Abstract:
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.

About this community

RIKEN AIP Public

RIKEN AIP Public

Public events of RIKEN Center for Advanced Intelligence Project (AIP)

Join community