Experimental and Efficient Algorithms
From MaRDI portal
(Redirected from Publication:5710049)
Experimental and Efficient Algorithms (scientific article; zbMATH DE number 2234668)
Experimental and Efficient Algorithms (scientific article; zbMATH DE number 2234668)
Recommendations
Cited in
(32)- An ordered minimal perfect hashing scheme based upon Euler's theorem
- Perfect hashing
- A scheme for constructing ordered minimal perfect hashing functions
- scientific article; zbMATH DE number 1688373 (Why is no real title available?)
- The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
- scientific article; zbMATH DE number 2185600 (Why is no real title available?)
- A Linear Time Algorithm for Finding Minimal Perfect Hash Functions
- Compact Hash Tables Using Bidirectional Linear Probing
- d-k-min-wise independent family of hash functions
- Simple and Space-Efficient Minimal Perfect Hash Functions
- Design Strategies for Minimal Perfect Hash Functions
- Collections of Functions for Perfect Hashing
- scientific article; zbMATH DE number 31674 (Why is no real title available?)
- scientific article; zbMATH DE number 88958 (Why is no real title available?)
- scientific article; zbMATH DE number 370478 (Why is no real title available?)
- Quasi-perfect Hashing
- scientific article; zbMATH DE number 637315 (Why is no real title available?)
- scientific article; zbMATH DE number 2043349 (Why is no real title available?)
- scientific article; zbMATH DE number 2065606 (Why is no real title available?)
- Fast and scalable minimal perfect hashing for massive key sets
- scientific article; zbMATH DE number 1873290 (Why is no real title available?)
- scientific article; zbMATH DE number 1875411 (Why is no real title available?)
- scientific article; zbMATH DE number 898085 (Why is no real title available?)
- scientific article; zbMATH DE number 7525476 (Why is no real title available?)
- Theory and practice of monotone minimal perfect hashing
- Theory and practice of monotone minimal perfect hashing
- Perfect hashing schemes for mining traversal patterns
- Graphs, hypergraphs and hashing
- ShockHash: towards optimal-space minimal perfect hashing beyond brute-force
- Fingerprinting-based minimal perfect hashing revisited
- Fast scalable construction of ([compressed] static | minimal perfect hash) functions
- Minimal perfect hashing in polynomial time
This page was built for publication: Experimental and Efficient Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710049)