Simple and Space-Efficient Minimal Perfect Hash Functions

DOI10.1007/978-3-540-73951-7_13zbMATH Open1209.68152OpenAlexW104648112MaRDI QIDQ3603522FDOQ3603522

Rasmus Pagh, Fabiano C. Botelho, Nivio Ziviani

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_13

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Cited In (17)

• Landau: a language for dynamical systems with automatic differentiation
• Binary Fuse Filters: Fast and Smaller Than Xor Filters
• Semi-external LTL Model Checking
• Fingerprinting-based minimal perfect hashing revisited
• Xor Filters
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cores of random \(r\)-partite hypergraphs
• Flash memory efficient LTL model checking
• Title not available (Why is that?)
• d-k-min-wise independent family of hash functions
• The effect of table expansion on the program complexity of perfect hash functions
• Faster and Space-Optimal Edit Distance “1” Dictionary
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies

This page was built for publication: Simple and Space-Efficient Minimal Perfect Hash Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603522)