expository

expository notes, essays, and paper-reading notes on computer science and mathematics.

Expository Notes:

  1. Worst-Case Linear-Time Selection: The Median-of-Medians Method

  2. Why Comparison-Based Sorting has an Ω(n log n) Lower Bound

  3. Expected Number of Comparisons in Randomized Quicksort

  4. Why Building a Binary Heap Takes Linear Time

  5. The Theory of Graph Minors

Expository Essays:

  1. You’re Not Cleared to Read This (Unless You Understand Lattices)

  2. Are Computers Really Random?

  3. How to Prove You Know the Secret Without Telling the Secret?

  4. How an 18th-Century Soil Problem Found Its Way into Your AI-Generated Ghibli Portrait

  5. Why do Black Holes and Blockchain Use the Same Math?

  6. Pi vs. AI: Could a Neural Network Predict the Next Digit of Pi?

Paper Notes: