Succinct Data Structures

presenter: J. Ian Munro, School of Computer Science, University of Waterloo
published: Oct. 3, 2014,   recorded: September 2014,   views: 101
Categories

Slides

Related content

Report a problem or upload files

If 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.
Lecture popularity: You need to login to cast your vote.
  Bibliography

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 1:00:11
!NOW PLAYING
Watch Part 2
Part 2 51:23
!NOW PLAYING
Watch Part 3
Part 3 48:19
!NOW PLAYING
Watch Part 4
Part 4 1:00:11
!NOW PLAYING
Watch Part 5
Part 5 44:03
!NOW PLAYING

Description

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.

See Also:

Download slides icon Download slides: lads2014_munro_data_structures.pdf (1.4┬áMB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: