Sciweavers

2 search results - page 1 / 1
» Divide and discriminate: algorithm for deterministic and fas...
Sort
View
ANCS
2009
ACM
13 years 2 months ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
TALG
2008
124views more  TALG 2008»
13 years 4 months ago
Uniform deterministic dictionaries
Abstract. We present a new analysis of the well-known family of multiplicative hash functions, and improved deterministic algorithms for selecting "good" hash functions. ...
Milan Ruzic