Loading...

Tag trends are in beta. Feedback? Thoughts? Email me at [email protected]

Smoothsort Demystified (2011)

Rank-balanced trees (2014)

Dijkstra’s Algorithm in JS

Modern Perfect Hashing

Why Busy Beaver hunters fear the Antihydra

Solving the NYTimes Pips puzzle with a constraint solver

Rotating Workforce Scheduling in MiniZinc

The Vindication of Bubble Sort

SATisfying Solutions to Difficult Problems

Cuckoo hashing improves SIMD hash tables (and other hash table tradeoffs)

Index 1,600,000,000 Keys with Automata and Rust (2015)

Learning Regular Languages with RPNI Algorithm

Incremental Construction of Minimal Acyclic Finite-State Automata (2000)

Oavif: Faster target quality image compression

Fast SSIMULACRA2 Implementation in Zig

Space-Efficient Data Structures for Top-k Completion (2013)

Adding Stride Scheduling to Xv6

Entropy in Compression (2013)

The Case for Learned Index Structures

The World's Fastest Scrabble Program (1988)

Threads without Locks (2007)

Determination of the fifth Busy Beaver value

The PGM-index

Diff Algorithms

Deliberate Abstraction

Fenwick layout for interval trees

difdef: Utility to do an N-way diff and N-way merge, for N>2

Rendezvous Hashing Explained (2020)

Replacing SGX with GitHub Actions: Or how to turn GitHub Actions into a trusted computing oracle

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

More →