Phorma: perfectly hashable order restricted multidimensional arrays

Authors:
Lauro Lins;Sóstenes Lins;Sílvio Melo
Affiliations:
Centro de Informática, Universidade Federal de Pernamóuco, UFPE, Recife, Brazil;Departamento de Matemática, UFPE, Brazil;Departamento de Matemática, UFPE, Brazil
Venue:
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Year:
2004

Citing 4
Cited 0

Introduction to algorithms

Introduction to algorithms
Object oriented design with applications

Object oriented design with applications
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Combinatorial Algorithms: For Computers and Hard Calculators

Combinatorial Algorithms: For Computers and Hard Calculators

Quantified Score

Hi-index	0.00

Visualization

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.