The following pages link to Hash, Displace, and Compress (Q3639281):
Displaying 12 items.
- Linear-space data structures for range frequency queries on arrays and trees (Q261369) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- The effect of table expansion on the program complexity of perfect hash functions (Q1198971) (← links)
- Unique permutation hashing (Q1939279) (← links)
- A new practical algorithm for the construction of a perfect hash function (Q2708246) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- (Q5090472) (← links)
- SSLC: A Search Algorithm Based on Linear Collisions and Poisson Probability Distribution (Q5102064) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
- T5: Hashing five inputs with three compression calls (Q6107278) (← links)
- Fingerprinting-based minimal perfect hashing revisited (Q6579768) (← links)
