PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
Data Structures and Algorithms
2007-05-23 v2
Abstract
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.
Cite
@article{arxiv.cs/0301021,
title = {PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays},
author = {Lauro Lins and Sostenes Lins and Silvio Melo},
journal= {arXiv preprint arXiv:cs/0301021},
year = {2007}
}
Comments
12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete Applied Mathematics