Mikkel Thorup. Even strongly universal hashing is pretty fast. In SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, Pages 496-497, Philadelphia, PA, USA, 2000.
Download paper:
Adobe portable document (pdf)
Copyright notice:This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
[ Sorting ]
@InProceedings{thorup2000,
Author = {Thorup, Mikkel},
Title = {Even strongly universal hashing is pretty fast},
BookTitle = {SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms},
Pages = {496--497},
Publisher = {Society for Industrial and Applied Mathematics},
Address = {Philadelphia, PA, USA},
Year = {2000}
}
Get EndNote Reference (.ref)