Title of article :
Phorma: perfectly hashable order restricted multidimensional arrays Original Research Article
Author/Authors :
Lauro Lins، نويسنده , , Sostenes Lins، نويسنده , , S??lvio Melo، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
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 :
Digraph , Implicit enumeration , Nijenhuis–Wilf combinatorial family , Perfect hash function
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
