PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
<|reference_start|>PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays: 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.<|reference_end|>
@article{lins2003phorma:,
    title={PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays},
    author={Lauro Lins, Sostenes Lins and Silvio Melo},
    journal={arXiv preprint arXiv:cs/0301021},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0301021},
    primaryClass={cs.DS}
}