data-structures

An analysis of the skip list data structure, exploring its probabilistic balancing mechanics and why it serves as the foundation for Redis sorted sets.

An analysis of Bloom filters, their mathematical foundations, and the trade-offs involved in using probabilistic structures for high-performance membership testing.