Design of Optimal Merge on Direct Access Devices. - Laurent Hyafil; F. Prusker; Jean Vuillemin (IFIP Congress, 1974)

An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract) - Laurent Hyafil; F. Prusker; Jean Vuillemin (STOC, 1974)

The Complexity of Parallel Evaluation of Linear Recurrence - Laurent Hyafil; H. T. Kung 001 (STOC, 1975)

On the Additive Complexity of Specific Polynomials. - Laurent Hyafil; Jean-Paul Van de Wiele (Inf. Process. Lett., 1975)

Constructing Optimal Binary Decision Trees is NP-Complete. - Laurent Hyafil; Ronald L. Rivest (Inf. Process. Lett., 1976)

Bounds for Selection. - Laurent Hyafil (SIAM J. Comput., 1976)

The Power of Commutativity - Laurent Hyafil (FOCS, 1977)

The Complexity of Parallel Evaluation of Linear Recurrences. - Laurent Hyafil; H. T. Kung 001 (J. ACM, 1977)

On the Parallel Evaluation of Multivariate Polynomials. - Laurent Hyafil (SIAM J. Comput., 1979)

New Algorithms for Selection. - Prakash V. Ramanan; Laurent Hyafil (J. Algorithms, 1984)