54 search results - page 4 / 11 » On the Analysis of Linear Probing Hashing |
IBPRIA
2003
Springer
13 years 11 months ago
2003
Springer
The main computational cost in Fractal Image Analysis (FIC) comes from the required range-domain full block comparisons. In this work we propose a new algorithm for this comparison...
ICALP
1994
Springer
13 years 10 months ago
1994
Springer
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
ASIACRYPT
2009
Springer
14 years 17 days ago
2009
Springer
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
WG
1993
Springer
13 years 10 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...