Minimal and monotone minimal perfect hash functions

DOI10.1007/978-3-662-48057-1_1zbMATH Open1465.68056OpenAlexW1750619911MaRDI QIDQ2946321FDOQ2946321

Paolo Boldi

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48057-1_1

Recommendations

• Theory and practice of monotone minimal perfect hashing
• Theory and practice of monotone minimal perfect hashing
• Simple and Space-Efficient Minimal Perfect Hash Functions
• scientific article; zbMATH DE number 7051248
• scientific article; zbMATH DE number 1875411

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Fast Prefix Search in Little Space, with Applications
• Hash, Displace, and Compress
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Title not available (Why is that?)
• Space/time trade-offs in hash coding with allowable errors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory and Practise of Monotone Minimal Perfect Hashing
• Theory and practice of monotone minimal perfect hashing
• Cores in random hypergraphs and Boolean formulas
• Title not available (Why is that?)
• Simple Compression Code Supporting Random Access and Fast String Matching
• Design Strategies for Minimal Perfect Hash Functions

Cited In (3)

• On the Minimum Number of Multiplications Necessary for Universal Hash Functions
• Title not available (Why is that?)
• d-k-min-wise independent family of hash functions

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)