2003/01/21 by Lauro Lins, Sóstenes Lins, Lins, Lauro +5 · 1 voice
Computer Science · Engineering · #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #E.1 #E.2 #FOS: Computer and information sciences #Optimization and Packing Problems #cs.DS #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.cs/0301021
12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete Applied Mathematics
openalex publication_date 2003/01/21 · arxiv published 2003/01/21 · arxiv created 2003/03/23 · arxiv updated 2003/03/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we propose a simple and efficient data structure yielding a perfect hashing of quite general arrays. The data structure is named phorma, which is an acronym for perfectly hashable order restricted multidimensional array. Keywords: Perfect hash function, Digraph, Implicit enumeration, Nijenhuis-Wilf combinatorial family.