Fast scalable construction of ([compressed] static | minimal perfect hash) functions
DOI10.1016/J.IC.2020.104517zbMATH Open1446.68038OpenAlexW2999307977WikidataQ126344027 ScholiaQ126344027MaRDI QIDQ776836FDOQ776836
Authors: Marco Genuzio, Giuseppe Ottaviano, Sebastiano Vigna 
Publication date: 13 July 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2020.104517
Recommendations
Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast prefix search in little space, with applications
- Hash, Displace, and Compress
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Alphabet-independent compressed text indexing
- Title not available (Why is that?)
- Compressed static functions with applications
- An almost optimal algorithm for unbounded searching
- Title not available (Why is that?)
- Generating a canonical prefix encoding
- Theory and practice of monotone minimal perfect hashing
- Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)
- The satisfiability threshold for \(k\)-XORSAT
- Sharp load thresholds for cuckoo hashing
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- The 3-XORSAT threshold.
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
- Dependent Sets of Constant Weight Binary Vectors
- Title not available (Why is that?)
- Storing a Compressed Function with Constant Time Access
- Title not available (Why is that?)
- Satisfiability thresholds beyond \(k\)-XORSAT
- Closed-form Expressions for the Moments of the Binomial Probability Distribution
- Exact and approximate membership testers
Cited In (9)
- A Modular Design for Hash Functions: Towards Making the Mix-Compress-Mix Approach Practical
- Fingerprinting-based minimal perfect hashing revisited
- Storing a Compressed Function with Constant Time Access
- Compactness of hashing modes and efficiency beyond Merkle tree
- Construct a perfect word hash function in time independent of the size of integers
- T5: Hashing five inputs with three compression calls
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Fast scalable construction of ([compressed] static | minimal perfect hash) functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776836)
