pith. sign in

arxiv: cs/0301021 · v2 · submitted 2003-01-21 · 💻 cs.DS

PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays

classification 💻 cs.DS
keywords arraysdatahashablemultidimensionalorderperfectperfectlyphorma
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.