%0 Conference Proceedings
%F thorup2000
%A Thorup, Mikkel
%T Even strongly universal hashing is pretty fast
%B SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
%P 496-497
%I Society for Industrial and Applied Mathematics
%C Philadelphia, PA, USA
%U http://www.diku.dk/hjemmesider/ansatte/henglein/papers/thorup2000.pdf
%D 2000
%K sorting