Rendezvous Hashing Explained
Rendezvous hashing is an algorithm to solve the distributed hash table problem - a common...
Posted by
Ben Coleman
on December 26, 2020 ·
11 mins read
Why is it Okay to Average Embeddings?
People often summarize a “bag of items” by adding together the embeddings for each individual...
Posted by
Ben Coleman
on November 17, 2020 ·
13 mins read
How to develop randomized programs
Randomized algorithms are a pain to develop. If done right, they can seriously improve performance...
Posted by
Ben Coleman
on September 14, 2020 ·
21 mins read
What you should know before optimizing code
Maybe you’ve heard the rules of program optimization.
Posted by
Ben Coleman
on July 21, 2020 ·
8 mins read
Minimal perfect hash functions
If you want to observe a hash function in the wild, all you need to...
Posted by
Ben Coleman
on September 12, 2019 ·
11 mins read