PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
arXiv:cs/0301021
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.
12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete Applied Mathematics