PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays

Simple item page
dc.creatorLins, Lauro
dc.creatorLins, Sostenes
dc.creatorMelo, Silvio
dc.date2003-01-21
dc.date2003-03-23
dc.date.accessioned2026-07-07T03:19:22Z
dc.date.available2026-07-07T03:19:22Z
dc.descriptionIn 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.
dc.description12 pages, 4 figures, 2 tables. Revised version. Submitted to Discrete Applied Mathematics
dc.identifierhttps://arxiv.org/abs/cs/0301021
dc.identifierhttp://arxiv.org/abs/cs/0301021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31434
dc.subjectData Structures and Algorithms
dc.subjectE.2;E.1
dc.titlePHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays
dc.typetext

Files

Collections

arXiv