arXiv (All)
open access
PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
We present PHastR, a minimal perfect hash function of the PHast family. Like PHast+, the fast-to-build variant of PHast, PHastR finds feasible seeds with bit-parallel operations: its seeds move keys along rings of slots, and to evaluate the seeds of a bucket it cyclically shifts, for each key, a wor
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fine-Grained Analysis of SIMD-Based Hash Table Implementations#1186699
- Database of Long-Lived Symmetric Cryptographic Keys#399076
- Consensus for Compressed Static Functions#1144524
- A Hyperbolic Bound for File Retrieval in DNA-Based Data Storage#1130909
- NIST FIPS 180-4-upd1: Secure Hash Standard (SHS)#2809
Record · ID 1344701
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive