17. Succinct Structures I
MIT OpenCourseWare3 HN recommenders · recommended in 3 months, 2018-2022
17K views · 12 years ago · lecture · evergreen
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.
1:26:11Succinct Data Structures
Edward Kmett
9K views • 12 years ago
51:47Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
MIT OpenCourseWare
2.9M views • 13 years ago
58:22Lecture 1B | MIT 6.001 Structure and Interpretation, 1986
MIT OpenCourseWare
116K views • 17 years ago
1:12:56Lecture 1A | MIT 6.001 Structure and Interpretation, 1986
MIT OpenCourseWare
995K views • 17 years ago
1:12:56Lecture 1A: Overview and Introduction to Lisp
MIT OpenCourseWare
420K views • 7 years ago
39:49Lec 1 | MIT 18.06 Linear Algebra, Spring 2005
MIT OpenCourseWare
4.9M views • 17 years ago
53:30Lec 1 | MIT 6.00 Introduction to Computer Science and Programming, Fall 2008
MIT OpenCourseWare
6.6M views • 17 years ago
53:56Three Beautiful Quicksorts
Google TechTalks
45K views • 19 years ago
1:00:341. Introduction, Finite Automata, Regular Expressions
MIT OpenCourseWare
626K views • 5 years ago
5:5015 Sorting Algorithms in 6 Minutes
Timo Bingmann
29.4M views • 13 years ago
1:08:40Lecture 1 | Machine Learning (Stanford)
Stanford
2.7M views • 18 years ago
1:24:38Lecture 7A: Metacircular Evaluator, Part 1
MIT OpenCourseWare
32K views • 7 years ago
49:47Lecture 1 | Programming Methodology (Stanford)
Stanford
2.6M views • 18 years ago
1:04:45Stanford Seminar - Concatenative Programming: From Ivory to Metal
Stanford Online
14K views • 8 years ago
58:36Advanced Topics in Programming Languages: A Lock-Free Hash Table
GoogleTalksArchive
29K views • 14 years ago
1:24:38Lecture 7A | MIT 6.001 Structure and Interpretation, 1986
MIT OpenCourseWare
35K views • 17 years ago
46:46Category Theory 1.1: Motivation and Philosophy
Bartosz Milewski
394K views • 10 years ago
42:31"Datafun: a functional query language" by Michael Arntzenius
Strange Loop Conference
9K views • 9 years ago
39:15The Maximal Graph - Wilker Silva
ClojureTV
8K views • 6 years ago
30:37High-performance Tree Wrangling, the APL Way // Aaron Hsu // Dyalog '18
Dyalog User Meetings
6K views • 7 years ago
3 comments from Hacker News
I'm most definitely not an expert in this area, but I have recently taken interest in learning about "succinct data structures", which from what I understand have their place in bioinformatics. It's been a challenging topic to learn about, because most of the information comes from Computer Science papers and articles where the information is presented in a very formal, mathematical way, which I am just not used to. Normally when thinking about data structures and algorithms, we're mostly concerned with optimizing for speed. Space complexity is not usually as big of a consideration. Succinct data structures are all about creating ways to achieve good runtime performance while representing the data in a "compressed" format. I think this comes in handy when doing things like DNA sequencing since data sets are so large. I'm excited to check out some of links in the post, and in case any one else is interested in learning more about succinct data structures, here's a few resources I'd recommend: Prof. Ben Langmead's YouTube channel: link Alex Bowe's blog has some good content: link Prof. Erik Demaine's "succinct" lectures from his adv. data structures course at MIT on YouTube: ▶ this video Edward Kmett's Haskell live coding session going into some details about succinct: link There's also a lot of research papers, which you should be able to find by searching for "succinct data structures" (Jacobson, Munro, Brodnik, Raman, Rao, Navaro, Sadakane just to name a few). I at least ha
Is there a good applied overview of succinct data structures for programmers (non CS researchers)? Also I just started researching succinct dynamic graph data structures a few days ago and ended up on a very interesting paper if anyone is interested: link Will also add this, lecture introducing succinct data structures: ▶ this video Ok last edit to this comment but I’m sure someone else will find this useful. I also found a good book (haven’t read it yet, but it doesn't seem to have much code examples if any) that covers Succinct Graph data structures and also Succinct Dyanmic Data structures: link
Erik Demaine [1] gave two good lectures on succinct data structures [2] in the 2012 MIT 6.851 Advanced Data Structures course, and Rajeev Raman [3] just gave a tutorial on succinct data structures [4] at SIGMOD 2018. NB: SDSL Cheatsheet link [1] link [2] MIT 6.851 Succinct Structures I ▶ this video II link [3] link [4] SIGMOD 2018 Tutorial: In-memory Representations of Databases via Succinct Data Structures link