20 search results - page 1 / 4 » Perfect hashing as an almost perfect subtype test |
TOPLAS
2008
13 years 4 months ago
2008
WG
1993
Springer
13 years 9 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...
IPPS
2007
IEEE
13 years 11 months ago
2007
IEEE
We propose several models based on discrete-time Markov chains for the analysis of Distributed Hash Tables (DHTs). Specifically, we examine the Pastry routing protocol, as well a...
CPHYSICS
2006
13 years 4 months ago
2006
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
PKC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...