208 search results - page 5 / 42 » Variationally universal hashing |
STACS
2001
Springer
14 years 3 months ago
2001
Springer
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...
COCOON
2004
Springer
14 years 4 months ago
2004
Springer
CORR
2008
Springer
13 years 11 months ago
2008
Springer
SODA
2008
ACM
14 years 9 days ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
FPGA
2004
ACM
14 years 4 months ago
2004
ACM
We present a cryptographic architecture optimization technique called divide-and-concatenate based on two observations: (i) the area of a multiplier and associated data path decre...