PickVids17. Succinct Structures I
推荐理由
Erik Demaine [1] gave two good lectures on succinct data structures [2] in the 2012 MIT 6.851 Advanced Data Structures course
说明
这是2013年由MIT OpenCourseWare发布的一部课堂讲座，主题归在Algorithms & data structures。它讲的是succinct data structures这一支里的具体问题，而不是把整个领域扫一遍。适合想看推导、证明或实现细节的人。内容上可以概括成：Erik Demaine's MIT 6.851 Advanced Data Structures lecture introducing succinct data structures, covering rank, select and tries. It is part of the Spring 2012 course.这些读者给出的理由，核心是：HN recommends it as a clear, high-quality introduction to succinct data structures from a leading authority.讲法不绑某一条新闻，过几年仍然可以当材料看。从2018年到2022年，有3位不同的读者在3个不同月份把它推荐出来，其中明确叫别人去看的有0次。节奏接近上课，可以暂停做笔记。它假设你愿意跟着一条推导走完。如果已经会了基本定义，就把注意力放在它怎么把succinct data structures变成能跟着复述的例子。
视频信息
- 频道
- MIT OpenCourseWare
- 时长
- 1 小时 20 分
- 发布年份
- 2013
同主题更多
- CppCon 2017: Matt Kulukundis “Designing a Fast, Efficient, Cache-friendly Hash Table, Step by Step”
- The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
- Modern Dictionaries by Raymond Hettinger
- CppCon 2014: Chandler Carruth "Efficiency with Algorithms, Performance with Data Structures"
- CppCon 2017: Juan Pedro Bolivar Puente “Postmodern immutable data structures”
- Sorting Algorithms: Speed Is Found In The Minds of People - Andrei Alexandrescu - CppCon 2019