Sciweavers

4438 search results - page 23 / 888
» On the Distribution of Keys by Hashing
Sort
View
ANCS
2005
ACM
15 years 5 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
15 years 3 months ago
Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
A series of recent papers have demonstrated collision attacks on popularly used hash functions, including the widely deployed MD5 and SHA-1 algorithm. To assess this threat, the na...
Michael Szydlo, Yiqun Lisa Yin
NSDI
2004
15 years 1 months ago
Democratizing Content Publication with Coral
CoralCDN is a peer-to-peer content distribution network that allows a user to run a web site that offers high performance and meets huge demand, all for the price of a cheap broad...
Michael J. Freedman, Eric Freudenthal, David Mazi&...
WG
1993
Springer
15 years 3 months ago
Graphs, Hypergraphs and Hashing
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...
George Havas, Bohdan S. Majewski, Nicholas C. Worm...
INFOSCALE
2006
ACM
15 years 5 months ago
Adaptive content management in structured P2P communities
A fundamental paradigm in P2P is that of a large community of intermittently-connected nodes that cooperate to share files. Because nodes are intermittently connected, the P2P co...
Jussi Kangasharju, Keith W. Ross, David A. Turner