Latest / Deep End Era. Engineering with Sankalp
Every Coat on Its Hook: Hash Tables from the Inside
On 28 December 2011, security engineer Arjun Mehta watches two researchers in Berlin take down web servers with a single form submission, by choosing field names that all collide. In part four of The Deep End's Data Structures series we open the hash table and look at its layout: Luhn's buckets, the IBM 701 team's linear probing, Knuth's explosion of probes near full, Robin Hood's redistribution, Google's Swiss tables searching sixteen slots in one instruction, and the Python dictionary that became ordered by accident. Then we follow hash flooding from Rice University in 2003 to SipHash and…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.