Succinct Data Structures
published: Oct. 3, 2014, recorded: September 2014, views: 2451
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
A succinct data structure is a representation of a combinatorial object that requires space close to the logarithm of the number of such objects of the given size and permits the expected query (and perhaps update) operations to be performed quickly. Examples of such structures include representations of tree in about 2n bits supporting most navigation operations in constant time. We will introduce the general area, discussing representations of trees and other combinatorial objects. The presentation will cover a mix of "older" and new results.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !