Bounded Wrongness: A Field Guide to Probabilistic Data Structures
Bloom filters and their descendants trade a bounded, one-sided, tunable error for a space collapse exact structures can't match. The whole family, with the math.
Writing
Newest firstContext-Free Grammars Weren't Invented in the 1950s
The 2,500-year history of formal grammar, from Pāṇini's Sanskrit rules to BNF, and why someone proposed renaming it 'Panini-Backus Form' in 1967.