Bookmarks
Procedural Generation using Constraint Satisfaction
Demonstrates applying constraint satisfaction algorithms to procedural content generation, detailing algorithmic concepts and code examples for maps, plants, and textures.
A* Search: How Your Map Applications Find Shortest Routes
A guided derivation and proof-oriented explanation of A* search and related path-finding algorithms used in mapping applications, emphasizing optimality and heuristic design.
What P vs NP is actually about
Explains the P vs NP problem by reducing arbitrary algorithms to SAT circuits, illustrating NP-completeness, reversibility, and implications for cryptography.
Understanding B-Trees: The Data Structure Behind Modern Databases
Clear, in-depth explanation of B-trees, a fundamental data structure used in databases and file systems.
Halting Problem & Quantum Entanglement 2020 Breakthrough result [MIP*=RE]
Clear technical explanation of the groundbreaking MIP*=RE complexity-theory result—valuable foundational content for theoretical computer scientists.
Dynamic Programming isn't too hard. You just don't know what it is.
Explains the algorithmic technique of dynamic programming and is relevant for software engineers preparing for technical interviews or improving algorithmic skills.
CppCon 2018: Jonathan Boccara “105 STL Algorithms in Less Than an Hour”
CppCon lecture systematically covering all 105 STL algorithms, a high-value educational resource for C++ developers.
I can prove I’ve solved this Sudoku without revealing it
Clear, well-structured explanation of zero-knowledge proofs with examples—solid educational cryptography content.
Donald Knuth: Algorithms, Complexity, and The Art of Computer Programming | Lex Fridman Podcast #62
Donald Knuth reflects on algorithmic analysis, computational complexity, and insights from The Art of Computer Programming.
How AI Discovered a Faster Matrix Multiplication Algorithm
Explains how DeepMind’s AlphaTensor discovered record-breaking tensor-decomposition algorithms that speed up matrix multiplication.
The hidden beauty of the A* algorithm
Demonstrates how consistent heuristics transform Dijkstra into the A* algorithm, with proofs, implementation tips, and geographic path-finding demos.