Fast scalable construction of ([compressed] static | minimal perfect hash) functions
From MaRDI portal
Publication:776836
DOI10.1016/j.ic.2020.104517zbMath1446.68038OpenAlexW2999307977WikidataQ126344027 ScholiaQ126344027MaRDI QIDQ776836
Sebastiano Vigna, Giuseppe Ottaviano, Marco Genuzio
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An almost optimal algorithm for unbounded searching
- The 3-XORSAT threshold.
- Satisfiability Thresholds beyond k −XORSAT
- Sharp load thresholds for cuckoo hashing
- Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
- An Optimal Bloom Filter Replacement Based on Matrix Solving
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
- Fast Prefix Search in Little Space, with Applications
- Tight Thresholds for Cuckoo Hashing via XORSAT
- Closed-form Expressions for the Moments of the Binomial Probability Distribution
- Hash, Displace, and Compress
- Storing a Compressed Function with Constant Time Access
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Dependent Sets of Constant Weight Binary Vectors
- Alphabet-Independent Compressed Text Indexing
- Generating a canonical prefix encoding
- The Satisfiability Threshold fork-XORSAT
- Exact and approximate membership testers
- Theory and practice of monotone minimal perfect hashing
- Compressed Static Functions with Applications
This page was built for publication: Fast scalable construction of ([compressed] static | minimal perfect hash) functions
