16. Strings
MIT 6.851 Advanced Data Structures, Spring 2012 View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Strings: suffix tree, suffix array, linear-time construction for large alphabets, suffix tray, document retrieval License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu
▶︎
17. Succinct Structures I
▶︎
1. Persistent Data Structures
▶︎
Knuth–Morris–Pratt(KMP) Pattern Matching(Substring search)
▶︎
MIT Godel Escher Bach Lecture 1
▶︎
How to Speak
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
3. Divide & Conquer: FFT
▶︎
Why Evolution Split Your Brain In Half – Brain Asymmetry with Jim Al-Khalili
▶︎
Is the AfD a threat to Germany? Mehdi Hasan & Maximilian Krah | Head to Head
▶︎
Math Seminar | 50 Centuries in 50 Minutes: A Brief History of Mathematics
▶︎
Lecture 23: Computational Complexity
▶︎
Suffix tries and trees
▶︎
2015 Math Panel with Donaldson, Kontsevich, Lurie, Tao, Taylor, Milner
▶︎
The problem with pretending quantum mechanics makes sense | Sean Carroll
▶︎
Time Is But a Stubborn Illusion - Sneak Peek | Genius
▶︎
You Know This Song (but the Orchestra Doesn’t) | Jacob Collier & VSO School of Music Orchestra | TED
▶︎
Lecture 14: Depth-First Search (DFS), Topological Sort
▶︎