Ramanujan Auditorium

Succinct Representations

Venkatesh Raman

IMSc, Chennai

Trees form an important data structure in computer science. How much space (in terms of the number of bits) does a standard representation take to represent an n node tree? How much space is necessary? How much space is sufficient to perform the required navigation operations? We address these questions for trees and other objects like sets. The bulk of the talk will be on motivating why these questions are important. We will discuss these through the representation of suffix trees, a popular data structure for search engine (like Google) and computational biology applications!

YouTube Livestream Link: www.youtube.com/watch?v=BOedYdDr4eE

More information: www.imsc.res.in/akam