algorithms

 
 

f82() - A Hash Function with strong theoretical Properties

April 2, 2025

development

algorithms, C

f82() is hash function which hashes a unt64_t 8 byte unsigned integer key to a uint16_t 2 byte hash value. It belongs to the class of tabulation hashing functions and is perfect for implementing lock-less hash tables and other data structures that require an uniform and perfect distribution.

Skip Lists - A Probabilistic Alternative to Balanced Trees

March 29, 2025

development

algorithms

Skip lists are a probabilistic data structure that seem likely to supplant balanced trees as the implementation method of choice for many applications. Skip list algorithms have the same asymptotic expected time bounds as balanced trees and are simpler, faster and use less space.