diff --git a/content/develop/data-types/probabilistic/bloom-filter.md b/content/develop/data-types/probabilistic/bloom-filter.md
index 10146bdab9..b38a910f4f 100644
--- a/content/develop/data-types/probabilistic/bloom-filter.md
+++ b/content/develop/data-types/probabilistic/bloom-filter.md
@@ -164,7 +164,7 @@ Checking for an element is O(K) or O(K*n) for stacked filters, where n is the nu
 
 ## Academic sources
 - [Space/Time Trade-offs in Hash Coding with Allowable Errors](http://www.dragonwins.com/domains/getteched/bbc/literature/Bloom70.pdf) by Burton H. Bloom.
-- [Scalable Bloom Filters](https://haslab.uminho.pt/cbm/files/dbloom.pdf)
+- [Scalable Bloom Filters](https://gsd.di.uminho.pt/members/cbm/ps/dbloom.pdf)
 
 ## References
 ### Webinars