Ukkonen's Algorithm
Grad school assignment to describe a linear time algorithm that constructs a suffix tree.
▶︎
Suffix tries: introduction
▶︎
Linear Time Construction of Suffix Trees with Ukkonen's Algorithm
▶︎
But what is quantum computing? (Grover's Algorithm)
▶︎
Suffix trees: suffix links
▶︎
The World's Most Important Machine
▶︎
Gil Strang's Final 18.06 Linear Algebra Lecture
▶︎
Suffix tries and trees
▶︎
Trie Data Structure
▶︎
Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI | Lex Fridman Podcast #472
▶︎
How I Accidentally Set a World Record in Opus Magnum
▶︎
A tale of two problem solvers | Average cube shadow area
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
But what is the Fourier Transform? A visual introduction.
▶︎
1. Algorithms and Computation
▶︎
The unexpectedly hard windmill question (2011 IMO, Q2)
▶︎
Fibonacci Heaps or "How to invent an extremely clever data structure"
▶︎
The Oldest Unsolved Problem in Math
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
I implemented the `md5` algorithm in Bash with 0 external utilities
▶︎