PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays

Details PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays

2003-01-21

arxiv.org/abs/cs/0301021v2

Computer Science

Data Structures and Algorithms

12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete Applied Mathematics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198866