Lauro Lins

According to our database, Lauro Lins authored at least 5 papers between 2001 and 2004.

Collaborative distances:

• Dijkstra number of six.
• Erdős number of five.

2004

Phorma: perfectly hashable order restricted multidimensional arrays.

Lauro Lins, Sóstenes Lins, Silvio Melo

Discret. Appl. Math., 2004

2003

An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces.

Lauro Lins, Sóstenes Lins, Reinaldo Morabito

J. Oper. Res. Soc., 2003

PHORMA: Perfectly Hashed Order Restricted Multidimensional Array

Lauro Lins, Sóstenes Lins, Silvio Melo

CoRR, 2003

2002

An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container.

Lauro Lins, Sóstenes Lins, Reinaldo Morabito

Eur. J. Oper. Res., 2002

2001

Symmetry Robust Memory Management of Multidimensional Arrays.

Lauro Lins, Sóstenes Lins, Silvio Melo

Electron. Notes Discret. Math., 2001