Pages that link to "Item:Q4580182"
From MaRDI portal
The following pages link to Fast and scalable minimal perfect hashing for massive key sets (Q4580182):
Displaying 7 items.
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing (Q294669) (← links)
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions (Q776836) (← links)
- A tale of optimizing the space taken by de Bruijn graphs (Q2117772) (← links)
- A resource-frugal probabilistic dictionary and applications in bioinformatics (Q2295632) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
- Fast and simple compact hashing via bucketing (Q6487602) (← links)
- Fingerprinting-based minimal perfect hashing revisited (Q6579768) (← links)