Minimal and monotone minimal perfect hash functions
From MaRDI portal
Publication:2946321
Recommendations
Cites work
- scientific article; zbMATH DE number 1688373 (Why is no real title available?)
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 5764819 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 7051248 (Why is no real title available?)
- scientific article; zbMATH DE number 6469129 (Why is no real title available?)
- Cores in random hypergraphs and Boolean formulas
- Design Strategies for Minimal Perfect Hash Functions
- Fast prefix search in little space, with applications
- Hash, Displace, and Compress
- On the Size of Separating Systems and Families of Perfect Hash Functions
- Simple Compression Code Supporting Random Access and Fast String Matching
- Space/time trade-offs in hash coding with allowable errors
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
Cited in
(5)- scientific article; zbMATH DE number 7051248 (Why is no real title available?)
- On the Minimum Number of Multiplications Necessary for Universal Hash Functions
- d-k-min-wise independent family of hash functions
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
This page was built for publication: Minimal and monotone minimal perfect hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946321)