Phorma: Perfectly hashable order restricted multidimensional arrays

Discrete Applied Mathematics

Volumn 141, Issue 1-3, 2004, Pages 209-223

  Lins, Lauro ^a   Lins, Sóstenes ^a   Melo, Sílvio ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

Digraph; Implicit enumeration; Nijenhuis Wilf combinatorial family; Perfect hash function

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMBINATORIAL MATHEMATICS; DATABASE SYSTEMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

DIGRAPH; IMPLICIT ENUMERATION; NIJENHUIS-WILF COMBINATORIAL FAMILY; PERFECT HASH FUNCTIONS;

DATA STRUCTURES;

EID: 2942602904     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00374-3     Document Type: Conference Paper

References (9)

1. Booch G. Object Oriented Design with Applications. 1991;The Benjamin/Cummings Publishing Company, Inc. Mento Park, CA. ISBN 0-8053-0091-0.
2. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, The MIT Electrical Engineering and Computer Science Series, The MIT Press, Cambridge, MA, McGraw-Hill Book Company, New York, 1990, ISBN 0-262-03141-8.
3. Hoffman D.G. Packing Problems and Inequalities. 1981;The Mathematical Gardner, Waderworth, Boston. ISBN 0-534-98015-5.
4. D. Knuth, The Art of Computer Programming, Vol. 3, 2nd Edition, Addison-Wesley, Reading, MA, 1975.
5. L. Lins, Packing in g-blocks, Master Thesis, CIN-UFPE, 2003.
6. Lins L., Lins S., Morabito R. An. n -tet graph approach to non-guillotine packings of n -dimensional boxes into an n -container Eur. J. Oper. Res. 141:2002;421-439.
7. L. Lins, S. Lins, R. Morabito, An L -approach for packing (l,w) -rectangles into rectangular and L -shaped pieces, J. Oper. Res. Soc. 2003, to appear.
8. Nijenhuis A., Wilf H.S. Combinatorial Algorithms for Computers and Calculators. 2nd Edition:1978;Academic Press, New York.
9. H.S. Wilf, East side, west side . Available in PDF at the home page of the author: www.cis.upenn.edu/~wilf , 1990.