Sciweavers

658 search results - page 62 / 132
» The Grindahl Hash Functions
Sort
View
BMCBI
2010
129views more  BMCBI 2010»
14 years 10 months ago
The LabelHash Algorithm for Substructure Matching
Background: There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseas...
Mark Moll, Drew H. Bryant, Lydia E. Kavraki
STACS
2001
Springer
15 years 2 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel

Publication
173views
16 years 8 months ago
A Comparison of Hashing Schemes for Address Lookup in Computer Networks
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
R. Jain
WEA
2005
Springer
138views Algorithms» more  WEA 2005»
15 years 3 months ago
A Practical Minimal Perfect Hashing Method
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Zi...
ASIACRYPT
2010
Springer
14 years 7 months ago
Random Oracles with(out) Programmability
This paper investigates the Random Oracle Model (ROM) feature known as programmability, which allows security reductions in the ROM to dynamically choose the range points of an ide...
Marc Fischlin, Anja Lehmann, Thomas Ristenpart, Th...