Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
0705.4676
Cited By
v1
v2
v3
v4
v5
v6
v7
v8 (latest)
Recursive n-gram hashing is pairwise independent, at best
31 May 2007
D. Lemire
Owen Kaser
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Recursive n-gram hashing is pairwise independent, at best"
1 / 1 papers shown
Title
Regular and almost universal hashing: an efficient implementation
Dmytro Ivanchykhin
Sergey Ignatchenko
D. Lemire
16
5
0
30 Sep 2016
1