Homa Habashi

Efficient Randomized LL/SC that Preserves History Independence

This work demonstrates that one can actually implement the hashing algorithm on available hardware, without an asymptotic increase in step and space complexity, under the reasonable assumption that $m=\Omega(n)$.