diff --git a/documents/hash_tables_refs.md b/documents/hash_tables_refs.md
index 84fded9..f73dd5d 100644
--- a/documents/hash_tables_refs.md
+++ b/documents/hash_tables_refs.md
@@ -22,6 +22,7 @@ uint64_t fold_128_to_64(uint128_t hash) {
 
 - [Celis (1986) — original paper proving O(1) variance, Θ(log n) max probe](https://cs.uwaterloo.ca/research/tr/1986/CS-86-14.pdf)
 - [Gankra/Faultlore — clearest walkthrough from first principles](https://faultlore.com/blah/robinhood-part-1)
+- [On Worst Case Robin Hood Hashing](https://cglab.ca/~morin/publications/hashing/robinhood-siamjc.pdf)
 - [Sebastian Sylvan — popularized Robin Hood in systems programming](https://www.sebastiansylvan.com/post/robin-hood-hashing-should-be-your-default-hash-table-implementation/)
 - [Emmanuel Goossaert — detailed C++ implementation + backward-shift deletion](http://codecapsule.com/2013/11/11/robin-hood-hashing/)
 - [Martinus (Ankerl) — most widely used C++ implementation](https://github.com/martinus/unordered_dense)