Busy Beavers, and the Quest for Big Numbers

NP-hard does not mean hard

Visualizing an Assassin Puzzle

Introducing Elliptic Curves

For mathematicians does not mean equality

Classic Nintendo Games Are NP-Hard

Binary Search on Graphs

Mathematical Genealogy

Elliptic Curves as Python Objects

The Reasonable Effectiveness of the Multiplicative Weights Update Algorithm

Kolmogorov Complexity – A Primer – Math ∩ Programming

Markov Chain Monte Carlo Without All the Bullshit

Singular Value Decomposition Part 2: Theorem, Proof, Algorithm

Math ∩ Programming

Teaching Mathematics – Graph Theory (2011)

Why There Is No Hitchhiker’s Guide to Mathematics for Programmers

Hashing to Estimate the Size of a Stream

When Greedy Algorithms Are Good Enough: Submodularity and the (1-1/e) Approx'n

Load Balancing and the Power of Hashing

Serial Dictatorships and House Allocation

A Quasipolynomial Time Algorithm for Graph Isomorphism: The Details

Introducing Elliptic Curves (2014)

The Boosting Margin, or Why Boosting Doesn't Overfit

What does it mean for an algorithm to be fair?

Why there is no Hitchhiker's Guide to Mathematics for Programmers

Methods of Proof – Diagonalization

Markov Chain Monte Carlo Without All the Bullshit

Groups: A Primer (2012)

A Proofless Introduction to Information Theory

Community Detection in Graphs

More →