0


简洁的数据结构

Succinct Data Structures
课程网址: http://videolectures.net/lads2014_munro_data_structures/  
主讲教师: J. Ian Munro
开课单位: 滑铁卢大学
开课时间: 2014-10-03
课程语种: 英语
中文简介:
简洁的数据结构是组合对象的表示,它需要空间接近给定大小的此类对象的数量的对数,并允许快速执行预期的查询(也许是更新)操作。这种结构的示例包括大约2n位的树表示,支持恒定时间内的大多数导航操作。我们将介绍一般区域,讨论树和其他组合对象的表示。演示文稿将涵盖“较旧”结果和新结果。
课程简介: 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.
关 键 词: 数据结构; 二叉树
课程来源: 视频讲座网
数据采集: 2020-10-12:zyk
最后编审: 2020-10-12:zyk
阅读次数: 86