Fast scalable construction of ([compressed] static | minimal perfect hash) functions
type: Item
instance of: scholarly article
title: Fast scalable construction of ([compressed] static | minimal perfect hash) functions
zbMATH Open document ID: 1446.68038
author: Marco Genuzio
author: Giuseppe Ottaviano
author: Sebastiano Vigna
published in: Information and Computation
publication date: 2020-07-13T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 7219711
zbMATH Keywords: minimal perfect hash functions
zbMATH Keywords: static functions
zbMATH Keywords: compressed functions
zbMATH Keywords: succinct data structures
describes a project that uses: MapReduce
describes a project that uses: Sux4J
describes a project that uses: METAFONT
describes a project that uses: BUbiNG
MaRDI profile type: Publication
full work available at URL: j.ic.2020.104517
OpenAlex ID: W2999307977
cites work: Alphabet-Independent Compressed Text Indexing
cites work: Q4633891
cites work: Theory and practice of monotone minimal perfect hashing
cites work: Compressed Static Functions with Applications
cites work: Fast Prefix Search in Little Space, with Applications
cites work: An Optimal Bloom Filter Replacement Based on Matrix Solving
cites work: Storing a Compressed Function with Constant Time Access
cites work: Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
cites work: The 3-XORSAT threshold.
cites work: The Satisfiability Threshold fork-XORSAT
cites work: Storing a Sparse Table with 0 (1) Worst Case Access Time
cites work: Q2762514
cites work: Q5501239
cites work: Hash, Displace, and Compress
cites work: Dependent Sets of Constant Weight Binary Vectors
cites work: Generating a canonical prefix encoding
cites work: Sharp load thresholds for cuckoo hashing
cites work: Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
cites work: Tight Thresholds for Cuckoo Hashing via XORSAT
cites work: Satisfiability Thresholds beyond k −XORSAT
cites work: Q3723577
cites work: Q3750097
cites work: Closed-form Expressions for the Moments of the Binomial Probability Distribution
cites work: An almost optimal algorithm for unbounded searching
cites work: Q3726006
cites work: Q4279567
cites work: Exact and approximate membership testers
Wikidata QID: Q126344027
DOI: 10.1016/J.IC.2020.104517
description: scientific article; zbMATH DE number 7219711