On the expected longest length probe sequence for hashing with separate chaining.

Pedro Reviriego Lars Holst Juan Antonio Maestro

Published in: J. Discrete Algorithms (2011)

Keyphrases

maximum number
fixed length
minimal length
longest common subsequence
upper bound
arbitrary length
neural network
order preserving
nearest neighbor search
linear hashing
approximate nearest neighbor search
long sequences
biological sequences
random projections
hash functions
dimensionality reduction
data structure