With the ever increasing size of the data sets, an important aspect in handling information is storage requirement. Compression schemes tackle this issue by reducing the space requirement of stored data. The drawback with such schemes, however, is the slow access due to decompression of almost the entire compressed data to answer a query that is only relevant to a small fraction of the data. Succinct data structures are an attempt to overcome this shortcoming by accompanying compression with fast access to data and support for queries.In this talk, starting with a brief introduction to succinct data structures, I will summarize the status of succinct representations for trees and graphs, including some of our recent work on encodings for various graph classes.

Srinivasa Rao Satti is an Associate Professor at the Department of Computer Science at the Norwegian University of Science and Technology (NTNU). He completed his Masters and PhD from the Institute of Mathematical Sciences, India. Before joining NTNU in 2021, he worked as a Research Associate at the University of Leices, UK; as a Postdoctoral Fellow at the University of Waterloo, Canada; as a Research Assistant Professor at the IT University of Copenhagen, Denmark and also at the University of Aarhus, Denmark; and as a Assistant/Associate Professor at the Seoul National University, South Korea. His research interests are broadly in the area of algorithms and data structures. His work so far has been mainly concentrated on the design and implementation of space-efficient structures for some fundamental problems in data structures. His other research interests include external memory algorithms, database indexing, data compression and energy-efficient/approximate computing.